fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r038-blw7-149440485000408
Last Updated
June 27, 2017

About the Execution of LoLA for PermAdmissibility-PT-02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15946.140 1700645.00 1704556.00 1319.10 TTFFT???F??FTFF? normal

Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
......
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is PermAdmissibility-PT-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r038-blw7-149440485000408
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1494656789614


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ PermAdmissibility-PT-02 @ 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-02-CTLCardinality.task
lola: (((((c11 <= in1_0 + in1_1) AND (c7 <= c14) AND ((3 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7) OR (1 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7))) AND E (X ((c110 <= c17)))) AND ()) OR ((aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7 <= c18) AND E (F ((2 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7))))) : (E (G (A (X ((3 <= c5))))) OR ((E (F ((c8 <= c12))) AND E (F ((1 <= c14)))) OR A (G (((c110 <= c9) OR (3 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7)))))) : (NOT(A (((in1_0 + in1_1 <= in4_6 + in4_7) U (1 <= c15)))) AND NOT(A (G (((c6 <= in2_2 + in2_3) AND (3 <= c7)))))) : E (F (A (F (((1 <= aux5_0 + aux5_1 + aux5_4 + aux5_5) AND (aux5_0 + aux5_1 + aux5_4 + aux5_5 <= c11)))))) : E (G ((E (X ((1 <= in1_0 + in1_1))) OR (out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7 <= in1_0 + in1_1)))) : (A (G ((aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7 <= 0))) OR A (X ((((c13 <= c14) AND (3 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7)) OR (2 <= aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7))))) : E (X (A (((c19 <= c13) U (2 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7))))) : (((c6 + 1 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7) OR (3 <= c11) OR (c5 <= 1)) OR E (((aux7_2 + aux7_3 + aux7_6 + aux7_7 <= 0) U (out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7 + 1 <= c17)))) : A (G ((E (X ((c19 <= c5))) OR ((out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7 + 1 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7) OR (out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7 + 1 <= c5))))) : E (G (NOT(A (F ((1 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7)))))) : NOT(E (F (A (F ((2 <= c19)))))) : A ((E (F ((aux5_0 + aux5_1 + aux5_4 + aux5_5 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7))) U A (G ((3 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7))))) : NOT(E (X (A (G ((aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= c15)))))) : E ((((aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 + 1 <= out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7) OR (aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= c8)) U ((in2_2 + in2_3 + 1 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7) AND (aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7 + 1 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7)))) : A (X (NOT(E (G ((aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7)))))) : A (G (A (X ((out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((((c11 <= in1_0 + in1_1) AND (c7 <= c14) AND ((3 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7) OR (1 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7))) AND E (X ((c110 <= c17)))) AND ()) OR ((aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7 <= c18) AND E (F ((2 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4... (shortened)
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: ((c11 <= in1_0 + in1_1) AND (c7 <= c14) AND ((3 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7) OR (1 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((c11 <= in1_0 + in1_1) AND (c7 <= c14) AND ((3 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7) OR (1 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7)))
lola: processed formula length: 212
lola: 3 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
lola: processed formula with 4 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: (aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7 <= c18)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7 <= c18)
lola: processed formula length: 86
lola: 3 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7)))
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: 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (A (X ((3 <= c5))))) OR ((E (F ((c8 <= c12))) AND E (F ((1 <= c14)))) OR A (G (((c110 <= c9) OR (3 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7))))))
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: E (G (A (X ((3 <= c5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(AX((3 <= c5)))))
lola: processed formula length: 33
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((c8 <= 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= c14)))
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-02-CTLCardinality-3.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: (NOT(A (((in1_0 + in1_1 <= in4_6 + in4_7) U (1 <= c15)))) AND NOT(A (G (((c6 <= in2_2 + in2_3) AND (3 <= c7))))))
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 (((in4_6 + in4_7 + 1 <= in1_0 + in1_1) R (c15 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((in1_0 + in1_1 <= in4_6 + in4_7) U (1 <= c15)))
lola: processed formula length: 53
lola: 10 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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: 1999841 markings, 2785375 edges, 3689348869717491712 markings/sec, 0 secs
lola: 3709141 markings, 5508423 edges, 341860 markings/sec, 5 secs
lola: 5326592 markings, 8112314 edges, 323490 markings/sec, 10 secs
lola: 6938179 markings, 10755514 edges, 322317 markings/sec, 15 secs
lola: 8518158 markings, 13376237 edges, 315996 markings/sec, 20 secs
lola: 10003045 markings, 15972316 edges, 296977 markings/sec, 25 secs
lola: 11583179 markings, 18606004 edges, 316027 markings/sec, 30 secs
lola: 13125277 markings, 21240275 edges, 308420 markings/sec, 35 secs
lola: 14580108 markings, 23786727 edges, 290966 markings/sec, 40 secs
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 3 will run for 268 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (F (((1 <= aux5_0 + aux5_1 + aux5_4 + aux5_5) AND (aux5_0 + aux5_1 + aux5_4 + aux5_5 <= c11))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U ((1 <= aux5_0 + aux5_1 + aux5_4 + aux5_5) AND (aux5_0 + aux5_1 + aux5_4 + aux5_5 <= c11))))
lola: processed formula length: 109
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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: 843546 markings, 3825418 edges, 2549028318120771584 markings/sec, 0 secs
lola: 1654552 markings, 7822538 edges, 162201 markings/sec, 5 secs
lola: 2466363 markings, 11653175 edges, 162362 markings/sec, 10 secs
lola: 3249547 markings, 15160779 edges, 156637 markings/sec, 15 secs
lola: 4033741 markings, 18664645 edges, 156839 markings/sec, 20 secs
lola: 4798721 markings, 22181344 edges, 152996 markings/sec, 25 secs
lola: 5551528 markings, 25597294 edges, 150561 markings/sec, 30 secs
lola: 6280601 markings, 28841507 edges, 145815 markings/sec, 35 secs
lola: 7002924 markings, 32243242 edges, 144465 markings/sec, 40 secs
lola: 7728075 markings, 35635887 edges, 145030 markings/sec, 45 secs
lola: 8443916 markings, 39307350 edges, 143168 markings/sec, 50 secs
lola: 9149323 markings, 42925944 edges, 141081 markings/sec, 55 secs
lola: 9865151 markings, 46384504 edges, 143166 markings/sec, 60 secs
lola: 10554130 markings, 50024806 edges, 137796 markings/sec, 65 secs
lola: 11246814 markings, 53674120 edges, 138537 markings/sec, 70 secs
lola: 12007684 markings, 57135307 edges, 152174 markings/sec, 75 secs
lola: 12741754 markings, 60450996 edges, 146814 markings/sec, 80 secs
lola: 13448409 markings, 63633197 edges, 141331 markings/sec, 85 secs
lola: 14180540 markings, 66958713 edges, 146426 markings/sec, 90 secs
lola: 14905449 markings, 70258620 edges, 144982 markings/sec, 95 secs
lola: 15681404 markings, 73631962 edges, 155191 markings/sec, 100 secs
lola: 16418001 markings, 76913585 edges, 147319 markings/sec, 105 secs
lola: 17157102 markings, 80138538 edges, 147820 markings/sec, 110 secs
lola: 17898738 markings, 83635931 edges, 148327 markings/sec, 115 secs
lola: 18601037 markings, 86890076 edges, 140460 markings/sec, 120 secs
lola: 19332680 markings, 90308627 edges, 146329 markings/sec, 125 secs
lola: 20087426 markings, 93667275 edges, 150949 markings/sec, 130 secs
lola: 20821246 markings, 97309229 edges, 146764 markings/sec, 135 secs
lola: 21554788 markings, 100968356 edges, 146708 markings/sec, 140 secs
lola: 22258743 markings, 104486571 edges, 140791 markings/sec, 145 secs
lola: 22928876 markings, 107815378 edges, 134027 markings/sec, 150 secs
lola: 23646551 markings, 111430129 edges, 143535 markings/sec, 155 secs
lola: 24350353 markings, 114916534 edges, 140760 markings/sec, 160 secs
lola: 25029608 markings, 118349386 edges, 135851 markings/sec, 165 secs
lola: 25760930 markings, 121946875 edges, 146264 markings/sec, 170 secs
lola: 26477048 markings, 125523825 edges, 143224 markings/sec, 175 secs
lola: 27140617 markings, 128791059 edges, 132714 markings/sec, 180 secs
lola: 27831564 markings, 132213719 edges, 138189 markings/sec, 185 secs
lola: 28513104 markings, 135669171 edges, 136308 markings/sec, 190 secs
lola: 29197176 markings, 139085406 edges, 136814 markings/sec, 195 secs
lola: 29865669 markings, 142413527 edges, 133699 markings/sec, 200 secs
lola: 30532011 markings, 145720545 edges, 133268 markings/sec, 205 secs
lola: 31290169 markings, 149283276 edges, 151632 markings/sec, 210 secs
lola: 32026003 markings, 152710815 edges, 147167 markings/sec, 215 secs
lola: 32750991 markings, 156189921 edges, 144998 markings/sec, 220 secs
lola: 33468806 markings, 159510968 edges, 143563 markings/sec, 225 secs
lola: 34205237 markings, 162919233 edges, 147286 markings/sec, 230 secs
lola: 34949646 markings, 166363487 edges, 148882 markings/sec, 235 secs
lola: 35673263 markings, 169776074 edges, 144723 markings/sec, 240 secs
lola: 36395511 markings, 173239498 edges, 144450 markings/sec, 245 secs
lola: 37119096 markings, 176366446 edges, 144717 markings/sec, 250 secs
lola: 37819667 markings, 179508861 edges, 140114 markings/sec, 255 secs
lola: 38534588 markings, 182796778 edges, 142984 markings/sec, 260 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 268 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((E (X ((1 <= in1_0 + in1_1))) OR (out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7 <= in1_0 + in1_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(EX((1 <= in1_0 + in1_1))) AND (in1_0 + in1_1 + 1 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7))))
lola: processed formula length: 143
lola: 4 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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: 670056 markings, 895458 edges, 3225752436249460736 markings/sec, 0 secs
lola: 1278767 markings, 1685871 edges, 121742 markings/sec, 5 secs
lola: 1911113 markings, 2511657 edges, 126469 markings/sec, 10 secs
lola: 2525328 markings, 3327106 edges, 122843 markings/sec, 15 secs
lola: 3113646 markings, 4189019 edges, 117664 markings/sec, 20 secs
lola: 3690628 markings, 5141747 edges, 115396 markings/sec, 25 secs
lola: 4262222 markings, 6065693 edges, 114319 markings/sec, 30 secs
lola: 4824107 markings, 6963711 edges, 112377 markings/sec, 35 secs
lola: 5430262 markings, 7788189 edges, 121231 markings/sec, 40 secs
lola: 6013036 markings, 8534882 edges, 116555 markings/sec, 45 secs
lola: 6589875 markings, 9290922 edges, 115368 markings/sec, 50 secs
lola: 7157667 markings, 10169916 edges, 113558 markings/sec, 55 secs
lola: 7715646 markings, 11008042 edges, 111596 markings/sec, 60 secs
lola: 8465884 markings, 12041189 edges, 150048 markings/sec, 65 secs
lola: 9029166 markings, 12823836 edges, 112656 markings/sec, 70 secs
lola: 9743346 markings, 13827058 edges, 142836 markings/sec, 75 secs
lola: 10314533 markings, 14623192 edges, 114237 markings/sec, 80 secs
lola: 10937562 markings, 15512950 edges, 124606 markings/sec, 85 secs
lola: 11482132 markings, 16195267 edges, 108914 markings/sec, 90 secs
lola: 12031671 markings, 16914779 edges, 109908 markings/sec, 95 secs
lola: 12558760 markings, 17690895 edges, 105418 markings/sec, 100 secs
lola: 13121103 markings, 18441688 edges, 112469 markings/sec, 105 secs
lola: 13809324 markings, 19411923 edges, 137644 markings/sec, 110 secs
lola: 14421719 markings, 20189758 edges, 122479 markings/sec, 115 secs
lola: 15010870 markings, 20921464 edges, 117830 markings/sec, 120 secs
lola: 15547866 markings, 21585425 edges, 107399 markings/sec, 125 secs
lola: 16124523 markings, 22330680 edges, 115331 markings/sec, 130 secs
lola: 16653199 markings, 22993602 edges, 105735 markings/sec, 135 secs
lola: 17192677 markings, 23674433 edges, 107896 markings/sec, 140 secs
lola: 17748744 markings, 24456091 edges, 111213 markings/sec, 145 secs
lola: 18265161 markings, 25273477 edges, 103283 markings/sec, 150 secs
lola: 18763217 markings, 26066429 edges, 99611 markings/sec, 155 secs
lola: 19295349 markings, 26869401 edges, 106426 markings/sec, 160 secs
lola: 19817061 markings, 27660200 edges, 104342 markings/sec, 165 secs
lola: 20506777 markings, 28653481 edges, 137943 markings/sec, 170 secs
lola: 21047136 markings, 29349726 edges, 108072 markings/sec, 175 secs
lola: 21659874 markings, 30210066 edges, 122548 markings/sec, 180 secs
lola: 22198959 markings, 30938818 edges, 107817 markings/sec, 185 secs
lola: 22725796 markings, 31650239 edges, 105367 markings/sec, 190 secs
lola: 23191348 markings, 32220497 edges, 93110 markings/sec, 195 secs
lola: 23656996 markings, 32833279 edges, 93130 markings/sec, 200 secs
lola: 24175428 markings, 33585861 edges, 103686 markings/sec, 205 secs
lola: 24892199 markings, 34573739 edges, 143354 markings/sec, 210 secs
lola: 25529073 markings, 35433605 edges, 127375 markings/sec, 215 secs
lola: 26125008 markings, 36291611 edges, 119187 markings/sec, 220 secs
lola: 26681561 markings, 37221967 edges, 111311 markings/sec, 225 secs
lola: 27248547 markings, 38064220 edges, 113397 markings/sec, 230 secs
lola: 27817003 markings, 38863025 edges, 113691 markings/sec, 235 secs
lola: 28415011 markings, 39764310 edges, 119602 markings/sec, 240 secs
lola: 28985726 markings, 40508823 edges, 114143 markings/sec, 245 secs
lola: 29552658 markings, 41232492 edges, 113386 markings/sec, 250 secs
lola: 30111820 markings, 41979055 edges, 111832 markings/sec, 255 secs
lola: 30652035 markings, 42788084 edges, 108043 markings/sec, 260 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 268 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G ((aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7 <= 0))) OR A (X ((((c13 <= c14) AND (3 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7)) OR (2 <= aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 268 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7 <= 0)))
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: state equation: write sara problem file to PermAdmissibility-COL-02-CTLCardinality-5.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((((c13 <= c14) AND (3 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7)) OR (2 <= aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((((c13 <= c14) AND (3 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7)) OR (2 <= aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7)))
lola: processed formula length: 190
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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: 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: ========================================
lola: subprocess 6 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (((c19 <= c13) U (2 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A((c19 <= c13) U (2 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7)))
lola: processed formula length: 106
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 7 will run for 328 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((c6 + 1 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7) OR (3 <= c11) OR (c5 <= 1)) OR E (((aux7_2 + aux7_3 + aux7_6 + aux7_7 <= 0) U (out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7 + 1 <= c17))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 328 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((c6 + 1 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7) OR (3 <= c11) OR (c5 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((c6 + 1 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7) OR (3 <= c11) OR (c5 <= 1))
lola: processed formula length: 120
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
lola: processed formula with 3 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 8 will run for 369 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((aux7_2 + aux7_3 + aux7_6 + aux7_7 <= 0) U (out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7 + 1 <= c17)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((aux7_2 + aux7_3 + aux7_6 + aux7_7 <= 0) U (out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7 + 1 <= c17))
lola: processed formula length: 128
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 369 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (X ((c19 <= c5))) OR ((out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7 + 1 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7) OR (out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7 + 1 <= c5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (NOT(EX((c19 <= c5))) AND ((aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7) AND (c5 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7)))))
lola: processed formula length: 278
lola: 4 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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 9 will run for 422 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT(A (F ((1 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U A(TRUE U (1 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7))))
lola: processed formula length: 101
lola: 7 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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: 1721612 markings, 2486393 edges, 2947805517474430976 markings/sec, 0 secs
lola: 3294404 markings, 4760908 edges, 314558 markings/sec, 5 secs
lola: 4906435 markings, 7014157 edges, 322406 markings/sec, 10 secs
lola: 6324464 markings, 9110146 edges, 283606 markings/sec, 15 secs
lola: 7818291 markings, 11290248 edges, 298765 markings/sec, 20 secs
lola: 9263522 markings, 13426081 edges, 289046 markings/sec, 25 secs
lola: 10683856 markings, 15504902 edges, 284067 markings/sec, 30 secs
lola: 11895227 markings, 17750173 edges, 242274 markings/sec, 35 secs
lola: 13023308 markings, 20042732 edges, 225616 markings/sec, 40 secs
lola: 14170544 markings, 22356175 edges, 229447 markings/sec, 45 secs
lola: 15252520 markings, 24532844 edges, 216395 markings/sec, 50 secs
lola: 16377404 markings, 26738151 edges, 224977 markings/sec, 55 secs
lola: 17760971 markings, 28955285 edges, 276713 markings/sec, 60 secs
lola: 19237060 markings, 30980170 edges, 295218 markings/sec, 65 secs
lola: 20590203 markings, 32942541 edges, 270629 markings/sec, 70 secs
lola: 21987815 markings, 34921079 edges, 279522 markings/sec, 75 secs
lola: 23349148 markings, 36863158 edges, 272267 markings/sec, 80 secs
lola: 24512940 markings, 38816392 edges, 232758 markings/sec, 85 secs
lola: 25602343 markings, 40829376 edges, 217881 markings/sec, 90 secs
lola: 26734881 markings, 42880429 edges, 226508 markings/sec, 95 secs
lola: 27837521 markings, 44884021 edges, 220528 markings/sec, 100 secs
lola: 29203255 markings, 47026060 edges, 273147 markings/sec, 105 secs
lola: 30537250 markings, 48957527 edges, 266799 markings/sec, 110 secs
lola: 31765334 markings, 51052664 edges, 245617 markings/sec, 115 secs
lola: 33009008 markings, 53152606 edges, 248735 markings/sec, 120 secs
lola: 34356360 markings, 55101529 edges, 269470 markings/sec, 125 secs
lola: 35538283 markings, 57068884 edges, 236385 markings/sec, 130 secs
lola: 36702209 markings, 59004601 edges, 232785 markings/sec, 135 secs
lola: 38006561 markings, 61019980 edges, 260870 markings/sec, 140 secs
lola: 39356677 markings, 62864723 edges, 270023 markings/sec, 145 secs
lola: 40699812 markings, 64688796 edges, 268627 markings/sec, 150 secs
lola: 41987046 markings, 66505575 edges, 257447 markings/sec, 155 secs
lola: 43158098 markings, 68411285 edges, 234210 markings/sec, 160 secs
lola: 44309485 markings, 70310864 edges, 230277 markings/sec, 165 secs
lola: 45489384 markings, 72233238 edges, 235980 markings/sec, 170 secs
lola: 46748639 markings, 74016238 edges, 251851 markings/sec, 175 secs
lola: 47837939 markings, 75901925 edges, 217860 markings/sec, 180 secs
lola: 49080252 markings, 77969540 edges, 248463 markings/sec, 185 secs
lola: 50467356 markings, 79830264 edges, 277421 markings/sec, 190 secs
lola: 51815967 markings, 81710495 edges, 269722 markings/sec, 195 secs
lola: 53141510 markings, 83562365 edges, 265109 markings/sec, 200 secs
lola: 54458202 markings, 85363615 edges, 263338 markings/sec, 205 secs
lola: 55847625 markings, 87169829 edges, 277885 markings/sec, 210 secs
lola: 57067759 markings, 88995445 edges, 244027 markings/sec, 215 secs
lola: 58292076 markings, 90769532 edges, 244863 markings/sec, 220 secs
lola: 59670904 markings, 92568434 edges, 275766 markings/sec, 225 secs
lola: 60949322 markings, 94420093 edges, 255684 markings/sec, 230 secs
lola: 62186401 markings, 96206267 edges, 247416 markings/sec, 235 secs
lola: 63499563 markings, 97948896 edges, 262632 markings/sec, 240 secs
lola: 64650828 markings, 99732902 edges, 230253 markings/sec, 245 secs
lola: 65745710 markings, 101532458 edges, 218976 markings/sec, 250 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 449 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (A (F ((2 <= c19))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U A(TRUE U (2 <= c19))))
lola: processed formula length: 35
lola: 9 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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: subprocess 11 will run for 539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (F ((aux5_0 + aux5_1 + aux5_4 + aux5_5 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7))) U A (G ((3 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
lola: processed formula: A(E(TRUE U (aux5_0 + aux5_1 + aux5_4 + aux5_5 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7)) U NOT(E(TRUE U (out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7 <= 2))))
lola: processed formula length: 223
lola: 4 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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 3 significant temporal operators and needs 13 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 12 will run for 673 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (X (A (G ((aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= c15))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (c15 + 1 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7)))
lola: processed formula length: 104
lola: 7 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 13 will run for 898 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 + 1 <= out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7) OR (aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= c8)) U ((in2_2 + in2_3 + 1 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7) AND (aux10_0 + aux10_1 + aux10_2 + aux10_3 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 + 1 <= out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7) OR (aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= c8)) U ((in2_2 + in2_3 + 1 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7) AND (aux10_0 + aux10_1 + aux10_2 + aux10_3 + ... (shortened)
lola: processed formula length: 517
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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: 2032444 markings, 2399153 edges, 1953358685363240960 markings/sec, 0 secs
lola: 3976966 markings, 4750824 edges, 388904 markings/sec, 5 secs
lola: 5862222 markings, 7017681 edges, 377051 markings/sec, 10 secs
lola: 7654233 markings, 9240512 edges, 358402 markings/sec, 15 secs
lola: 9420579 markings, 11448055 edges, 353269 markings/sec, 20 secs
lola: 11220397 markings, 13626305 edges, 359964 markings/sec, 25 secs
lola: 13027352 markings, 15848053 edges, 361391 markings/sec, 30 secs
lola: 14737381 markings, 18046806 edges, 342006 markings/sec, 35 secs
lola: 16479646 markings, 20186793 edges, 348453 markings/sec, 40 secs
lola: 18078130 markings, 22456779 edges, 319697 markings/sec, 45 secs
lola: 19725004 markings, 24651462 edges, 329375 markings/sec, 50 secs
lola: 21335222 markings, 26839524 edges, 322044 markings/sec, 55 secs
lola: 22912798 markings, 29052211 edges, 315515 markings/sec, 60 secs
lola: 24389378 markings, 31044127 edges, 295316 markings/sec, 65 secs
lola: 25861880 markings, 33047815 edges, 294500 markings/sec, 70 secs
lola: 27302481 markings, 35160263 edges, 288120 markings/sec, 75 secs
lola: 28833839 markings, 37267289 edges, 306272 markings/sec, 80 secs
lola: 30399526 markings, 39404959 edges, 313137 markings/sec, 85 secs
lola: 31954047 markings, 41561883 edges, 310904 markings/sec, 90 secs
lola: 33416940 markings, 43749956 edges, 292579 markings/sec, 95 secs
lola: 35041955 markings, 45929131 edges, 325003 markings/sec, 100 secs
lola: 36603306 markings, 48103564 edges, 312270 markings/sec, 105 secs
lola: 38061879 markings, 50240051 edges, 291715 markings/sec, 110 secs
lola: 39456932 markings, 52325105 edges, 279011 markings/sec, 115 secs
lola: 41136517 markings, 54629936 edges, 335917 markings/sec, 120 secs
lola: 42696582 markings, 56762471 edges, 312013 markings/sec, 125 secs
lola: 44158616 markings, 58883945 edges, 292407 markings/sec, 130 secs
lola: 45554073 markings, 61041051 edges, 279091 markings/sec, 135 secs
lola: 46881613 markings, 63127538 edges, 265508 markings/sec, 140 secs
lola: 48214833 markings, 65252658 edges, 266644 markings/sec, 145 secs
lola: 49740093 markings, 67527284 edges, 305052 markings/sec, 150 secs
lola: 51359507 markings, 69753893 edges, 323883 markings/sec, 155 secs
lola: 52912902 markings, 71943860 edges, 310679 markings/sec, 160 secs
lola: 54261954 markings, 74047767 edges, 269810 markings/sec, 165 secs
lola: 55628051 markings, 76203629 edges, 273219 markings/sec, 170 secs
lola: 56991613 markings, 78401447 edges, 272712 markings/sec, 175 secs
lola: 58344889 markings, 80577436 edges, 270655 markings/sec, 180 secs
lola: 59597984 markings, 82637317 edges, 250619 markings/sec, 185 secs
lola: 61077195 markings, 84868773 edges, 295842 markings/sec, 190 secs
lola: 62643885 markings, 87029544 edges, 313338 markings/sec, 195 secs
lola: 64174044 markings, 89145609 edges, 306032 markings/sec, 200 secs
lola: 65481630 markings, 91216737 edges, 261517 markings/sec, 205 secs
lola: 66820484 markings, 93326083 edges, 267771 markings/sec, 210 secs
lola: 68159246 markings, 95485209 edges, 267752 markings/sec, 215 secs
lola: 69466475 markings, 97601372 edges, 261446 markings/sec, 220 secs
lola: 70809574 markings, 99781661 edges, 268620 markings/sec, 225 secs
lola: 72145143 markings, 101817716 edges, 267114 markings/sec, 230 secs
lola: 73622502 markings, 103824895 edges, 295472 markings/sec, 235 secs
lola: 74696796 markings, 105355641 edges, 214859 markings/sec, 240 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1223 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (NOT(E (G ((aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_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: AX(A(TRUE U (aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7 + 1 <= aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7)))
lola: processed formula length: 170
lola: 5 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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: 2147776 markings, 2954411 edges, 1953358685363240960 markings/sec, 0 secs
lola: 4184762 markings, 5755837 edges, 407397 markings/sec, 5 secs
lola: 6171003 markings, 8489610 edges, 397248 markings/sec, 10 secs
lola: 8151926 markings, 11222117 edges, 396185 markings/sec, 15 secs
lola: 10075480 markings, 13874055 edges, 384711 markings/sec, 20 secs
lola: 11948600 markings, 16491333 edges, 374624 markings/sec, 25 secs
lola: 13809789 markings, 19107256 edges, 372238 markings/sec, 30 secs
lola: 15634133 markings, 21662210 edges, 364869 markings/sec, 35 secs
lola: 17443299 markings, 24186745 edges, 361833 markings/sec, 40 secs
lola: 19276955 markings, 26726521 edges, 366731 markings/sec, 45 secs
lola: 21103160 markings, 29279981 edges, 365241 markings/sec, 50 secs
lola: 22852849 markings, 31719396 edges, 349938 markings/sec, 55 secs
lola: 24615349 markings, 34183503 edges, 352500 markings/sec, 60 secs
lola: 26399548 markings, 36680642 edges, 356840 markings/sec, 65 secs
lola: 28134816 markings, 39149251 edges, 347054 markings/sec, 70 secs
lola: 29841062 markings, 41587756 edges, 341249 markings/sec, 75 secs
lola: 31537238 markings, 43997704 edges, 339235 markings/sec, 80 secs
lola: 33360079 markings, 46542429 edges, 364568 markings/sec, 85 secs
lola: 35174748 markings, 49068448 edges, 362934 markings/sec, 90 secs
lola: 36988131 markings, 51585578 edges, 362677 markings/sec, 95 secs
lola: 38789034 markings, 54105698 edges, 360181 markings/sec, 100 secs
lola: 40563456 markings, 56583912 edges, 354884 markings/sec, 105 secs
lola: 42378392 markings, 59106345 edges, 362987 markings/sec, 110 secs
lola: 44143420 markings, 61573438 edges, 353006 markings/sec, 115 secs
lola: 46083877 markings, 64255973 edges, 388091 markings/sec, 120 secs
lola: 48041530 markings, 66950129 edges, 391531 markings/sec, 125 secs
lola: 49944843 markings, 69562173 edges, 380663 markings/sec, 130 secs
lola: 51842863 markings, 72195563 edges, 379604 markings/sec, 135 secs
lola: 53700501 markings, 74771968 edges, 371528 markings/sec, 140 secs
lola: 55528559 markings, 77299503 edges, 365612 markings/sec, 145 secs
lola: 57321675 markings, 79831099 edges, 358623 markings/sec, 150 secs
lola: 59102769 markings, 82330011 edges, 356219 markings/sec, 155 secs
lola: 60863240 markings, 84789451 edges, 352094 markings/sec, 160 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 2278 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (X ((out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(AX((out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_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-02-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: 902886 markings, 2341537 edges, 3225752436249460736 markings/sec, 0 secs
lola: 1751618 markings, 4850619 edges, 169746 markings/sec, 5 secs
lola: 2631341 markings, 7176628 edges, 175945 markings/sec, 10 secs
lola: 3498605 markings, 9389035 edges, 173453 markings/sec, 15 secs
lola: 4358159 markings, 11567432 edges, 171911 markings/sec, 20 secs
lola: 5194354 markings, 13765274 edges, 167239 markings/sec, 25 secs
lola: 6040171 markings, 15866661 edges, 169163 markings/sec, 30 secs
lola: 6875358 markings, 18066588 edges, 167037 markings/sec, 35 secs
lola: 7697504 markings, 20257150 edges, 164429 markings/sec, 40 secs
lola: 8465562 markings, 22681711 edges, 153612 markings/sec, 45 secs
lola: 9221123 markings, 25051601 edges, 151112 markings/sec, 50 secs
lola: 10005749 markings, 27340524 edges, 156925 markings/sec, 55 secs
lola: 10730404 markings, 29744636 edges, 144931 markings/sec, 60 secs
lola: 11479512 markings, 32044855 edges, 149822 markings/sec, 65 secs
lola: 12309518 markings, 34141967 edges, 166001 markings/sec, 70 secs
lola: 13125956 markings, 36190180 edges, 163288 markings/sec, 75 secs
lola: 13939653 markings, 38263838 edges, 162739 markings/sec, 80 secs
lola: 14737298 markings, 40287804 edges, 159529 markings/sec, 85 secs
lola: 15566123 markings, 42309234 edges, 165765 markings/sec, 90 secs
lola: 16376053 markings, 44292044 edges, 161986 markings/sec, 95 secs
lola: 17180525 markings, 46189684 edges, 160894 markings/sec, 100 secs
lola: 17992870 markings, 48431412 edges, 162469 markings/sec, 105 secs
lola: 18798463 markings, 50633540 edges, 161119 markings/sec, 110 secs
lola: 19600907 markings, 52625962 edges, 160489 markings/sec, 115 secs
lola: 20388696 markings, 54766006 edges, 157558 markings/sec, 120 secs
lola: 21142916 markings, 56992330 edges, 150844 markings/sec, 125 secs
lola: 21891587 markings, 59253351 edges, 149734 markings/sec, 130 secs
lola: 22614009 markings, 61405545 edges, 144484 markings/sec, 135 secs
lola: 23336541 markings, 63613101 edges, 144506 markings/sec, 140 secs
lola: 24062308 markings, 65786451 edges, 145153 markings/sec, 145 secs
lola: 24760708 markings, 67898642 edges, 139680 markings/sec, 150 secs
lola: 25488832 markings, 70088755 edges, 145625 markings/sec, 155 secs
lola: 26225350 markings, 72260706 edges, 147304 markings/sec, 160 secs
lola: 26960139 markings, 74430423 edges, 146958 markings/sec, 165 secs
lola: 27688321 markings, 76601131 edges, 145636 markings/sec, 170 secs
lola: 28401495 markings, 78747800 edges, 142635 markings/sec, 175 secs
lola: 29083510 markings, 80859271 edges, 136403 markings/sec, 180 secs
lola: 29792732 markings, 82966271 edges, 141844 markings/sec, 185 secs
lola: 30495517 markings, 85049767 edges, 140557 markings/sec, 190 secs
lola: 31294940 markings, 87249014 edges, 159885 markings/sec, 195 secs
lola: 32087200 markings, 89384729 edges, 158452 markings/sec, 200 secs
lola: 32859045 markings, 91536317 edges, 154369 markings/sec, 205 secs
lola: 33649623 markings, 93618419 edges, 158116 markings/sec, 210 secs
lola: 34460335 markings, 95665546 edges, 162142 markings/sec, 215 secs
lola: 35238210 markings, 97853524 edges, 155575 markings/sec, 220 secs
lola: 35992680 markings, 99964153 edges, 150894 markings/sec, 225 secs
lola: 36761770 markings, 101908054 edges, 153818 markings/sec, 230 secs
lola: 37511879 markings, 103769539 edges, 150022 markings/sec, 235 secs
lola: 38303665 markings, 105778283 edges, 158357 markings/sec, 240 secs
lola: 39043181 markings, 107801702 edges, 147903 markings/sec, 245 secs
lola: 39780518 markings, 109752592 edges, 147467 markings/sec, 250 secs
lola: 40534510 markings, 111720077 edges, 150798 markings/sec, 255 secs
lola: 41306511 markings, 113653084 edges, 154400 markings/sec, 260 secs
lola: 42058285 markings, 115527340 edges, 150355 markings/sec, 265 secs
lola: 42825090 markings, 117341231 edges, 153361 markings/sec, 270 secs
lola: 43584800 markings, 119435127 edges, 151942 markings/sec, 275 secs
lola: 44359479 markings, 121592318 edges, 154936 markings/sec, 280 secs
lola: 45099438 markings, 123677050 edges, 147992 markings/sec, 285 secs
lola: 45879307 markings, 125804644 edges, 155974 markings/sec, 290 secs
lola: 46632516 markings, 127883157 edges, 150642 markings/sec, 295 secs
lola: 47438944 markings, 129907831 edges, 161286 markings/sec, 300 secs
lola: 48200422 markings, 131929197 edges, 152296 markings/sec, 305 secs
lola: 48976666 markings, 134057824 edges, 155249 markings/sec, 310 secs
lola: 49719416 markings, 136140988 edges, 148550 markings/sec, 315 secs
lola: 50455100 markings, 138226964 edges, 147137 markings/sec, 320 secs
lola: 51223237 markings, 140170863 edges, 153627 markings/sec, 325 secs
lola: 51954520 markings, 142143557 edges, 146257 markings/sec, 330 secs
lola: 52697853 markings, 144086349 edges, 148667 markings/sec, 335 secs
lola: 53418224 markings, 146124453 edges, 144074 markings/sec, 340 secs
lola: 54127141 markings, 148120913 edges, 141783 markings/sec, 345 secs
lola: 54833893 markings, 150093744 edges, 141350 markings/sec, 350 secs
lola: 55591320 markings, 151996609 edges, 151485 markings/sec, 355 secs
lola: 56309147 markings, 154032405 edges, 143565 markings/sec, 360 secs
lola: 57035409 markings, 155987215 edges, 145252 markings/sec, 365 secs
lola: 57785426 markings, 157955481 edges, 150003 markings/sec, 370 secs
lola: 58530180 markings, 159823432 edges, 148951 markings/sec, 375 secs
lola: 59268075 markings, 161851653 edges, 147579 markings/sec, 380 secs
lola: 60017999 markings, 163744470 edges, 149985 markings/sec, 385 secs
lola: 60733672 markings, 165679362 edges, 143135 markings/sec, 390 secs
lola: 61445307 markings, 167503478 edges, 142327 markings/sec, 395 secs
lola: 62156223 markings, 169422072 edges, 142183 markings/sec, 400 secs
lola: 62874113 markings, 171248046 edges, 143578 markings/sec, 405 secs
lola: 63542034 markings, 173080136 edges, 133584 markings/sec, 410 secs
lola: 64329610 markings, 175020389 edges, 157515 markings/sec, 415 secs
lola: 65158502 markings, 177232120 edges, 165778 markings/sec, 420 secs
lola: 65905895 markings, 179603759 edges, 149479 markings/sec, 425 secs
lola: 66637100 markings, 181947182 edges, 146241 markings/sec, 430 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes yes no unknown unknown no yes no no unknown no no yes unknown unknown unknown
FORMULA PermAdmissibility-COL-02-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494658490259

--------------------
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="PermAdmissibility-PT-02"
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/PermAdmissibility-PT-02.tgz
mv PermAdmissibility-PT-02 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 PermAdmissibility-PT-02, 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 r038-blw7-149440485000408"
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 ;