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)
..............
=====================================================================
Generated by BenchKit 2-3253
Executing tool lola
Input is S_DES-PT-00a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-ebro-149488455600228
=====================================================================

--------------------
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 DES-PT-00a-CTLCardinality-0
FORMULA_NAME DES-PT-00a-CTLCardinality-1
FORMULA_NAME DES-PT-00a-CTLCardinality-10
FORMULA_NAME DES-PT-00a-CTLCardinality-11
FORMULA_NAME DES-PT-00a-CTLCardinality-12
FORMULA_NAME DES-PT-00a-CTLCardinality-13
FORMULA_NAME DES-PT-00a-CTLCardinality-14
FORMULA_NAME DES-PT-00a-CTLCardinality-15
FORMULA_NAME DES-PT-00a-CTLCardinality-2
FORMULA_NAME DES-PT-00a-CTLCardinality-3
FORMULA_NAME DES-PT-00a-CTLCardinality-4
FORMULA_NAME DES-PT-00a-CTLCardinality-5
FORMULA_NAME DES-PT-00a-CTLCardinality-6
FORMULA_NAME DES-PT-00a-CTLCardinality-7
FORMULA_NAME DES-PT-00a-CTLCardinality-8
FORMULA_NAME DES-PT-00a-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1496450139525


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_DES-PT-00a: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
S_DES-PT-00a: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_DES-PT-00a @ 3540 seconds
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 191/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 115 places, 76 transitions, 58 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 101 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-00a-CTLCardinality.task
lola: (((1 <= p114) OR E (F (((1 <= p83) AND (p73 <= p42))))) AND ((((p31 <= 2) AND ((p78 <= p9) OR (p37 <= p77))) AND A (X ((3 <= p83)))) OR (p103 <= p7))) : (((1 <= p73) AND E (G (((3 <= p37) AND (3 <= p12))))) OR E (F (E (X ((3 <= p14)))))) : A (F ((((3 <= p53) AND (p72 <= p90) AND ((p65 <= p14) OR (1 <= p44))) AND A (X ((2 <= p105)))))) : (NOT(A (((p45 <= p5) U (1 <= p23)))) OR E (G ((p94 <= p7)))) : A ((A (G ((p14 <= p33))) U ((2 <= p48) AND (2 <= p20)))) : (A (X (((p33 <= p79) AND (1 <= p8) AND (2 <= p108) AND (p12 <= p79)))) OR E (X (E (G ((p101 <= p53)))))) : NOT((E (G ((p98 <= p83))) OR ((3 <= p49) AND (((p7 <= p114) AND (3 <= p110)) OR (p8 <= 2))))) : NOT(A (((p87 <= 2) U (p64 + 1 <= p55)))) : (A (G (((p79 <= p55) OR (2 <= p16) OR ((p79 <= p66) AND (p11 <= p112))))) AND (p8 <= p103)) : E (((p22 <= 2) U ((p13 + 1 <= p18) AND (p39 + 1 <= p91)))) : A (X ((((2 <= p95) AND (2 <= p51)) OR A (F ((3 <= p15)))))) : (E (X (A (G ((p43 <= p3))))) OR NOT(E (F ((p39 <= p60))))) : NOT((A (((p100 <= p45) U (3 <= p109))) AND (p64 <= p19))) : (A (((p10 <= p54) U ((2 <= p42) OR (2 <= p15)))) AND E (G ((p86 <= 2)))) : E ((((p82 <= p21) OR (p56 <= p33) OR (p50 <= 2)) U ((3 <= p37) OR (3 <= p114) OR (p24 + 1 <= p82)))) : E (((p103 <= p8) U (p93 + 1 <= p73)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((1 <= p114) OR E (F (((1 <= p83) AND (p73 <= p42))))) AND ((((p31 <= 2) AND ((p78 <= p9) OR (p37 <= p77))) AND A (X ((3 <= p83)))) OR (p103 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (1 <= p114)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p114)
lola: processed formula length: 11
lola: 0 rewrites
lola: formula mentions 0 of 115 places; total mentions: 0
lola: closed formula file DES-PT-00a-CTLCardinality.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: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p83) AND (p73 <= p42))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 unused bits
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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-00a-CTLCardinality.sara
lola: SUBRESULT
lola: result: yes
lola: lola: produced by: state space
state equation: calling and running sara
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p31 <= 2) AND ((p78 <= p9) OR (p37 <= p77)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p31 <= 2) AND ((p78 <= p9) OR (p37 <= p77)))
lola: processed formula length: 47
lola: 0 rewrites
lola: formula mentions 0 of 115 places; total mentions: 0
lola: closed formula file DES-PT-00a-CTLCardinality.task
lola: processed formula with 3 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: lola: ========================================
subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= p83)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((3 <= p83))
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 115 places; total mentions: 0
lola: closed formula file DES-PT-00a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p103 <= p7)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p103 <= p7)
lola: processed formula length: 12
lola: 0 rewrites
lola: formula mentions 0 of 115 places; total mentions: 0
lola: closed formula file DES-PT-00a-CTLCardinality.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: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
sara: try reading problem file DES-PT-00a-CTLCardinality.sara.
lola: ...considering subproblem: (((1 <= p73) AND E (G (((3 <= p37) AND (3 <= p12))))) OR E (F (E (X ((3 <= p14))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (1 <= p73)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p73)
lola: processed formula length: 10
lola: 0 rewrites
lola: formula mentions 0 of 115 places; total mentions: 0
lola: closed formula file DES-PT-00a-CTLCardinality.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: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (X ((3 <= p14)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U EX((3 <= p14)))
lola: processed formula length: 24
lola: 2 rewrites
lola: formula mentions 0 of 115 places; total mentions: 0
lola: closed formula file DES-PT-00a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: place or transition ordering is non-deterministic

lola: 447724 markings, 3187091 edges, 2966512333431504896 markings/sec, 0 secs
lola: 823062 markings, 6098346 edges, 75068 markings/sec, 5 secs
lola: 1143532 markings, 8776534 edges, 64094 markings/sec, 10 secs
lola: 1487998 markings, 11720380 edges, 68893 markings/sec, 15 secs
lola: 1841876 markings, 14675802 edges, 70776 markings/sec, 20 secs
lola: 2143503 markings, 17373130 edges, 60325 markings/sec, 25 secs
lola: 2445675 markings, 20078363 edges, 60434 markings/sec, 30 secs
lola: 2713692 markings, 22750978 edges, 53603 markings/sec, 35 secs
lola: 3089622 markings, 25686331 edges, 75186 markings/sec, 40 secs
lola: 3486724 markings, 28712597 edges, 79420 markings/sec, 45 secs
lola: 3803636 markings, 31697565 edges, 63382 markings/sec, 50 secs
lola: 4115825 markings, 34661659 edges, 62438 markings/sec, 55 secs
lola: 4410613 markings, 37648180 edges, 58958 markings/sec, 60 secs
lola: 4724619 markings, 40689345 edges, 62801 markings/sec, 65 secs
lola: 4992444 markings, 43648116 edges, 53565 markings/sec, 70 secs
lola: 5284527 markings, 46685138 edges, 58417 markings/sec, 75 secs
lola: 5575727 markings, 49682619 edges, 58240 markings/sec, 80 secs
lola: 5868784 markings, 52727822 edges, 58611 markings/sec, 85 secs
lola: 6187488 markings, 55705364 edges, 63741 markings/sec, 90 secs
lola: 6521121 markings, 58599532 edges, 66727 markings/sec, 95 secs
lola: 6793042 markings, 61462725 edges, 54384 markings/sec, 100 secs
lola: 7063005 markings, 64299898 edges, 53993 markings/sec, 105 secs
lola: 7320296 markings, 67150708 edges, 51458 markings/sec, 110 secs
lola: 7593581 markings, 70042123 edges, 54657 markings/sec, 115 secs
lola: 7845132 markings, 72904442 edges, 50310 markings/sec, 120 secs
lola: 8089822 markings, 75761125 edges, 48938 markings/sec, 125 secs
lola: 8335809 markings, 78683007 edges, 49197 markings/sec, 130 secs
lola: 8595092 markings, 81544532 edges, 51857 markings/sec, 135 secs
lola: 8850393 markings, 84462087 edges, 51060 markings/sec, 140 secs
lola: 9153965 markings, 87336348 edges, 60714 markings/sec, 145 secs
lola: 9535423 markings, 90134011 edges, 76292 markings/sec, 150 secs
lola: 9845019 markings, 92915918 edges, 61919 markings/sec, 155 secs
lola: 10126942 markings, 95724606 edges, 56385 markings/sec, 160 secs
lola: 10423081 markings, 98546484 edges, 59228 markings/sec, 165 secs
lola: 10749838 markings, 101340388 edges, 65351 markings/sec, 170 secs
lola: 11068421 markings, 104106084 edges, 63717 markings/sec, 175 secs
lola: 11337583 markings, 106842695 edges, 53832 markings/sec, 180 secs
lola: 11590682 markings, 109632843 edges, 50620 markings/sec, 185 secs
lola: 11853435 markings, 112411451 edges, 52551 markings/sec, 190 secs
lola: 12164836 markings, 115278738 edges, 62280 markings/sec, 195 secs
lola: 12514018 markings, 118195868 edges, 69836 markings/sec, 200 secs
lola: 12847342 markings, 121060157 edges, 66665 markings/sec, 205 secs
lola: 13164083 markings, 123901907 edges, 63348 markings/sec, 210 secs
lola: 13483847 markings, 126768879 edges, 63953 markings/sec, 215 secs
lola: 13808922 markings, 129666193 edges, 65015 markings/sec, 220 secs
lola: 14129132 markings, 132541388 edges, 64042 markings/sec, 225 secs
lola: 14436460 markings, 135381653 edges, 61466 markings/sec, 230 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((((3 <= p53) AND (p72 <= p90) AND ((p65 <= p14) OR (1 <= p44))) AND A (X ((2 <= p105))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (((3 <= p53) AND (p72 <= p90) AND ((p65 <= p14) OR (1 <= p44))) AND AX((2 <= p105))))
lola: processed formula length: 95
lola: 2 rewrites
lola: formula mentions 0 of 115 places; total mentions: 0
lola: closed formula file DES-PT-00a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (((p45 <= p5) U (1 <= p23)))) OR E (G ((p94 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p5 + 1 <= p45) R (p23 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((p45 <= p5) U (1 <= p23)))
lola: processed formula length: 32
lola: 7 rewrites
lola: formula mentions 0 of 115 places; total mentions: 0
lola: closed formula file DES-PT-00a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (G ((p14 <= p33))) U ((2 <= p48) AND (2 <= p20))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
lola: processed formula: A(NOT(E(TRUE U (p33 + 1 <= p14))) U ((2 <= p48) AND (2 <= p20)))
lola: processed formula length: 64
lola: 3 rewrites
lola: formula mentions 0 of 115 places; total mentions: 0
lola: closed formula file DES-PT-00a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X (((p33 <= p79) AND (1 <= p8) AND (2 <= p108) AND (p12 <= p79)))) OR E (X (E (G ((p101 <= p53))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((p33 <= p79) AND (1 <= p8) AND (2 <= p108) AND (p12 <= p79))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(((p33 <= p79) AND (1 <= p8) AND (2 <= p108) AND (p12 <= p79)))
lola: processed formula length: 65
lola: 1 rewrites
lola: formula mentions 0 of 115 places; total mentions: 0
lola: closed formula file DES-PT-00a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (G ((p101 <= p53)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(A(TRUE U (p53 + 1 <= p101))))
lola: processed formula length: 36
lola: 3 rewrites
lola: formula mentions 0 of 115 places; total mentions: 0
lola: closed formula file DES-PT-00a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (G ((p98 <= p83))) OR ((3 <= p49) AND (((p7 <= p114) AND (3 <= p110)) OR (p8 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p83 + 1 <= p98)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (p83 + 1 <= p98))
lola: processed formula length: 26
lola: 6 rewrites
lola: formula mentions 0 of 115 places; total mentions: 0
lola: closed formula file DES-PT-00a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: subprocess 7 will run for 367 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: NOT(A (((p87 <= 2) U (p64 + 1 <= p55))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((p87 <= 2) U (p64 + 1 <= p55)))
lola: processed formula length: 37
lola: 7 rewrites
lola: formula mentions 0 of 115 places; total mentions: 0
lola: closed formula file DES-PT-00a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 8 will run for 412 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((p79 <= p55) OR (2 <= p16) OR ((p79 <= p66) AND (p11 <= p112))))) AND (p8 <= p103))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 412 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p79 <= p55) OR (2 <= p16) OR ((p79 <= p66) AND (p11 <= p112)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 unused bits
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: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: subprocess 9 will run for 471 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p22 <= 2) U ((p13 + 1 <= p18) AND (p39 + 1 <= p91))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
lola: processed formula: E((p22 <= 2) U ((p13 + 1 <= p18) AND (p39 + 1 <= p91)))
lola: processed formula length: 55
lola: 1 rewrites
lola: formula mentions 0 of 115 places; total mentions: 0
lola: closed formula file DES-PT-00a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 488607 markings, 3595537 edges, 3112322968437391360 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 10 will run for 549 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((((2 <= p95) AND (2 <= p51)) OR A (F ((3 <= p15))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((((2 <= p95) AND (2 <= p51)) OR A(TRUE U (3 <= p15))))
lola: processed formula length: 57
lola: 2 rewrites
lola: formula mentions 0 of 115 places; total mentions: 0
lola: closed formula file DES-PT-00a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 11 will run for 659 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X (A (G ((p43 <= p3))))) OR NOT(E (F ((p39 <= p60)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 659 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((p43 <= p3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(E(TRUE U (p3 + 1 <= p43))))
lola: processed formula length: 34
lola: 6 rewrites
lola: formula mentions 0 of 115 places; total mentions: 0
lola: closed formula file DES-PT-00a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: subprocess 12 will run for 823 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p60 + 1 <= p39)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 unused bits
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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: lola: produced by: state space
========================================
lola: The predicate is not invariant.
lola: lola: SUBRESULT
state equation: write sara problem file to DES-PT-00a-CTLCardinality-12.saralola:
result: no
lola: The Boolean predicate is false.
lola: lola: ========================================
lola: subprocess 12 will run for 823 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (((p100 <= p45) U (3 <= p109))) AND (p64 <= p19)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
state equation: calling and running sara
lola: lola: RUNNING
========================================
lola: subprocess 12 will run for 823 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p45 + 1 <= p100) R (p109 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((p100 <= p45) U (3 <= p109)))
lola: processed formula length: 35
lola: 9 rewrites
lola: formula mentions 0 of 115 places; total mentions: 0
lola: closed formula file DES-PT-00a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
sara: try reading problem file DES-PT-00a-CTLCardinality-12.sara.lola:
subprocess 13 will run for 1097 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (((p10 <= p54) U ((2 <= p42) OR (2 <= p15)))) AND E (G ((p86 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1097 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p10 <= p54) U ((2 <= p42) OR (2 <= p15))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((p10 <= p54) U ((2 <= p42) OR (2 <= p15)))
lola: processed formula length: 45
lola: 1 rewrites
lola: formula mentions 0 of 115 places; total mentions: 0
lola: closed formula file DES-PT-00a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: subprocess 14 will run for 1646 seconds at most (--localtimelimit=-1)
lola: lola: ================================================================================

lola: ...considering subproblem: E ((((p82 <= p21) OR (p56 <= p33) OR (p50 <= 2)) U ((3 <= p37) OR (3 <= p114) OR (p24 + 1 <= p82))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((p82 <= p21) OR (p56 <= p33) OR (p50 <= 2)) U ((3 <= p37) OR (3 <= p114) OR (p24 + 1 <= p82)))
lola: processed formula length: 101
lola: 1 rewrites
lola: formula mentions 0 of 115 places; total mentions: 0
lola: closed formula file DES-PT-00a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 15 will run for 3292 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p103 <= p8) U (p93 + 1 <= p73)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p103 <= p8) U (p93 + 1 <= p73))
lola: processed formula length: 34
lola: 1 rewrites
lola: formula mentions 0 of 115 places; total mentions: 0
lola: closed formula file DES-PT-00a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: RESULT
lola:
SUMMARY: yes unknown no yes no no no yes no yes no no yes no yes yes
lola: ========================================
FORMULA DES-PT-00a-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00a-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00a-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00a-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00a-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00a-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00a-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00a-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00a-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00a-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00a-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00a-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00a-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00a-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00a-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00a-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496450387954

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="S_DES-PT-00a"
export BK_EXAMINATION="CTLCardinality"
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/S_DES-PT-00a.tgz
mv S_DES-PT-00a execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is S_DES-PT-00a, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r098-ebro-149488455600228"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;