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-3254
Executing tool lola
Input is S_PermAdmissibility-PT-10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-blw7-149441650200426
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496389101184


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


checking for too many tokens
===========================================================================================
S_PermAdmissibility-PT-10: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_PermAdmissibility-PT-10 @ 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: 760/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 168 places, 592 transitions, 136 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 820 transition conflict sets
lola: TASK
lola: reading formula from PermAdmissibility-COL-10-CTLCardinality.task
lola: NOT(E (F (A (G ((c13 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7)))))) : ((((aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7 <= 2) AND (c19 <= 2)) OR (aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7 <= c15) OR (out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7)) AND NOT(NOT(E (F ((in4_6 + in4_7 <= c12)))))) : (E (G (E (X ((c12 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7))))) AND A (X (A (F ((aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7 <= in4_6 + in4_7)))))) : A (F ((c5 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7))) : E (((1 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7) U A (F ((3 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7))))) : (NOT(NOT(A (G ((1 <= in3_4 + in3_5))))) OR (3 <= out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7)) : A ((E (X ((out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7 <= in4_6 + in4_7))) U ((2 <= aux8_2 + aux8_3 + aux8_6 + aux8_7) AND (2 <= aux6_0 + aux6_1 + aux6_4 + aux6_5) AND (3 <= c16) AND (aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7)))) : E (G ((E (G ((c15 <= c11))) OR ((c18 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7) AND (c11 + 1 <= aux7_2 + aux7_3 + aux7_6 + aux7_7))))) : ((2 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7) OR NOT(A (((3 <= in3_4 + in3_5) U (1 <= aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7))))) : NOT(A (X (E (F ((c5 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7)))))) : NOT(A (X (E (G ((aux7_2 + aux7_3 + aux7_6 + aux7_7 <= in4_6 + in4_7)))))) : A (((out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7 <= c7) U ((3 <= c20) AND (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= c15) AND (aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7)))) : (A (F ((3 <= c14))) OR ((2 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7) OR (c6 + 1 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7))) : NOT(E (F (((3 <= c14) AND (c16 <= c110) AND (c6 + 1 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7))))) : ((A (X (((c9 <= c110) OR (in2_2 + in2_3 <= in3_4 + in3_5)))) AND (3 <= c12)) OR E (F (E (F ((1 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7)))))) : NOT((E (G ((c9 <= 0))) AND (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= 2)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (A (G ((c13 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7 + 1 <= c13)))))
lola: processed formula length: 120
lola: 7 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7 <= 2) AND (c19 <= 2)) OR (aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7 <= c15) OR (out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7)) AND NOT(NOT(E (F ((in4_6 + in4_7 <= c12))))))
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: (((aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7 <= 2) AND (c19 <= 2)) OR (aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7 <= c15) OR (out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7 <= 2) AND (c19 <= 2)) OR (aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7 <= c15) OR (out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7))
lola: processed formula length: 343
lola: 6 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: processed formula with 4 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((in4_6 + in4_7 <= c12)))
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 544 bytes per marking, with 0 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: state equation: write sara problem file to PermAdmissibility-COL-10-CTLCardinality-2.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: lola: SUBRESULT
lola: ========================================
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (E (X ((c12 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7))))) AND A (X (A (F ((aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7 <= in4_6 + in4_7))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (X ((c12 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(EX((c12 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7)))))
lola: processed formula length: 102
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 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: 741474 markings, 2581167 edges, 1996945387872583680 markings/sec, 0 secs
lola: 1495259 markings, 5369767 edges, 150757 markings/sec, 5 secs
lola: 2144329 markings, 7896430 edges, 129814 markings/sec, 10 secs
lola: 2798522 markings, 10542111 edges, 130839 markings/sec, 15 secs
lola: 3354940 markings, 13135648 edges, 111284 markings/sec, 20 secs
lola: 3915743 markings, 16148872 edges, 112161 markings/sec, 25 secs
lola: 4464021 markings, 18734859 edges, 109656 markings/sec, 30 secs
lola: 4995122 markings, 21485822 edges, 106220 markings/sec, 35 secs
lola: 5615389 markings, 24217547 edges, 124053 markings/sec, 40 secs
lola: 6320962 markings, 27087746 edges, 141115 markings/sec, 45 secs
lola: 6966676 markings, 29872058 edges, 129143 markings/sec, 50 secs
lola: 7542946 markings, 32583930 edges, 115254 markings/sec, 55 secs
lola: 8061276 markings, 35562194 edges, 103666 markings/sec, 60 secs
lola: 8650617 markings, 38521620 edges, 117868 markings/sec, 65 secs
lola: 9310097 markings, 41667453 edges, 131896 markings/sec, 70 secs
lola: 9992793 markings, 44900336 edges, 136539 markings/sec, 75 secs
lola: 10638097 markings, 47998752 edges, 129061 markings/sec, 80 secs
lola: 11322553 markings, 51059387 edges, 136891 markings/sec, 85 secs
lola: 12038955 markings, 53991887 edges, 143280 markings/sec, 90 secs
lola: 12615756 markings, 56773126 edges, 115360 markings/sec, 95 secs
lola: 13253091 markings, 59737110 edges, 127467 markings/sec, 100 secs
lola: 13826260 markings, 62693756 edges, 114634 markings/sec, 105 secs
lola: 14471670 markings, 65821373 edges, 129082 markings/sec, 110 secs
lola: 15126943 markings, 68984718 edges, 131055 markings/sec, 115 secs
lola: 15743720 markings, 71966135 edges, 123355 markings/sec, 120 secs
lola: 16428591 markings, 74734359 edges, 136974 markings/sec, 125 secs
lola: 17092179 markings, 77754568 edges, 132718 markings/sec, 130 secs
lola: 17752722 markings, 80962244 edges, 132109 markings/sec, 135 secs
lola: 18402191 markings, 83991599 edges, 129894 markings/sec, 140 secs
lola: 19084830 markings, 86954401 edges, 136528 markings/sec, 145 secs
lola: 19846789 markings, 89803169 edges, 152392 markings/sec, 150 secs
lola: 20662105 markings, 92701593 edges, 163063 markings/sec, 155 secs
lola: 21287464 markings, 95366509 edges, 125072 markings/sec, 160 secs
lola: 22040340 markings, 98052081 edges, 150575 markings/sec, 165 secs
lola: 22669318 markings, 101001413 edges, 125796 markings/sec, 170 secs
lola: 23264796 markings, 104200948 edges, 119096 markings/sec, 175 secs
lola: 23881156 markings, 107121864 edges, 123272 markings/sec, 180 secs
lola: 24483855 markings, 110241132 edges, 120540 markings/sec, 185 secs
lola: 25158381 markings, 113257539 edges, 134905 markings/sec, 190 secs
lola: 25780944 markings, 116115884 edges, 124513 markings/sec, 195 secs
lola: 26335019 markings, 119273551 edges, 110815 markings/sec, 200 secs
lola: 26999991 markings, 122567610 edges, 132994 markings/sec, 205 secs
lola: 27628106 markings, 125657276 edges, 125623 markings/sec, 210 secs
lola: 28232901 markings, 128598688 edges, 120959 markings/sec, 215 secs
lola: 28882251 markings, 131494886 edges, 129870 markings/sec, 220 secs
lola: 29448389 markings, 134361423 edges, 113228 markings/sec, 225 secs
lola: 30047217 markings, 137458752 edges, 119766 markings/sec, 230 secs
lola: 30641953 markings, 140454069 edges, 118947 markings/sec, 235 secs
lola: 31236280 markings, 143276827 edges, 118865 markings/sec, 240 secs
lola: 31822147 markings, 146149368 edges, 117173 markings/sec, 245 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 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((c5 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (c5 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7))
lola: processed formula length: 87
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 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: 2639717 markings, 2802597 edges, 2011001681961025536 markings/sec, 0 secs
lola: 5179695 markings, 5537306 edges, 507996 markings/sec, 5 secs
lola: 7824867 markings, 8359424 edges, 529034 markings/sec, 10 secs
lola: 10317502 markings, 11063464 edges, 498527 markings/sec, 15 secs
lola: 12959511 markings, 13942703 edges, 528402 markings/sec, 20 secs
lola: 15579036 markings, 16838031 edges, 523905 markings/sec, 25 secs
lola: 18080298 markings, 19577167 edges, 500252 markings/sec, 30 secs
lola: 20515899 markings, 22253455 edges, 487120 markings/sec, 35 secs
lola: 23025760 markings, 25013527 edges, 501972 markings/sec, 40 secs
lola: 25520888 markings, 27767079 edges, 499026 markings/sec, 45 secs
lola: 27993275 markings, 30486761 edges, 494477 markings/sec, 50 secs
lola: 30534943 markings, 33221400 edges, 508334 markings/sec, 55 secs
lola: 33070809 markings, 35983405 edges, 507173 markings/sec, 60 secs
lola: 35558963 markings, 38691344 edges, 497631 markings/sec, 65 secs
lola: 38030564 markings, 41356401 edges, 494320 markings/sec, 70 secs
lola: 40476061 markings, 44021387 edges, 489099 markings/sec, 75 secs
lola: 42906864 markings, 46648436 edges, 486161 markings/sec, 80 secs
lola: 45253205 markings, 49203354 edges, 469268 markings/sec, 85 secs
lola: 47652122 markings, 51792472 edges, 479783 markings/sec, 90 secs
lola: 49989095 markings, 54336924 edges, 467395 markings/sec, 95 secs
lola: 52307148 markings, 56858378 edges, 463611 markings/sec, 100 secs
lola: 54751695 markings, 59524946 edges, 488909 markings/sec, 105 secs
lola: 57120073 markings, 62114564 edges, 473676 markings/sec, 110 secs
lola: 59494995 markings, 64706590 edges, 474984 markings/sec, 115 secs
lola: 61902218 markings, 67318640 edges, 481445 markings/sec, 120 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 263 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((1 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7) U A (F ((3 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((1 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7) U A(TRUE U (3 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7)))
lola: processed formula length: 168
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 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: 2309748 markings, 2544842 edges, 2933393943691264000 markings/sec, 0 secs
lola: 4478615 markings, 5010638 edges, 433773 markings/sec, 5 secs
lola: 6508281 markings, 7594750 edges, 405933 markings/sec, 10 secs
lola: 8650918 markings, 10125664 edges, 428527 markings/sec, 15 secs
lola: 10835505 markings, 12616299 edges, 436917 markings/sec, 20 secs
lola: 12879946 markings, 14911770 edges, 408888 markings/sec, 25 secs
lola: 15010633 markings, 17503000 edges, 426137 markings/sec, 30 secs
lola: 16938142 markings, 19633176 edges, 385502 markings/sec, 35 secs
lola: 18818743 markings, 21924638 edges, 376120 markings/sec, 40 secs
lola: 20800586 markings, 24241536 edges, 396369 markings/sec, 45 secs
lola: 22754717 markings, 26440682 edges, 390826 markings/sec, 50 secs
lola: 24631209 markings, 28570078 edges, 375298 markings/sec, 55 secs
lola: 26302120 markings, 30692693 edges, 334182 markings/sec, 60 secs
lola: 28151681 markings, 32786519 edges, 369912 markings/sec, 65 secs
lola: 30048576 markings, 35104690 edges, 379379 markings/sec, 70 secs
lola: 32005068 markings, 37315182 edges, 391298 markings/sec, 75 secs
lola: 33857077 markings, 39496993 edges, 370402 markings/sec, 80 secs
lola: 35718585 markings, 41686886 edges, 372302 markings/sec, 85 secs
lola: 37615573 markings, 43840947 edges, 379398 markings/sec, 90 secs
lola: 39397825 markings, 45961366 edges, 356450 markings/sec, 95 secs
lola: 41092945 markings, 47975497 edges, 339024 markings/sec, 100 secs
lola: 42756622 markings, 49957377 edges, 332735 markings/sec, 105 secs
lola: 44547369 markings, 52076157 edges, 358149 markings/sec, 110 secs
lola: 46343960 markings, 54169737 edges, 359318 markings/sec, 115 secs
lola: 48226123 markings, 56304673 edges, 376433 markings/sec, 120 secs
lola: 49852640 markings, 58298878 edges, 325303 markings/sec, 125 secs
lola: 51470512 markings, 60232855 edges, 323574 markings/sec, 130 secs
lola: 53099901 markings, 62122638 edges, 325878 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 274 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(NOT(A (G ((1 <= in3_4 + in3_5))))) OR (3 <= out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 274 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= in3_4 + in3_5)))
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 544 bytes per marking, with 0 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: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 301 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7)
lola: processed formula length: 76
lola: 6 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-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:
SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 301 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (X ((out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7 <= in4_6 + in4_7))) U ((2 <= aux8_2 + aux8_3 + aux8_6 + aux8_7) AND (2 <= aux6_0 + aux6_1 + aux6_4 + aux6_5) AND (3 <= c16) AND (aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(EX((out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7 <= in4_6 + in4_7)) U ((2 <= aux8_2 + aux8_3 + aux8_6 + aux8_7) AND (2 <= aux6_0 + aux6_1 + aux6_4 + aux6_5) AND (3 <= c16) AND (aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7)))
lola: processed formula length: 357
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 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 7 will run for 335 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((E (G ((c15 <= c11))) OR ((c18 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7) AND (c11 + 1 <= aux7_2 + aux7_3 + aux7_6 + aux7_7)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (A(TRUE U (c11 + 1 <= c15)) AND ((aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7 + 1 <= c18) OR (aux7_2 + aux7_3 + aux7_6 + aux7_7 <= c11)))))
lola: processed formula length: 187
lola: 6 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 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: 1185289 markings, 3142140 edges, 3225752436249460736 markings/sec, 0 secs
lola: 2180629 markings, 6340223 edges, 199068 markings/sec, 5 secs
lola: 3247069 markings, 9575762 edges, 213288 markings/sec, 10 secs
lola: 4412750 markings, 12737989 edges, 233136 markings/sec, 15 secs
lola: 5589205 markings, 16005115 edges, 235291 markings/sec, 20 secs
lola: 6640274 markings, 19375506 edges, 210214 markings/sec, 25 secs
lola: 7552790 markings, 22600420 edges, 182503 markings/sec, 30 secs
lola: 8396250 markings, 25902318 edges, 168692 markings/sec, 35 secs
lola: 9241780 markings, 29472752 edges, 169106 markings/sec, 40 secs
lola: 10211016 markings, 32738875 edges, 193847 markings/sec, 45 secs
lola: 11122694 markings, 35906139 edges, 182336 markings/sec, 50 secs
lola: 12059931 markings, 39040141 edges, 187447 markings/sec, 55 secs
lola: 13057532 markings, 42168046 edges, 199520 markings/sec, 60 secs
lola: 13917185 markings, 45359500 edges, 171931 markings/sec, 65 secs
lola: 14666464 markings, 48586489 edges, 149856 markings/sec, 70 secs
lola: 15433638 markings, 52059412 edges, 153435 markings/sec, 75 secs
lola: 16185451 markings, 55273150 edges, 150363 markings/sec, 80 secs
lola: 16955151 markings, 58365360 edges, 153940 markings/sec, 85 secs
lola: 17649128 markings, 61512322 edges, 138795 markings/sec, 90 secs
lola: 18355292 markings, 64859716 edges, 141233 markings/sec, 95 secs
lola: 19068627 markings, 67983377 edges, 142667 markings/sec, 100 secs
lola: 19773172 markings, 71086950 edges, 140909 markings/sec, 105 secs
lola: 20502049 markings, 74345993 edges, 145775 markings/sec, 110 secs
lola: 21230810 markings, 77641630 edges, 145752 markings/sec, 115 secs
lola: 21847367 markings, 81025586 edges, 123311 markings/sec, 120 secs
lola: 22612005 markings, 83964486 edges, 152928 markings/sec, 125 secs
lola: 23359970 markings, 86967077 edges, 149593 markings/sec, 130 secs
lola: 24129430 markings, 90029979 edges, 153892 markings/sec, 135 secs
lola: 24845398 markings, 93012657 edges, 143194 markings/sec, 140 secs
lola: 25466651 markings, 96036846 edges, 124251 markings/sec, 145 secs
lola: 26080973 markings, 99047971 edges, 122864 markings/sec, 150 secs
lola: 26688725 markings, 102079865 edges, 121550 markings/sec, 155 secs
lola: 27248926 markings, 105082132 edges, 112040 markings/sec, 160 secs
lola: 27764621 markings, 108353443 edges, 103139 markings/sec, 165 secs
lola: 28279388 markings, 111431756 edges, 102953 markings/sec, 170 secs
lola: 28970678 markings, 114470331 edges, 138258 markings/sec, 175 secs
lola: 29958888 markings, 117190499 edges, 197642 markings/sec, 180 secs
lola: 30859726 markings, 120073080 edges, 180168 markings/sec, 185 secs
lola: 31764059 markings, 122822956 edges, 180867 markings/sec, 190 secs
lola: 32772370 markings, 125575896 edges, 201662 markings/sec, 195 secs
lola: 33698342 markings, 128173598 edges, 185194 markings/sec, 200 secs
lola: 34665235 markings, 130918642 edges, 193379 markings/sec, 205 secs
lola: 35468549 markings, 133737941 edges, 160663 markings/sec, 210 secs
lola: 36273531 markings, 136521852 edges, 160996 markings/sec, 215 secs
lola: 37005079 markings, 139491064 edges, 146310 markings/sec, 220 secs
lola: 37737063 markings, 142618338 edges, 146397 markings/sec, 225 secs
lola: 38507046 markings, 145559761 edges, 153997 markings/sec, 230 secs
lola: 39194194 markings, 148358609 edges, 137430 markings/sec, 235 secs
lola: 39902117 markings, 151113433 edges, 141585 markings/sec, 240 secs
lola: 40682958 markings, 153874478 edges, 156168 markings/sec, 245 secs
lola: 41445474 markings, 156658003 edges, 152503 markings/sec, 250 secs
lola: 42081976 markings, 159474231 edges, 127300 markings/sec, 255 secs
lola: 42689526 markings, 162336035 edges, 121510 markings/sec, 260 secs
lola: 43284301 markings, 165408130 edges, 118955 markings/sec, 265 secs
lola: 43972266 markings, 168551785 edges, 137593 markings/sec, 270 secs
lola: 44671111 markings, 171768708 edges, 139769 markings/sec, 275 secs
lola: 45356380 markings, 174839683 edges, 137054 markings/sec, 280 secs
lola: 45935683 markings, 177884574 edges, 115861 markings/sec, 285 secs
lola: 46536779 markings, 181147393 edges, 120219 markings/sec, 290 secs
lola: 47175647 markings, 184275090 edges, 127774 markings/sec, 295 secs
lola: 47854012 markings, 187292040 edges, 135673 markings/sec, 300 secs
lola: 48413505 markings, 190344872 edges, 111899 markings/sec, 305 secs
lola: 49111980 markings, 193551570 edges, 139695 markings/sec, 310 secs
lola: 49814017 markings, 196761469 edges, 140407 markings/sec, 315 secs
lola: 50398911 markings, 199971612 edges, 116979 markings/sec, 320 secs
lola: 51064158 markings, 203044012 edges, 133049 markings/sec, 325 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 335 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7) OR NOT(A (((3 <= in3_4 + in3_5) U (1 <= aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 335 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7)
lola: processed formula length: 76
lola: 4 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-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 9 will run for 382 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((in3_4 + in3_5 <= 2) R (aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((3 <= in3_4 + in3_5) U (1 <= aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7)))
lola: processed formula length: 115
lola: 7 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 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: ========================================
lola: subprocess 9 will run for 382 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (X (E (F ((c5 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(E(TRUE U (c5 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7))))
lola: processed formula length: 104
lola: 8 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 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 10 will run for 446 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (X (E (G ((aux7_2 + aux7_3 + aux7_6 + aux7_7 <= in4_6 + in4_7))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U (in4_6 + in4_7 + 1 <= aux7_2 + aux7_3 + aux7_6 + aux7_7)))
lola: processed formula length: 70
lola: 7 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 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: 1935693 markings, 3568523 edges, 3689348869717491712 markings/sec, 0 secs
lola: 3576404 markings, 6532910 edges, 328142 markings/sec, 5 secs
lola: 5388641 markings, 9805709 edges, 362447 markings/sec, 10 secs
lola: 7259400 markings, 13241139 edges, 374152 markings/sec, 15 secs
lola: 8932827 markings, 16303536 edges, 334685 markings/sec, 20 secs
lola: 10256240 markings, 19847955 edges, 264683 markings/sec, 25 secs
lola: 11503679 markings, 22983648 edges, 249488 markings/sec, 30 secs
lola: 12626119 markings, 26082512 edges, 224488 markings/sec, 35 secs
lola: 13823068 markings, 29255222 edges, 239390 markings/sec, 40 secs
lola: 15067802 markings, 32299780 edges, 248947 markings/sec, 45 secs
lola: 16390666 markings, 35559012 edges, 264573 markings/sec, 50 secs
lola: 17645755 markings, 38843706 edges, 251018 markings/sec, 55 secs
lola: 18710181 markings, 42077037 edges, 212885 markings/sec, 60 secs
lola: 19911984 markings, 45292855 edges, 240361 markings/sec, 65 secs
lola: 21187509 markings, 48731041 edges, 255105 markings/sec, 70 secs
lola: 22371043 markings, 51836369 edges, 236707 markings/sec, 75 secs
lola: 23685920 markings, 55066110 edges, 262975 markings/sec, 80 secs
lola: 24847457 markings, 58294168 edges, 232307 markings/sec, 85 secs
lola: 26076418 markings, 61398756 edges, 245792 markings/sec, 90 secs
lola: 27188087 markings, 64622364 edges, 222334 markings/sec, 95 secs
lola: 28383787 markings, 67856580 edges, 239140 markings/sec, 100 secs
lola: 29619155 markings, 70840660 edges, 247074 markings/sec, 105 secs
lola: 30869030 markings, 74330825 edges, 249975 markings/sec, 110 secs
lola: 32103068 markings, 77485087 edges, 246808 markings/sec, 115 secs
lola: 33158610 markings, 80607666 edges, 211108 markings/sec, 120 secs
lola: 34340371 markings, 83837280 edges, 236352 markings/sec, 125 secs
lola: 35659433 markings, 87153654 edges, 263812 markings/sec, 130 secs
lola: 36914090 markings, 90304964 edges, 250931 markings/sec, 135 secs
lola: 38105667 markings, 93534336 edges, 238315 markings/sec, 140 secs
lola: 39574715 markings, 96772489 edges, 293810 markings/sec, 145 secs
lola: 41159145 markings, 99646643 edges, 316886 markings/sec, 150 secs
lola: 42788318 markings, 102729781 edges, 325835 markings/sec, 155 secs
lola: 44417150 markings, 105727106 edges, 325766 markings/sec, 160 secs
lola: 45934452 markings, 108540781 edges, 303460 markings/sec, 165 secs
lola: 47245720 markings, 111522688 edges, 262254 markings/sec, 170 secs
lola: 48263418 markings, 114773381 edges, 203540 markings/sec, 175 secs
lola: 49470675 markings, 117680856 edges, 241451 markings/sec, 180 secs
lola: 50320854 markings, 120659472 edges, 170036 markings/sec, 185 secs
lola: 51348625 markings, 123505479 edges, 205554 markings/sec, 190 secs
lola: 52301942 markings, 126296696 edges, 190663 markings/sec, 195 secs
lola: 53363215 markings, 129321215 edges, 212255 markings/sec, 200 secs
lola: 54524259 markings, 132457159 edges, 232209 markings/sec, 205 secs
lola: 55686802 markings, 135535965 edges, 232509 markings/sec, 210 secs
lola: 56824961 markings, 138683777 edges, 227632 markings/sec, 215 secs
lola: 57811896 markings, 141676562 edges, 197387 markings/sec, 220 secs
lola: 58922751 markings, 144784735 edges, 222171 markings/sec, 225 secs
lola: 60041910 markings, 147686152 edges, 223832 markings/sec, 230 secs
lola: 61172914 markings, 151026867 edges, 226201 markings/sec, 235 secs
lola: 62245393 markings, 153987462 edges, 214496 markings/sec, 240 secs
lola: 63163960 markings, 157103302 edges, 183713 markings/sec, 245 secs
lola: 64207961 markings, 159987491 edges, 208800 markings/sec, 250 secs
lola: 65263101 markings, 162990904 edges, 211028 markings/sec, 255 secs
lola: 66394890 markings, 166076109 edges, 226358 markings/sec, 260 secs
lola: 67452039 markings, 169106074 edges, 211430 markings/sec, 265 secs
lola: 68513543 markings, 172029674 edges, 212301 markings/sec, 270 secs
lola: 69597977 markings, 174970071 edges, 216887 markings/sec, 275 secs
lola: 70597382 markings, 177943827 edges, 199881 markings/sec, 280 secs
lola: 71801795 markings, 181029503 edges, 240883 markings/sec, 285 secs
lola: 73518145 markings, 184296879 edges, 343270 markings/sec, 290 secs
lola: 74750134 markings, 186646014 edges, 246398 markings/sec, 295 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 475 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7 <= c7) U ((3 <= c20) AND (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= c15) AND (aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7 <= c7) U ((3 <= c20) AND (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= c15) AND (aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7)))
lola: processed formula length: 343
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 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: subprocess 12 will run for 594 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F ((3 <= c14))) OR ((2 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7) OR (c6 + 1 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: lola: ========================================subprocess 12 will run for 594 seconds at most (--localtimelimit=-1)

lola: ========================================
lola: ...considering subproblem: A (F ((3 <= c14)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (3 <= c14))
lola: processed formula length: 20
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 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: subprocess 13 will run for 793 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7) OR (c6 + 1 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7) OR (c6 + 1 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7))
lola: processed formula length: 164
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: processed formula with 2 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 793 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (((3 <= c14) AND (c16 <= c110) AND (c6 + 1 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7)))))
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 544 bytes per marking, with 0 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 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1189 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (X (((c9 <= c110) OR (in2_2 + in2_3 <= in3_4 + in3_5)))) AND (3 <= c12)) OR E (F (E (F ((1 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1189 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((c9 <= c110) OR (in2_2 + in2_3 <= in3_4 + in3_5))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(((c9 <= c110) OR (in2_2 + in2_3 <= in3_4 + in3_5)))
lola: processed formula length: 55
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 15 will run for 2379 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= c12)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= c12)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 2379 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (G ((c9 <= 0))) AND (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2379 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= c9)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (1 <= c9))
lola: processed formula length: 19
lola: 6 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 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: 2575542 markings, 5305653 edges, 1997740472218419200 markings/sec, 0 secs
lola: 5069659 markings, 10734833 edges, 498823 markings/sec, 5 secs
lola: 7093013 markings, 15268249 edges, 404671 markings/sec, 10 secs
lola: 9546326 markings, 20690671 edges, 490663 markings/sec, 15 secs
lola: 11924160 markings, 26049907 edges, 475567 markings/sec, 20 secs
lola: 14311546 markings, 31465026 edges, 477477 markings/sec, 25 secs
lola: 16726310 markings, 36891939 edges, 482953 markings/sec, 30 secs
lola: 19072452 markings, 42203594 edges, 469228 markings/sec, 35 secs
lola: 21362995 markings, 47400504 edges, 458109 markings/sec, 40 secs
lola: 23669413 markings, 52714151 edges, 461284 markings/sec, 45 secs
lola: 26112955 markings, 58167153 edges, 488708 markings/sec, 50 secs
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: RESULT
lola:
SUMMARY: no yes unknown unknown unknown no no unknown yes no unknown no no no unknown yes
lola: ========================================
FORMULA PermAdmissibility-COL-10-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496390319869

--------------------
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_PermAdmissibility-PT-10"
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_PermAdmissibility-PT-10.tgz
mv S_PermAdmissibility-PT-10 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is S_PermAdmissibility-PT-10, 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 r118-blw7-149441650200426"
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 ;