fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r008-csrt-149436125900129
Last Updated
June 27, 2017

About the Execution of LoLA for Angiogenesis-PT-20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15939.000 667681.00 663848.00 939.50 FTTFTT?TTFFTFT?T 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 Angiogenesis-PT-20, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r008-csrt-149436125900129
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1494598334518


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ Angiogenesis-PT-20 @ 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: 103/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 39 places, 64 transitions, 31 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 54 transition conflict sets
lola: TASK
lola: reading formula from Angiogenesis-PT-20-CTLCardinality.task
lola: (E (F (())) AND A (G (((KdStarGStarP3 <= KdStarGStarPgP3) OR ((2 <= KdStarPgStarP2) AND (1 <= GStarP3)))))) : A (G (TRUE)) : E (((1 <= Gab1) U ((P3k <= 2) OR (Pten <= 2)))) : NOT(E (F ((1 <= GStarP3)))) : A (G ((E (F ((KdStarGStarP3k <= Pten))) AND ((KdStarGStarP3kStarP3P2 <= KdStarPgStarP2) OR (2 <= PtP3) OR (KdStarGStarP3kStarP3 <= 0))))) : E (((KdStarG <= 1) U ((KdStarGStar <= Pip3) AND (Pip2 + 1 <= KdStarGStarPgStarP3P2)))) : (A (G (((1 <= KdStarGStarPgP3) AND (KdStarGStarP3kStar <= KdStarGStarPgStarP3) AND (KdStarGStarP3kStarP2 <= Pg)))) OR E (X (A (G ((AktStar <= Pip3)))))) : E (F ((2 <= KdStarGStarP3kP3))) : E ((((PtP2 + 1 <= KdStar) AND (KdStarGStarPgP3 <= KdStarGStarP3kStarP3P2)) U (((3 <= KdStarGStarPgStarP3) AND (1 <= KdStarGStarPg)) OR ((3 <= KdStarGStarP3kStarP3))))) : NOT(NOT(((2 <= KdStarG) OR A (G ((PtP3P2 <= Pten)))))) : ((E (((2 <= Enz) U (3 <= GP3))) OR A (((KdStarGStar <= KdStarGStarPgStarP3) U (KdStar <= KdStarGStarPgStarP2)))) OR (((((1 <= P3k) OR (Pip2 <= Pip3)) AND (Pg <= 2)) OR (KdStarGStar <= 2)) AND E (((KdStarPgStarP2 <= KdStarGStarPgStar) U (3 <= PtP3P2))))) : NOT((A (X (((KdStarGStarPgStarP2 <= KdStarGStarP3kStarP2) AND (KdStarGP3 <= KdStar)))) AND (E (F ((3 <= KdStarGStarP3k))) AND ((Gab1 + 1 <= P3k) OR (GStarPgP3 <= 0))))) : E (F (((KdStarGStarP3kStarP2 <= KdStarPgStar) AND E (F ((2 <= KdStarGStarP3kStarP2)))))) : A ((A (F ((2 <= GStarP3kP3))) U E (F ((Enz <= GStarPgP3))))) : (A (F ((KdStarGStarPgStar + 1 <= KdStarGStarPgStarP2))) OR E ((((KdStarPgStar <= Akt) OR (GP3 <= KdStarGStarP3k)) U ((3 <= Akt) AND (2 <= KdStarGStarPgP3))))) : (E (F (TRUE)) AND E (F (((3 <= DAG) AND (2 <= Enz) AND ((Enz <= PtP2) OR (3 <= KdStarGStarPgStar))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (())) AND A (G (((KdStarGStarP3 <= KdStarGStarPgP3) OR ((2 <= KdStarPgStarP2) AND (1 <= GStarP3))))))
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 124 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 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Angiogenesis-PT-20-CTLCardinality.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 39 places; total mentions: 0
lola: closed formula file Angiogenesis-PT-20-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((1 <= Gab1) U ((P3k <= 2) OR (Pten <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((1 <= Gab1) U ((P3k <= 2) OR (Pten <= 2)))
lola: processed formula length: 45
lola: 1 rewrites
lola: formula mentions 0 of 39 places; total mentions: 0
lola: closed formula file Angiogenesis-PT-20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 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: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F ((1 <= GStarP3))))
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 124 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 Angiogenesis-PT-20-CTLCardinality-3.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (F ((KdStarGStarP3k <= Pten))) AND ((KdStarGStarP3kStarP3P2 <= KdStarPgStarP2) OR (2 <= PtP3) OR (KdStarGStarP3kStarP3 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((KdStarGStarP3k <= Pten)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
sara: try reading problem file Angiogenesis-PT-20-CTLCardinality.sara.
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (KdStarGStarP3k <= Pten)))))
lola: processed formula length: 54
lola: 3 rewrites
lola: formula mentions 0 of 39 places; total mentions: 0
lola: closed formula file Angiogenesis-PT-20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 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: 2790632 markings, 8305558 edges, 2040949629922574336 markings/sec, 0 secs
lola: 5296937 markings, 16066743 edges, 501261 markings/sec, 5 secs
lola: 7441500 markings, 22535156 edges, 428913 markings/sec, 10 secs
lola: 9517083 markings, 28830018 edges, 415117 markings/sec, 15 secs
lola: 11526740 markings, 34888376 edges, 401931 markings/sec, 20 secs
lola: 13697706 markings, 41492929 edges, 434193 markings/sec, 25 secs
lola: 15769898 markings, 47777102 edges, 414438 markings/sec, 30 secs
lola: 17859964 markings, 54088672 edges, 418013 markings/sec, 35 secs
lola: 19977567 markings, 60385356 edges, 423521 markings/sec, 40 secs
lola: 22044504 markings, 66719696 edges, 413387 markings/sec, 45 secs
lola: 24089339 markings, 72893421 edges, 408967 markings/sec, 50 secs
lola: 26127698 markings, 79033085 edges, 407672 markings/sec, 55 secs
lola: 28144576 markings, 85230690 edges, 403376 markings/sec, 60 secs
lola: 30193457 markings, 91393947 edges, 409776 markings/sec, 65 secs
lola: 32321121 markings, 97821661 edges, 425533 markings/sec, 70 secs
lola: 34401930 markings, 104094149 edges, 416162 markings/sec, 75 secs
lola: 36417749 markings, 110245125 edges, 403164 markings/sec, 80 secs
lola: 38445629 markings, 116359743 edges, 405576 markings/sec, 85 secs
lola: 40360196 markings, 122161051 edges, 382913 markings/sec, 90 secs
lola: 42375185 markings, 128267706 edges, 402998 markings/sec, 95 secs
lola: 44397884 markings, 134451899 edges, 404540 markings/sec, 100 secs
lola: 46414606 markings, 140593700 edges, 403344 markings/sec, 105 secs
lola: 48342949 markings, 146611124 edges, 385669 markings/sec, 110 secs
lola: 50334387 markings, 152650347 edges, 398288 markings/sec, 115 secs
lola: 52247711 markings, 158513379 edges, 382665 markings/sec, 120 secs
lola: 54098272 markings, 164234590 edges, 370112 markings/sec, 125 secs
lola: 56010574 markings, 169935428 edges, 382460 markings/sec, 130 secs
lola: 57827104 markings, 175487642 edges, 363306 markings/sec, 135 secs
lola: 59646697 markings, 181155970 edges, 363919 markings/sec, 140 secs
lola: 61453137 markings, 186801189 edges, 361288 markings/sec, 145 secs
lola: 63294361 markings, 192515942 edges, 368245 markings/sec, 150 secs
lola: 65130934 markings, 198172312 edges, 367315 markings/sec, 155 secs
lola: 66986651 markings, 203659108 edges, 371143 markings/sec, 160 secs
lola: 68995622 markings, 209639348 edges, 401794 markings/sec, 165 secs
lola: 70937614 markings, 215621696 edges, 388398 markings/sec, 170 secs
lola: 72833139 markings, 221412944 edges, 379105 markings/sec, 175 secs
lola: 74706442 markings, 227224082 edges, 374661 markings/sec, 180 secs
lola: 76646836 markings, 233304190 edges, 388079 markings/sec, 185 secs
lola: 77496636 markings, 235974908 edges, 169960 markings/sec, 190 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 303 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((KdStarGStarP3kStarP3P2 <= KdStarPgStarP2) OR (2 <= PtP3) OR (KdStarGStarP3kStarP3 <= 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 124 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 5 will run for 303 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((KdStarG <= 1) U ((KdStarGStar <= Pip3) AND (Pip2 + 1 <= KdStarGStarPgStarP3P2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((KdStarG <= 1) U ((KdStarGStar <= Pip3) AND (Pip2 + 1 <= KdStarGStarPgStarP3P2)))
lola: processed formula length: 83
lola: 1 rewrites
lola: formula mentions 0 of 39 places; total mentions: 0
lola: closed formula file Angiogenesis-PT-20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 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: 3634359 markings, 7202079 edges, 3689348869717491712 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 6 will run for 333 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((1 <= KdStarGStarPgP3) AND (KdStarGStarP3kStar <= KdStarGStarPgStarP3) AND (KdStarGStarP3kStarP2 <= Pg)))) OR E (X (A (G ((AktStar <= Pip3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 333 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= KdStarGStarPgP3) AND (KdStarGStarP3kStar <= KdStarGStarPgStarP3) AND (KdStarGStarP3kStarP2 <= Pg))))
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 124 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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: ========================================
lola: subprocess 7 will run for 370 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((AktStar <= Pip3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(E(TRUE U (Pip3 + 1 <= AktStar))))
lola: processed formula length: 40
lola: 3 rewrites
lola: formula mentions 0 of 39 places; total mentions: 0
lola: closed formula file Angiogenesis-PT-20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 7 will run for 369 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= KdStarGStarP3kP3)))
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 124 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 Angiogenesis-PT-20-CTLCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file Angiogenesis-PT-20-CTLCardinality-7.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 416 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((PtP2 + 1 <= KdStar) AND (KdStarGStarPgP3 <= KdStarGStarP3kStarP3P2)) U (((3 <= KdStarGStarPgStarP3) AND (1 <= KdStarGStarPg)) OR ((3 <= KdStarGStarP3kStarP3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((PtP2 + 1 <= KdStar) AND (KdStarGStarPgP3 <= KdStarGStarP3kStarP3P2)) U (((3 <= KdStarGStarPgStarP3) AND (1 <= KdStarGStarPg)) OR ((3 <= KdStarGStarP3kStarP3))))
lola: processed formula length: 165
lola: 1 rewrites
lola: formula mentions 0 of 39 places; total mentions: 0
lola: closed formula file Angiogenesis-PT-20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 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: 3452519 markings, 7255063 edges, 2529988350140481536 markings/sec, 0 secs
lola: 6852097 markings, 14406794 edges, 679916 markings/sec, 5 secs
lola: 10437846 markings, 21306955 edges, 717150 markings/sec, 10 secs
lola: 13703748 markings, 27011488 edges, 653180 markings/sec, 15 secs
lola: 16655648 markings, 32265901 edges, 590380 markings/sec, 20 secs
lola: 19558422 markings, 37480792 edges, 580555 markings/sec, 25 secs
lola: 22440122 markings, 42453137 edges, 576340 markings/sec, 30 secs
lola: 25233960 markings, 47545905 edges, 558768 markings/sec, 35 secs
lola: 28175451 markings, 52850500 edges, 588298 markings/sec, 40 secs
lola: 31007458 markings, 57979697 edges, 566401 markings/sec, 45 secs
lola: 33693551 markings, 62867540 edges, 537219 markings/sec, 50 secs
lola: 36316499 markings, 67665577 edges, 524590 markings/sec, 55 secs
lola: 38799799 markings, 72223250 edges, 496660 markings/sec, 60 secs
lola: 41431983 markings, 77045294 edges, 526437 markings/sec, 65 secs
lola: 43911661 markings, 81537064 edges, 495936 markings/sec, 70 secs
lola: 46353307 markings, 85926291 edges, 488329 markings/sec, 75 secs
lola: 48876636 markings, 90457144 edges, 504666 markings/sec, 80 secs
lola: 51513656 markings, 95283644 edges, 527404 markings/sec, 85 secs
lola: 54092969 markings, 99957796 edges, 515863 markings/sec, 90 secs
lola: 56598183 markings, 104558724 edges, 501043 markings/sec, 95 secs
lola: 59013655 markings, 109037327 edges, 483094 markings/sec, 100 secs
lola: 61628981 markings, 113666544 edges, 523065 markings/sec, 105 secs
lola: 64105561 markings, 118208120 edges, 495316 markings/sec, 110 secs
lola: 66425377 markings, 122514352 edges, 463963 markings/sec, 115 secs
lola: 68895862 markings, 127164892 edges, 494097 markings/sec, 120 secs
lola: 71273117 markings, 131522910 edges, 475451 markings/sec, 125 secs
lola: 73585330 markings, 135790058 edges, 462443 markings/sec, 130 secs
lola: 76027658 markings, 140228173 edges, 488466 markings/sec, 135 secs
lola: 78293029 markings, 144345702 edges, 453074 markings/sec, 140 secs
lola: 80632626 markings, 148621547 edges, 467919 markings/sec, 145 secs
lola: 82956696 markings, 152939291 edges, 464814 markings/sec, 150 secs
lola: 85214509 markings, 157081793 edges, 451563 markings/sec, 155 secs
lola: 87467641 markings, 161308078 edges, 450626 markings/sec, 160 secs
lola: 89511384 markings, 165020202 edges, 408749 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 450 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(((2 <= KdStarG) OR A (G ((PtP3P2 <= Pten))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 450 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= KdStarG)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= KdStarG)
lola: processed formula length: 14
lola: 10 rewrites
lola: formula mentions 0 of 39 places; total mentions: 0
lola: closed formula file Angiogenesis-PT-20-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: subprocess 10 will run for 525 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((PtP3P2 <= Pten)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 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 Angiogenesis-PT-20-CTLCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file Angiogenesis-PT-20-CTLCardinality-10.sara.

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 525 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (((2 <= Enz) U (3 <= GP3))) OR A (((KdStarGStar <= KdStarGStarPgStarP3) U (KdStar <= KdStarGStarPgStarP2)))) OR (((((1 <= P3k) OR (Pip2 <= Pip3)) AND (Pg <= 2)) OR (KdStarGStar <= 2)) AND E (((KdStarPgStarP2 <= KdStarGStarPgStar) U (3 <= PtP3P2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 525 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((2 <= Enz) U (3 <= GP3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((2 <= Enz) U (3 <= GP3))
lola: processed formula length: 26
lola: 2 rewrites
lola: formula mentions 0 of 39 places; total mentions: 0
lola: closed formula file Angiogenesis-PT-20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 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: 3582542 markings, 7250065 edges, 2806861595810988032 markings/sec, 0 secs
lola: 6600431 markings, 13637100 edges, 603578 markings/sec, 5 secs
lola: 9475182 markings, 19684659 edges, 574950 markings/sec, 10 secs
lola: 12259490 markings, 25513322 edges, 556862 markings/sec, 15 secs
lola: 14879001 markings, 30990622 edges, 523902 markings/sec, 20 secs
lola: 17596222 markings, 36678606 edges, 543444 markings/sec, 25 secs
lola: 20266539 markings, 42256123 edges, 534063 markings/sec, 30 secs
lola: 22825040 markings, 47646023 edges, 511700 markings/sec, 35 secs
lola: 25291705 markings, 52748051 edges, 493333 markings/sec, 40 secs
lola: 27824825 markings, 58133440 edges, 506624 markings/sec, 45 secs
lola: 30488199 markings, 63581286 edges, 532675 markings/sec, 50 secs
lola: 33155841 markings, 69146689 edges, 533528 markings/sec, 55 secs
lola: 35711541 markings, 74548083 edges, 511140 markings/sec, 60 secs
lola: 38330437 markings, 80079451 edges, 523779 markings/sec, 65 secs
lola: 40907556 markings, 85470014 edges, 515424 markings/sec, 70 secs
lola: 43494211 markings, 90859993 edges, 517331 markings/sec, 75 secs
lola: 46045851 markings, 96237499 edges, 510328 markings/sec, 80 secs
lola: 48513977 markings, 101355138 edges, 493625 markings/sec, 85 secs
lola: 50992186 markings, 106568565 edges, 495642 markings/sec, 90 secs
lola: 53452451 markings, 111742767 edges, 492053 markings/sec, 95 secs
lola: 55970207 markings, 117036120 edges, 503551 markings/sec, 100 secs
lola: 58445591 markings, 122197026 edges, 495077 markings/sec, 105 secs
lola: 60876298 markings, 127273076 edges, 486141 markings/sec, 110 secs
lola: 63354131 markings, 132511784 edges, 495567 markings/sec, 115 secs
lola: 65643584 markings, 137506962 edges, 457891 markings/sec, 120 secs
lola: 67841401 markings, 142022113 edges, 439563 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 604 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((KdStarGStar <= KdStarGStarPgStarP3) U (KdStar <= KdStarGStarPgStarP2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((KdStarGStar <= KdStarGStarPgStarP3) U (KdStar <= KdStarGStarPgStarP2))
lola: processed formula length: 73
lola: 2 rewrites
lola: formula mentions 0 of 39 places; total mentions: 0
lola: closed formula file Angiogenesis-PT-20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 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 755 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((1 <= P3k) OR (Pip2 <= Pip3)) AND (Pg <= 2)) OR (KdStarGStar <= 2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((((1 <= P3k) OR (Pip2 <= Pip3)) AND (Pg <= 2)) OR (KdStarGStar <= 2))
lola: processed formula length: 72
lola: 1 rewrites
lola: formula mentions 0 of 39 places; total mentions: 0
lola: closed formula file Angiogenesis-PT-20-CTLCardinality.task
lola: processed formula with 4 atomic propositions
lola: ========================================
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 13 will run for 1006 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((KdStarPgStarP2 <= KdStarGStarPgStar) U (3 <= PtP3P2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((KdStarPgStarP2 <= KdStarGStarPgStar) U (3 <= PtP3P2))
lola: processed formula length: 56
lola: 2 rewrites
lola: formula mentions 0 of 39 places; total mentions: 0
lola: closed formula file Angiogenesis-PT-20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 11 will run for 604 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (X (((KdStarGStarPgStarP2 <= KdStarGStarP3kStarP2) AND (KdStarGP3 <= KdStar)))) AND (E (F ((3 <= KdStarGStarP3k))) AND ((Gab1 + 1 <= P3k) OR (GStarPgP3 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 604 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((KdStarGStarP3kStarP2 + 1 <= KdStarGStarPgStarP2) OR (KdStar + 1 <= KdStarGP3))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((KdStarGStarP3kStarP2 + 1 <= KdStarGStarPgStarP2) OR (KdStar + 1 <= KdStarGP3)))
lola: processed formula length: 85
lola: 10 rewrites
lola: formula mentions 0 of 39 places; total mentions: 0
lola: closed formula file Angiogenesis-PT-20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 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: subprocess 12 will run for 755 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((KdStarGStarP3k <= 2)))
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 124 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 13 will run for 1006 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((P3k <= Gab1) AND (1 <= GStarPgP3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((P3k <= Gab1) AND (1 <= GStarPgP3))
lola: processed formula length: 36
lola: 9 rewrites
lola: formula mentions 0 of 39 places; total mentions: 0
lola: closed formula file Angiogenesis-PT-20-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: subprocess 12 will run for 755 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((KdStarGStarP3kStarP2 <= KdStarPgStar) AND E (F ((2 <= KdStarGStarP3kStarP2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
lola: processed formula: E(TRUE U ((KdStarGStarP3kStarP2 <= KdStarPgStar) AND E(TRUE U (2 <= KdStarGStarP3kStarP2))))
lola: processed formula length: 92
lola: 2 rewrites
lola: formula mentions 0 of 39 places; total mentions: 0
lola: closed formula file Angiogenesis-PT-20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 13 will run for 1006 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (F ((2 <= GStarP3kP3))) U E (F ((Enz <= GStarPgP3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(A(TRUE U (2 <= GStarP3kP3)) U E(TRUE U (Enz <= GStarPgP3)))
lola: processed formula length: 61
lola: 3 rewrites
lola: formula mentions 0 of 39 places; total mentions: 0
lola: closed formula file Angiogenesis-PT-20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 14 will run for 1509 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F ((KdStarGStarPgStar + 1 <= KdStarGStarPgStarP2))) OR E ((((KdStarPgStar <= Akt) OR (GP3 <= KdStarGStarP3k)) U ((3 <= Akt) AND (2 <= KdStarGStarPgP3)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1509 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((KdStarGStarPgStar + 1 <= KdStarGStarPgStarP2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (KdStarGStarPgStar + 1 <= KdStarGStarPgStarP2))
lola: processed formula length: 56
lola: 1 rewrites
lola: formula mentions 0 of 39 places; total mentions: 0
lola: closed formula file Angiogenesis-PT-20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 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 15 will run for 3018 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((KdStarPgStar <= Akt) OR (GP3 <= KdStarGStarP3k)) U ((3 <= Akt) AND (2 <= KdStarGStarPgP3))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((KdStarPgStar <= Akt) OR (GP3 <= KdStarGStarP3k)) U ((3 <= Akt) AND (2 <= KdStarGStarPgP3)))
lola: processed formula length: 96
lola: 1 rewrites
lola: formula mentions 0 of 39 places; total mentions: 0
lola: closed formula file Angiogenesis-PT-20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 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: 3941125 markings, 7775007 edges, 3108142075472773120 markings/sec, 0 secs
lola: 7265604 markings, 14447928 edges, 664896 markings/sec, 5 secs
lola: 10319055 markings, 20562466 edges, 610690 markings/sec, 10 secs
lola: 13396440 markings, 26775482 edges, 615477 markings/sec, 15 secs
lola: 16304378 markings, 32567624 edges, 581588 markings/sec, 20 secs
lola: 19294697 markings, 38523095 edges, 598064 markings/sec, 25 secs
lola: 22150711 markings, 44244790 edges, 571203 markings/sec, 30 secs
lola: 25040730 markings, 49948838 edges, 578004 markings/sec, 35 secs
lola: 27822883 markings, 55582613 edges, 556431 markings/sec, 40 secs
lola: 30666010 markings, 61196145 edges, 568625 markings/sec, 45 secs
lola: 33555722 markings, 67019337 edges, 577942 markings/sec, 50 secs
lola: 36266397 markings, 72416534 edges, 542135 markings/sec, 55 secs
lola: 38849986 markings, 77534422 edges, 516718 markings/sec, 60 secs
lola: 41260213 markings, 82331526 edges, 482045 markings/sec, 65 secs
lola: 43907589 markings, 87676077 edges, 529475 markings/sec, 70 secs
lola: 46537996 markings, 92995895 edges, 526081 markings/sec, 75 secs
lola: 49069293 markings, 98108643 edges, 506259 markings/sec, 80 secs
lola: 51588534 markings, 103200847 edges, 503848 markings/sec, 85 secs
lola: 54063252 markings, 108265865 edges, 494944 markings/sec, 90 secs
lola: 56566475 markings, 113183418 edges, 500645 markings/sec, 95 secs
lola: 58979085 markings, 118117373 edges, 482522 markings/sec, 100 secs
lola: 61376685 markings, 123053689 edges, 479520 markings/sec, 105 secs
lola: 63801646 markings, 128038025 edges, 484992 markings/sec, 110 secs
lola: 66267997 markings, 132943043 edges, 493270 markings/sec, 115 secs
lola: 68741917 markings, 137806653 edges, 494784 markings/sec, 120 secs
lola: 71254180 markings, 142775157 edges, 502453 markings/sec, 125 secs
lola: 73627411 markings, 147598341 edges, 474646 markings/sec, 130 secs
lola: 76045899 markings, 152627775 edges, 483698 markings/sec, 135 secs
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: subprocess 15 will run for 2872 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (F (TRUE)) AND E (F (((3 <= DAG) AND (2 <= Enz) AND ((Enz <= PtP2) OR (3 <= KdStarGStarPgStar))))))
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 124 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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Angiogenesis-PT-20-CTLCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file Angiogenesis-PT-20-CTLCardinality-15.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes no no yes no yes unknown yes yes no yes yes unknown yes
FORMULA Angiogenesis-PT-20-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-20-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-20-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-20-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-20-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-20-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-20-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-20-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-20-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-20-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-20-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-20-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-20-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-20-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-20-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-20-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494599002199

--------------------
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="Angiogenesis-PT-20"
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/Angiogenesis-PT-20.tgz
mv Angiogenesis-PT-20 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 Angiogenesis-PT-20, 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 r008-csrt-149436125900129"
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 ;