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 FMS-PT-500, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-blw3-149440264300417
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494701170371


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ FMS-PT-500 @ 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: 42/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 22 places, 20 transitions, 16 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 24 transition conflict sets
lola: TASK
lola: reading formula from FMS-PT-500-CTLCardinality.task
lola: E ((E (F ((M3 <= P3))) U A (F ((1 <= P12M3))))) : (NOT(A (((3 <= P12) U (P3s <= P12M3)))) OR (((1 <= P12s) AND (3 <= P1M1) AND (3 <= P3M2)) OR A (G ((P12M3 <= 1))))) : A (G (((P1wP2 <= M3) AND A (X ((P2d <= P3)))))) : (A (G (E (F ((P2d <= P1wP2))))) AND (P12s <= 2)) : ((3 <= P1) AND A (G ((((P1wM1 <= P3) AND (1 <= P1)) OR (P1 <= 0))))) : ((((P1 + 1 <= M2) OR (P2wP1 <= 1)) AND (P2d + 1 <= P1M1) AND ((P2d <= 0) OR (P1s <= P2d))) OR A (G ((2 <= P3)))) : E (F (A (G (((1 <= P3) AND (M2 <= P12wM3)))))) : (E (((P2s <= P2wP1) U ((3 <= P12wM3) OR (P2 <= P1wM1)))) AND (NOT(E (X ((2 <= P12s)))) OR ((((P2s <= P12wM3) AND (1 <= M1)) OR ((P2 <= P12M3) AND (1 <= P2))) AND (3 <= P12)))) : (E (G (E (F ((2 <= P2M2))))) AND NOT(A (((1 <= P12) U (3 <= P3s))))) : A (F ((((M1 <= P1M1) OR (P2s <= M2)) AND A (G ((P1wM1 <= P3)))))) : NOT(NOT(A (G (((P3 <= M2) OR (P12s <= M3)))))) : A (X (E (F (((1 <= P12) AND (2 <= P1)))))) : (A (G (A (X ((1 <= P1))))) AND A (F (((2 <= P1) OR (P12wM3 <= P1M1))))) : A (G ((((P12M3 <= P1wM1) AND (P12 <= P2M2)) OR (P12 <= 2) OR (((M2 <= P1M1) OR (1 <= P1s)) AND ((P2wM2 <= P1M1) OR (P12wM3 <= P2M2)))))) : A (G ((((P12s <= P2M2) AND (P12M3 <= P12s)) OR (P12M3 <= P12s) OR (3 <= P2wP1) OR ((1 <= P3M2) AND (P12wM3 <= P12M3))))) : E (((P12s <= P2d) U A (G ((P1M1 <= P1d)))))
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 ((E (F ((M3 <= P3))) U A (F ((1 <= P12M3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U (M3 <= P3)) U A(TRUE U (1 <= P12M3)))
lola: processed formula length: 48
lola: 3 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-500-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (((3 <= P12) U (P3s <= P12M3)))) OR (((1 <= P12s) AND (3 <= P1M1) AND (3 <= P3M2)) OR A (G ((P12M3 <= 1)))))
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 (((P12 <= 2) R (P12M3 + 1 <= P3s)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((3 <= P12) U (P3s <= P12M3)))
lola: processed formula length: 35
lola: 7 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-500-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((1 <= P12s) AND (3 <= P1M1) AND (3 <= P3M2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= P12s) AND (3 <= P1M1) AND (3 <= P3M2))
lola: processed formula length: 45
lola: 4 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-500-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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((P12M3 <= 1)))
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 64 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 FMS-PT-500-CTLCardinality-3.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: calling and running sara
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((P1wP2 <= M3) AND A (X ((P2d <= P3))))))
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: A (G ((P1wP2 <= M3)))
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 64 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: SUBRESULT
========================================lola:
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (E (F ((P2d <= P1wP2))))) AND (P12s <= 2))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((P2d <= P1wP2)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (P2d <= P1wP2)))))
lola: processed formula length: 44
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-500-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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).
sara: try reading problem file FMS-PT-500-CTLCardinality-3.sara.

lola: 4702271 markings, 10652345 edges, 2029191864891998208 markings/sec, 0 secs
lola: 8812588 markings, 20436724 edges, 822063 markings/sec, 5 secs
lola: 12772152 markings, 29919354 edges, 791913 markings/sec, 10 secs
lola: 16682072 markings, 39308817 edges, 781984 markings/sec, 15 secs
lola: 20573805 markings, 48657372 edges, 778347 markings/sec, 20 secs
lola: 24511659 markings, 58123933 edges, 787571 markings/sec, 25 secs
lola: 28259783 markings, 67144954 edges, 749625 markings/sec, 30 secs
lola: 31960490 markings, 76056165 edges, 740141 markings/sec, 35 secs
lola: 35580133 markings, 84767871 edges, 723929 markings/sec, 40 secs
lola: 39014766 markings, 93076920 edges, 686927 markings/sec, 45 secs
lola: 42357615 markings, 101147219 edges, 668570 markings/sec, 50 secs
lola: 45884548 markings, 109666980 edges, 705387 markings/sec, 55 secs
lola: 49421292 markings, 118238697 edges, 707349 markings/sec, 60 secs
lola: 52944841 markings, 126765720 edges, 704710 markings/sec, 65 secs
lola: 56396666 markings, 135162270 edges, 690365 markings/sec, 70 secs
lola: 59830331 markings, 143468321 edges, 686733 markings/sec, 75 secs
lola: 63287809 markings, 151837292 edges, 691496 markings/sec, 80 secs
lola: 66602334 markings, 159931983 edges, 662905 markings/sec, 85 secs
lola: 69945588 markings, 168022310 edges, 668651 markings/sec, 90 secs
lola: 73358508 markings, 176298943 edges, 682584 markings/sec, 95 secs
lola: 76730933 markings, 184510935 edges, 674485 markings/sec, 100 secs
lola: 80063303 markings, 192590350 edges, 666474 markings/sec, 105 secs
lola: 83399658 markings, 200727627 edges, 667271 markings/sec, 110 secs
lola: 86615500 markings, 208570917 edges, 643168 markings/sec, 115 secs
lola: 89871265 markings, 216470566 edges, 651153 markings/sec, 120 secs
lola: 93148538 markings, 224391221 edges, 655455 markings/sec, 125 secs
lola: 96346967 markings, 232144000 edges, 639686 markings/sec, 130 secs
lola: 99443965 markings, 239806815 edges, 619400 markings/sec, 135 secs
lola: 102712633 markings, 247692034 edges, 653734 markings/sec, 140 secs
lola: 105904676 markings, 255450584 edges, 638409 markings/sec, 145 secs
lola: 109032958 markings, 263127986 edges, 625656 markings/sec, 150 secs
lola: 112232748 markings, 270877349 edges, 639958 markings/sec, 155 secs
lola: 115350339 markings, 278547101 edges, 623518 markings/sec, 160 secs
lola: 118436013 markings, 286083359 edges, 617135 markings/sec, 165 secs
lola: 121570044 markings, 293715689 edges, 626806 markings/sec, 170 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 280 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (P12s <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P12s <= 2)
lola: processed formula length: 11
lola: 0 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-500-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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: subprocess 4 will run for 280 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= P1) AND A (G ((((P1wM1 <= P3) AND (1 <= P1)) OR (P1 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 280 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= P1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= P1)
lola: processed formula length: 9
lola: 0 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-500-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 5 will run for 305 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((P1wM1 <= P3) AND (1 <= P1)) OR (P1 <= 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 64 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 2 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 305 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((P1 + 1 <= M2) OR (P2wP1 <= 1)) AND (P2d + 1 <= P1M1) AND ((P2d <= 0) OR (P1s <= P2d))) OR A (G ((2 <= P3))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 305 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((P1 + 1 <= M2) OR (P2wP1 <= 1)) AND (P2d + 1 <= P1M1) AND ((P2d <= 0) OR (P1s <= P2d)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((P1 + 1 <= M2) OR (P2wP1 <= 1)) AND (P2d + 1 <= P1M1) AND ((P2d <= 0) OR (P1s <= P2d)))
lola: processed formula length: 91
lola: 0 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-500-CTLCardinality.task
lola: processed formula with 5 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 6 will run for 336 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= P3)))
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 64 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: subprocess 6 will run for 336 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((1 <= P3) AND (M2 <= P12wM3))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: ========================================
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U ((P3 <= 0) OR (P12wM3 + 1 <= M2)))))
lola: processed formula length: 59
lola: 3 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-500-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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: 1979853 markings, 7378227 edges, 2822845471221874688 markings/sec, 0 secs
lola: 3663453 markings, 13709572 edges, 336720 markings/sec, 5 secs
lola: 5272856 markings, 19789822 edges, 321881 markings/sec, 10 secs
lola: 6847865 markings, 25658028 edges, 315002 markings/sec, 15 secs
lola: 8358464 markings, 31367550 edges, 302120 markings/sec, 20 secs
lola: 9842327 markings, 36917717 edges, 296773 markings/sec, 25 secs
lola: 11320252 markings, 42488891 edges, 295585 markings/sec, 30 secs
lola: 12787102 markings, 47983847 edges, 293370 markings/sec, 35 secs
lola: 14242310 markings, 53447610 edges, 291042 markings/sec, 40 secs
lola: 15662801 markings, 58756894 edges, 284098 markings/sec, 45 secs
lola: 17065714 markings, 64067943 edges, 280583 markings/sec, 50 secs
lola: 18479142 markings, 69411504 edges, 282686 markings/sec, 55 secs
lola: 19849662 markings, 74515895 edges, 274104 markings/sec, 60 secs
lola: 21225282 markings, 79672063 edges, 275124 markings/sec, 65 secs
lola: 22593342 markings, 84795761 edges, 273612 markings/sec, 70 secs
lola: 23962866 markings, 89944940 edges, 273905 markings/sec, 75 secs
lola: 25342242 markings, 95138598 edges, 275875 markings/sec, 80 secs
lola: 26706042 markings, 100258567 edges, 272760 markings/sec, 85 secs
lola: 28063074 markings, 105296336 edges, 271406 markings/sec, 90 secs
lola: 29380750 markings, 110258841 edges, 263535 markings/sec, 95 secs
lola: 30719620 markings, 115276973 edges, 267774 markings/sec, 100 secs
lola: 32048394 markings, 120222933 edges, 265755 markings/sec, 105 secs
lola: 33385779 markings, 125199837 edges, 267477 markings/sec, 110 secs
lola: 34661559 markings, 129977279 edges, 255156 markings/sec, 115 secs
lola: 36013806 markings, 135007996 edges, 270449 markings/sec, 120 secs
lola: 37342956 markings, 139941602 edges, 265830 markings/sec, 125 secs
lola: 38669988 markings, 144915128 edges, 265406 markings/sec, 130 secs
lola: 39955289 markings, 149708851 edges, 257060 markings/sec, 135 secs
lola: 41263138 markings, 154588412 edges, 261570 markings/sec, 140 secs
lola: 42553839 markings, 159422725 edges, 258140 markings/sec, 145 secs
lola: 43862132 markings, 164323301 edges, 261659 markings/sec, 150 secs
lola: 45164707 markings, 169182753 edges, 260515 markings/sec, 155 secs
lola: 46447877 markings, 174033013 edges, 256634 markings/sec, 160 secs
lola: 47722732 markings, 178788292 edges, 254971 markings/sec, 165 secs
lola: 48976362 markings, 183476994 edges, 250726 markings/sec, 170 secs
lola: 50266303 markings, 188297936 edges, 257988 markings/sec, 175 secs
lola: 51541984 markings, 193069169 edges, 255136 markings/sec, 180 secs
lola: 52820949 markings, 197890655 edges, 255793 markings/sec, 185 secs
lola: 54088138 markings, 202634952 edges, 253438 markings/sec, 190 secs
lola: 55365164 markings, 207402563 edges, 255405 markings/sec, 195 secs
lola: 56632654 markings, 212130707 edges, 253498 markings/sec, 200 secs
lola: 57861559 markings, 216692485 edges, 245781 markings/sec, 205 secs
lola: 59141158 markings, 221490854 edges, 255920 markings/sec, 210 secs
lola: 60422422 markings, 226222076 edges, 256253 markings/sec, 215 secs
lola: 61659687 markings, 230845720 edges, 247453 markings/sec, 220 secs
lola: 62910094 markings, 235551486 edges, 250081 markings/sec, 225 secs
lola: 64222301 markings, 240470165 edges, 262441 markings/sec, 230 secs
lola: 65486641 markings, 245223958 edges, 252868 markings/sec, 235 secs
lola: 66730704 markings, 249852051 edges, 248813 markings/sec, 240 secs
lola: 67943640 markings, 254396127 edges, 242587 markings/sec, 245 secs
lola: 68934996 markings, 258104705 edges, 198271 markings/sec, 250 secs
lola: 70174216 markings, 262700353 edges, 247844 markings/sec, 255 secs
lola: 71416832 markings, 267328524 edges, 248523 markings/sec, 260 secs
lola: 72655251 markings, 271865305 edges, 247684 markings/sec, 265 secs
lola: 73846788 markings, 276314397 edges, 238307 markings/sec, 270 secs
lola: 75094257 markings, 280977155 edges, 249494 markings/sec, 275 secs
lola: 76341227 markings, 285599681 edges, 249394 markings/sec, 280 secs
lola: 77553492 markings, 290111450 edges, 242453 markings/sec, 285 secs
lola: 78775365 markings, 294661437 edges, 244375 markings/sec, 290 secs
lola: 80004276 markings, 299235822 edges, 245782 markings/sec, 295 secs
lola: 81207576 markings, 303742420 edges, 240660 markings/sec, 300 secs
lola: 82411115 markings, 308177614 edges, 240708 markings/sec, 305 secs
lola: 83638525 markings, 312774416 edges, 245482 markings/sec, 310 secs
lola: 84860864 markings, 317318787 edges, 244468 markings/sec, 315 secs
lola: 86088603 markings, 321896529 edges, 245548 markings/sec, 320 secs
lola: 87310968 markings, 326456872 edges, 244473 markings/sec, 325 secs
lola: 88518142 markings, 330940141 edges, 241435 markings/sec, 330 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 336 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((P2s <= P2wP1) U ((3 <= P12wM3) OR (P2 <= P1wM1)))) AND (NOT(E (X ((2 <= P12s)))) OR ((((P2s <= P12wM3) AND (1 <= M1)) OR ((P2 <= P12M3) AND (1 <= P2))) AND (3 <= P12))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 336 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((P2s <= P2wP1) U ((3 <= P12wM3) OR (P2 <= P1wM1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((P2s <= P2wP1) U ((3 <= P12wM3) OR (P2 <= P1wM1)))
lola: processed formula length: 53
lola: 4 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-500-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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 8 will run for 378 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((P12s <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((P12s <= 1))
lola: processed formula length: 15
lola: 4 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-500-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 378 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (E (F ((2 <= P2M2))))) AND NOT(A (((1 <= P12) U (3 <= P3s)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 378 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((2 <= P2M2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (2 <= P2M2)))))
lola: processed formula length: 41
lola: 6 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-500-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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: 7227793 markings, 8804044 edges, 1445559 markings/sec, 0 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: subprocess 9 will run for 430 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((((M1 <= P1M1) OR (P2s <= M2)) AND A (G ((P1wM1 <= P3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (((M1 <= P1M1) OR (P2s <= M2)) AND NOT(E(TRUE U (P3 + 1 <= P1wM1)))))
lola: processed formula length: 79
lola: 3 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-500-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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: ========================================
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 10 will run for 502 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(A (G (((P3 <= M2) OR (P12s <= M3))))))
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 64 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 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 603 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F (((1 <= P12) AND (2 <= P1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U ((1 <= P12) AND (2 <= P1))))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-500-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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: subprocess 12 will run for 753 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (A (X ((1 <= P1))))) AND A (F (((2 <= P1) OR (P12wM3 <= P1M1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: subprocess 12 will run for 753 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (X ((1 <= P1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(AX((1 <= P1)))))
lola: processed formula length: 33
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-500-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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 13 will run for 1004 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((P12M3 <= P1wM1) AND (P12 <= P2M2)) OR (P12 <= 2) OR (((M2 <= P1M1) OR (1 <= P1s)) AND ((P2wM2 <= P1M1) OR (P12wM3 <= P2M2))))))
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 64 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 16 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1506 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((P12s <= P2M2) AND (P12M3 <= P12s)) OR (P12M3 <= P12s) OR (3 <= P2wP1) OR ((1 <= P3M2) AND (P12wM3 <= P12M3)))))
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 64 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 16 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 3012 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((P12s <= P2d) U A (G ((P1M1 <= P1d)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((P12s <= P2d) U NOT(E(TRUE U (P1d + 1 <= P1M1))))
lola: processed formula length: 51
lola: 3 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-500-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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: 2407866 markings, 5272462 edges, 2965996937355984896 markings/sec, 0 secs
lola: 3959065 markings, 10195637 edges, 310240 markings/sec, 5 secs
lola: 5402826 markings, 14867714 edges, 288752 markings/sec, 10 secs
lola: 6854783 markings, 19625859 edges, 290391 markings/sec, 15 secs
lola: 8309073 markings, 24456013 edges, 290858 markings/sec, 20 secs
lola: 9719259 markings, 29188304 edges, 282037 markings/sec, 25 secs
lola: 11137788 markings, 33988303 edges, 283706 markings/sec, 30 secs
lola: 12495084 markings, 38607417 edges, 271459 markings/sec, 35 secs
lola: 13863364 markings, 43216882 edges, 273656 markings/sec, 40 secs
lola: 15172955 markings, 47530232 edges, 261918 markings/sec, 45 secs
lola: 16549369 markings, 52187188 edges, 275283 markings/sec, 50 secs
lola: 17838973 markings, 56614777 edges, 257921 markings/sec, 55 secs
lola: 19210627 markings, 61208295 edges, 274331 markings/sec, 60 secs
lola: 20621950 markings, 65916397 edges, 282265 markings/sec, 65 secs
lola: 22021326 markings, 70584091 edges, 279875 markings/sec, 70 secs
lola: 23422665 markings, 75246224 edges, 280268 markings/sec, 75 secs
lola: 24835194 markings, 79961720 edges, 282506 markings/sec, 80 secs
lola: 26199387 markings, 84508053 edges, 272839 markings/sec, 85 secs
lola: 27596066 markings, 89167543 edges, 279336 markings/sec, 90 secs
lola: 28945684 markings, 93800401 edges, 269924 markings/sec, 95 secs
lola: 30176011 markings, 98148929 edges, 246065 markings/sec, 100 secs
lola: 31434654 markings, 102540464 edges, 251729 markings/sec, 105 secs
lola: 32682768 markings, 106872077 edges, 249623 markings/sec, 110 secs
lola: 33913501 markings, 111158871 edges, 246147 markings/sec, 115 secs
lola: 35143768 markings, 115437499 edges, 246053 markings/sec, 120 secs
lola: 36409089 markings, 119839653 edges, 253064 markings/sec, 125 secs
lola: 37677676 markings, 124383130 edges, 253717 markings/sec, 130 secs
lola: 38809942 markings, 128814702 edges, 226453 markings/sec, 135 secs
lola: 39938052 markings, 132848699 edges, 225622 markings/sec, 140 secs
lola: 41043021 markings, 136799469 edges, 220994 markings/sec, 145 secs
lola: 42159707 markings, 140796777 edges, 223337 markings/sec, 150 secs
lola: 43249255 markings, 144714371 edges, 217910 markings/sec, 155 secs
lola: 44328106 markings, 148592722 edges, 215770 markings/sec, 160 secs
lola: 45424993 markings, 152518271 edges, 219377 markings/sec, 165 secs
lola: 46527791 markings, 156455769 edges, 220560 markings/sec, 170 secs
lola: 47602519 markings, 160315678 edges, 214946 markings/sec, 175 secs
lola: 48669071 markings, 164149726 edges, 213310 markings/sec, 180 secs
lola: 49752404 markings, 168035728 edges, 216667 markings/sec, 185 secs
lola: 50818915 markings, 171888302 edges, 213302 markings/sec, 190 secs
lola: 51893972 markings, 175757684 edges, 215011 markings/sec, 195 secs
lola: 53030163 markings, 179604295 edges, 227238 markings/sec, 200 secs
lola: 54227624 markings, 183566447 edges, 239492 markings/sec, 205 secs
lola: 55422606 markings, 187615665 edges, 238996 markings/sec, 210 secs
lola: 56566734 markings, 191542685 edges, 228826 markings/sec, 215 secs
lola: 57724240 markings, 195565516 edges, 231501 markings/sec, 220 secs
lola: 58935694 markings, 199775813 edges, 242291 markings/sec, 225 secs
lola: 60101250 markings, 203843048 edges, 233111 markings/sec, 230 secs
lola: 61223795 markings, 207797307 edges, 224509 markings/sec, 235 secs
lola: 62361134 markings, 211812019 edges, 227468 markings/sec, 240 secs
lola: 63470091 markings, 215740317 edges, 221791 markings/sec, 245 secs
lola: 64542645 markings, 219544546 edges, 214511 markings/sec, 250 secs
lola: 65599972 markings, 223310278 edges, 211465 markings/sec, 255 secs
lola: 66665856 markings, 227114480 edges, 213177 markings/sec, 260 secs
lola: 67717825 markings, 230950840 edges, 210394 markings/sec, 265 secs
lola: 69027005 markings, 235401269 edges, 261836 markings/sec, 270 secs
lola: 70409464 markings, 240000263 edges, 276492 markings/sec, 275 secs
lola: 71879776 markings, 244900623 edges, 294062 markings/sec, 280 secs
lola: 73351623 markings, 249828945 edges, 294369 markings/sec, 285 secs
lola: 74822495 markings, 254742959 edges, 294174 markings/sec, 290 secs
lola: 76313190 markings, 259717230 edges, 298139 markings/sec, 295 secs
lola: 77643071 markings, 264307506 edges, 265976 markings/sec, 300 secs
lola: 78914760 markings, 268740888 edges, 254338 markings/sec, 305 secs
lola: 80184316 markings, 273141815 edges, 253911 markings/sec, 310 secs
lola: 81483696 markings, 277730997 edges, 259876 markings/sec, 315 secs
lola: 82538008 markings, 281819574 edges, 210862 markings/sec, 320 secs
lola: 83644007 markings, 286068952 edges, 221200 markings/sec, 325 secs
lola: 84745669 markings, 290296369 edges, 220332 markings/sec, 330 secs
lola: 85893591 markings, 294588551 edges, 229584 markings/sec, 335 secs
lola: 87090775 markings, 298883128 edges, 239437 markings/sec, 340 secs
lola: 88333994 markings, 303353246 edges, 248644 markings/sec, 345 secs
lola: 89396385 markings, 307493730 edges, 212478 markings/sec, 350 secs
lola: 90648444 markings, 311932427 edges, 250412 markings/sec, 355 secs
lola: 91872150 markings, 316320172 edges, 244741 markings/sec, 360 secs
lola: 93046487 markings, 320563929 edges, 234867 markings/sec, 365 secs
lola: 94222462 markings, 324800822 edges, 235195 markings/sec, 370 secs
lola: 95360106 markings, 328930656 edges, 227529 markings/sec, 375 secs
lola: 96355776 markings, 332517005 edges, 199134 markings/sec, 380 secs
lola: 97467460 markings, 336568952 edges, 222337 markings/sec, 385 secs
lola: 98578521 markings, 340601712 edges, 222212 markings/sec, 390 secs
lola: 99715485 markings, 344729776 edges, 227393 markings/sec, 395 secs
lola: 100804662 markings, 348709383 edges, 217835 markings/sec, 400 secs
lola: 101885727 markings, 352635265 edges, 216213 markings/sec, 405 secs
lola: 102945772 markings, 356515018 edges, 212009 markings/sec, 410 secs
lola: 103974126 markings, 360301028 edges, 205671 markings/sec, 415 secs
lola: 105028014 markings, 364150078 edges, 210778 markings/sec, 420 secs
lola: 106067678 markings, 367960385 edges, 207933 markings/sec, 425 secs
lola: 107102259 markings, 371718865 edges, 206916 markings/sec, 430 secs
lola: 108135756 markings, 375500806 edges, 206699 markings/sec, 435 secs
lola: 109144208 markings, 379240410 edges, 201690 markings/sec, 440 secs
lola: 110190413 markings, 383069084 edges, 209241 markings/sec, 445 secs
lola: 111220455 markings, 386859579 edges, 206008 markings/sec, 450 secs
lola: 112262267 markings, 390664646 edges, 208362 markings/sec, 455 secs
lola: 113289617 markings, 394439489 edges, 205470 markings/sec, 460 secs
lola: 114329207 markings, 398237347 edges, 207918 markings/sec, 465 secs
lola: 115342453 markings, 402005550 edges, 202649 markings/sec, 470 secs
lola: 116476526 markings, 405700585 edges, 226815 markings/sec, 475 secs
lola: 117658300 markings, 409658712 edges, 236355 markings/sec, 480 secs
lola: 118776656 markings, 413462161 edges, 223671 markings/sec, 485 secs
lola: 119855410 markings, 417172361 edges, 215751 markings/sec, 490 secs
lola: 121025887 markings, 421236050 edges, 234095 markings/sec, 495 secs
lola: 122179359 markings, 425263146 edges, 230694 markings/sec, 500 secs
lola: 123355507 markings, 429378723 edges, 235230 markings/sec, 505 secs
lola: 124574585 markings, 433677491 edges, 243816 markings/sec, 510 secs
lola: 125726854 markings, 437740088 edges, 230454 markings/sec, 515 secs
lola: 126716070 markings, 441253608 edges, 197843 markings/sec, 520 secs
lola: 127771151 markings, 445001285 edges, 211016 markings/sec, 525 secs
lola: 128797948 markings, 448682630 edges, 205359 markings/sec, 530 secs
lola: 129963606 markings, 452864562 edges, 233132 markings/sec, 535 secs
lola: 131053596 markings, 456759660 edges, 217998 markings/sec, 540 secs
lola: 132175553 markings, 461054826 edges, 224391 markings/sec, 545 secs
lola: 133412306 markings, 465537536 edges, 247351 markings/sec, 550 secs
lola: 134615226 markings, 469844548 edges, 240584 markings/sec, 555 secs
lola: 135653664 markings, 473581673 edges, 207688 markings/sec, 560 secs
lola: 136789100 markings, 477648334 edges, 227087 markings/sec, 565 secs
lola: 137926804 markings, 481719644 edges, 227541 markings/sec, 570 secs
lola: 139070416 markings, 485822660 edges, 228722 markings/sec, 575 secs
lola: 140071092 markings, 489459845 edges, 200135 markings/sec, 580 secs
lola: 141232814 markings, 493638360 edges, 232344 markings/sec, 585 secs
lola: 142338361 markings, 497626208 edges, 221109 markings/sec, 590 secs
lola: 143457548 markings, 501696056 edges, 223837 markings/sec, 595 secs
lola: 143968676 markings, 503537979 edges, 102226 markings/sec, 600 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes no no unknown no no unknown yes no no no yes no no no unknown
FORMULA FMS-PT-500-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-500-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-500-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-500-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-500-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-500-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-500-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-500-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-500-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-500-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-500-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-500-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-500-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-500-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-500-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-500-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494702306383

--------------------
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="FMS-PT-500"
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/FMS-PT-500.tgz
mv FMS-PT-500 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 FMS-PT-500, 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 r028-blw3-149440264300417"
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 ;