Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-3253
Executing tool lola
Input is SmallOperatingSystem-PT-MT2048DC0512, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-ebro-149441008100012
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494927875203


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ SmallOperatingSystem-PT-MT2048DC0512 @ 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: 17/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 9 places, 8 transitions, 5 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 10 transition conflict sets
lola: TASK
lola: reading formula from SmallOperatingSystem-PT-MT2048DC0512-CTLCardinality.task
lola: ((NOT(E (F ((CPUUnit <= TransferToDisk)))) AND (((TaskSuspended <= 1)) AND E (X ((2 <= TaskOnDisk))))) OR E (X (E (G ((LoadingMem <= TaskReady)))))) : (NOT(E (F ((FreeMemSegment <= 0)))) OR (A (((1 <= TaskOnDisk) U TRUE)) AND A (F ((3 <= TaskReady))))) : E (F (A (X ((FreeMemSegment <= 0))))) : A (G (E (X ((TaskSuspended <= DiskControllerUnit))))) : (NOT(A (G ((CPUUnit + 1 <= FreeMemSegment)))) OR A (G ((2 <= LoadingMem)))) : NOT(A (G (A (G ((TransferToDisk <= TaskOnDisk)))))) : E ((A (X ((LoadingMem <= DiskControllerUnit))) U ((FreeMemSegment + 1 <= ExecutingTask) AND (FreeMemSegment + 1 <= TaskOnDisk)))) : E (F (A (X (((FreeMemSegment <= TransferToDisk) AND (3 <= FreeMemSegment)))))) : A ((((TaskOnDisk + 1 <= CPUUnit) AND (1 <= TaskOnDisk)) U A (G ((LoadingMem <= DiskControllerUnit))))) : NOT(A (G (TRUE))) : A (G (A (G ((CPUUnit + 1 <= FreeMemSegment))))) : NOT(A (X (A (G ((CPUUnit <= FreeMemSegment)))))) : NOT(NOT(E (F ((FreeMemSegment <= TransferToDisk))))) : ((1 <= DiskControllerUnit) AND A (G ((3 <= TaskOnDisk)))) : A (G ((((TaskReady <= TaskSuspended) AND ((2 <= LoadingMem) OR (3 <= TaskOnDisk))) OR (ExecutingTask <= DiskControllerUnit)))) : A (G (A (G ((TaskSuspended + 1 <= DiskControllerUnit)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT(E (F ((CPUUnit <= TransferToDisk)))) AND (((TaskSuspended <= 1)) AND E (X ((2 <= TaskOnDisk))))) OR E (X (E (G ((LoadingMem <= TaskReady))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((TransferToDisk + 1 <= CPUUnit)))
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 20 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 SmallOperatingSystem-PT-MT2048DC0512-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT2048DC0512-CTLCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (G ((LoadingMem <= TaskReady)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(A(TRUE U (TaskReady + 1 <= LoadingMem))))
lola: processed formula length: 48
lola: 6 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT2048DC0512-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: lola: ========================================
SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (F ((FreeMemSegment <= 0)))) OR (A (((1 <= TaskOnDisk) U TRUE)) AND A (F ((3 <= TaskReady)))))
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: A (G ((1 <= FreeMemSegment)))
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 20 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 SmallOperatingSystem-PT-MT2048DC0512-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT2048DC0512-CTLCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= TaskReady)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (3 <= TaskReady))
lola: processed formula length: 26
lola: 8 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT2048DC0512-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: lola: ========================================
SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((FreeMemSegment <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((FreeMemSegment <= 0)))
lola: processed formula length: 35
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT2048DC0512-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 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: 2212585 markings, 4415345 edges, 3107925471682101248 markings/sec, 0 secs
lola: 4206297 markings, 8393308 edges, 398742 markings/sec, 5 secs
lola: 6089013 markings, 12152803 edges, 376543 markings/sec, 10 secs
lola: 7996512 markings, 15958300 edges, 381500 markings/sec, 15 secs
lola: 9965396 markings, 19890201 edges, 393777 markings/sec, 20 secs
lola: 11882611 markings, 23715159 edges, 383443 markings/sec, 25 secs
lola: 13775988 markings, 27496001 edges, 378675 markings/sec, 30 secs
lola: 15643713 markings, 31225529 edges, 373545 markings/sec, 35 secs
lola: 17575906 markings, 35080466 edges, 386439 markings/sec, 40 secs
lola: 19506015 markings, 38934818 edges, 386022 markings/sec, 45 secs
lola: 21362847 markings, 42638995 edges, 371366 markings/sec, 50 secs
lola: 23217649 markings, 46342693 edges, 370960 markings/sec, 55 secs
lola: 25098646 markings, 50095231 edges, 376199 markings/sec, 60 secs
lola: 26999907 markings, 53891897 edges, 380252 markings/sec, 65 secs
lola: 28875994 markings, 57634623 edges, 375217 markings/sec, 70 secs
lola: 30700317 markings, 61277365 edges, 364865 markings/sec, 75 secs
lola: 32519408 markings, 64906079 edges, 363818 markings/sec, 80 secs
lola: 34432512 markings, 68726448 edges, 382621 markings/sec, 85 secs
lola: 36316031 markings, 72484079 edges, 376704 markings/sec, 90 secs
lola: 38136736 markings, 76119605 edges, 364141 markings/sec, 95 secs
lola: 39944421 markings, 79729088 edges, 361537 markings/sec, 100 secs
lola: 41806283 markings, 83443405 edges, 372372 markings/sec, 105 secs
lola: 43687265 markings, 87199542 edges, 376196 markings/sec, 110 secs
lola: 45521846 markings, 90859292 edges, 366916 markings/sec, 115 secs
lola: 47323349 markings, 94456424 edges, 360301 markings/sec, 120 secs
lola: 49161839 markings, 98124010 edges, 367698 markings/sec, 125 secs
lola: 51029782 markings, 101854088 edges, 373589 markings/sec, 130 secs
lola: 52874080 markings, 105533307 edges, 368860 markings/sec, 135 secs
lola: 54675365 markings, 109130028 edges, 360257 markings/sec, 140 secs
lola: 56503882 markings, 112777689 edges, 365703 markings/sec, 145 secs
lola: 58378173 markings, 116520489 edges, 374858 markings/sec, 150 secs
lola: 60223382 markings, 120201558 edges, 369042 markings/sec, 155 secs
lola: 62021357 markings, 123791682 edges, 359595 markings/sec, 160 secs
lola: 63856497 markings, 127452618 edges, 367028 markings/sec, 165 secs
lola: 65726469 markings, 131186801 edges, 373994 markings/sec, 170 secs
lola: 67540579 markings, 134805682 edges, 362822 markings/sec, 175 secs
lola: 69323865 markings, 138366442 edges, 356657 markings/sec, 180 secs
lola: 71177032 markings, 142063477 edges, 370633 markings/sec, 185 secs
lola: 73044310 markings, 145788753 edges, 373456 markings/sec, 190 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 256 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((TaskSuspended <= DiskControllerUnit)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((TaskSuspended <= DiskControllerUnit)))))
lola: processed formula length: 61
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT2048DC0512-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 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: 2180309 markings, 4350768 edges, 3109221795891249152 markings/sec, 0 secs
lola: 4214497 markings, 8409712 edges, 406838 markings/sec, 5 secs
lola: 6176598 markings, 12328035 edges, 392420 markings/sec, 10 secs
lola: 8168859 markings, 16303114 edges, 398452 markings/sec, 15 secs
lola: 10169816 markings, 20299182 edges, 400191 markings/sec, 20 secs
lola: 12077715 markings, 24105496 edges, 381580 markings/sec, 25 secs
lola: 13960461 markings, 27865071 edges, 376549 markings/sec, 30 secs
lola: 15895269 markings, 31725231 edges, 386962 markings/sec, 35 secs
lola: 17834425 markings, 35597678 edges, 387831 markings/sec, 40 secs
lola: 19717147 markings, 39353648 edges, 376544 markings/sec, 45 secs
lola: 21572199 markings, 43057843 edges, 371010 markings/sec, 50 secs
lola: 23433213 markings, 46770397 edges, 372203 markings/sec, 55 secs
lola: 25352107 markings, 50602330 edges, 383779 markings/sec, 60 secs
lola: 27243236 markings, 54375147 edges, 378226 markings/sec, 65 secs
lola: 29065679 markings, 58014122 edges, 364489 markings/sec, 70 secs
lola: 30909222 markings, 61695317 edges, 368709 markings/sec, 75 secs
lola: 32800901 markings, 65469254 edges, 378336 markings/sec, 80 secs
lola: 34714247 markings, 69290113 edges, 382669 markings/sec, 85 secs
lola: 36560261 markings, 72972705 edges, 369203 markings/sec, 90 secs
lola: 38375633 markings, 76597562 edges, 363074 markings/sec, 95 secs
lola: 40246049 markings, 80328985 edges, 374083 markings/sec, 100 secs
lola: 42154469 markings, 84140013 edges, 381684 markings/sec, 105 secs
lola: 43988680 markings, 87799019 edges, 366842 markings/sec, 110 secs
lola: 45807089 markings, 91429973 edges, 363682 markings/sec, 115 secs
lola: 47674097 markings, 95154607 edges, 373402 markings/sec, 120 secs
lola: 49585109 markings, 98970845 edges, 382202 markings/sec, 125 secs
lola: 51443832 markings, 102678920 edges, 371745 markings/sec, 130 secs
lola: 53270513 markings, 106326446 edges, 365336 markings/sec, 135 secs
lola: 55146130 markings, 110068334 edges, 375123 markings/sec, 140 secs
lola: 57042754 markings, 113855809 edges, 379325 markings/sec, 145 secs
lola: 58879162 markings, 117519266 edges, 367282 markings/sec, 150 secs
lola: 60690479 markings, 121136079 edges, 362263 markings/sec, 155 secs
lola: 62579990 markings, 124905797 edges, 377902 markings/sec, 160 secs
lola: 64453163 markings, 128642830 edges, 374635 markings/sec, 165 secs
lola: 66239072 markings, 132208825 edges, 357182 markings/sec, 170 secs
lola: 67964572 markings, 135653969 edges, 345100 markings/sec, 175 secs
lola: 69772791 markings, 139261072 edges, 361644 markings/sec, 180 secs
lola: 71566303 markings, 142842298 edges, 358702 markings/sec, 185 secs
lola: 73301231 markings, 146302777 edges, 346986 markings/sec, 190 secs
lola: 74268983 markings, 148235437 edges, 193550 markings/sec, 195 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 261 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (G ((CPUUnit + 1 <= FreeMemSegment)))) OR A (G ((2 <= LoadingMem))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 261 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FreeMemSegment <= CPUUnit)))
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 20 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 5 will run for 285 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: NOT(A (G (A (G ((TransferToDisk <= TaskOnDisk))))))
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 20 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 SmallOperatingSystem-PT-MT2048DC0512-CTLCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT2048DC0512-CTLCardinality-5.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 6 will run for 313 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((A (X ((LoadingMem <= DiskControllerUnit))) U ((FreeMemSegment + 1 <= ExecutingTask) AND (FreeMemSegment + 1 <= TaskOnDisk))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(AX((LoadingMem <= DiskControllerUnit)) U ((FreeMemSegment + 1 <= ExecutingTask) AND (FreeMemSegment + 1 <= TaskOnDisk)))
lola: processed formula length: 122
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT2048DC0512-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 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 7 will run for 348 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (A (X (((FreeMemSegment <= TransferToDisk) AND (3 <= FreeMemSegment))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX(((FreeMemSegment <= TransferToDisk) AND (3 <= FreeMemSegment))))
lola: processed formula length: 76
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT2048DC0512-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 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: 2243460 markings, 4477111 edges, 3110622023949221888 markings/sec, 0 secs
lola: 4297771 markings, 8576317 edges, 410862 markings/sec, 5 secs
lola: 6295153 markings, 12565220 edges, 399476 markings/sec, 10 secs
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 390 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((TaskOnDisk + 1 <= CPUUnit) AND (1 <= TaskOnDisk)) U A (G ((LoadingMem <= DiskControllerUnit)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((TaskOnDisk + 1 <= CPUUnit) AND (1 <= TaskOnDisk)) U NOT(E(TRUE U (DiskControllerUnit + 1 <= LoadingMem))))
lola: processed formula length: 110
lola: 3 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT2048DC0512-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 9 will run for 445 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (TRUE)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 4 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT2048DC0512-CTLCardinality.task
lola: processed formula with 0 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 10 will run for 520 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (G ((CPUUnit + 1 <= FreeMemSegment)))))
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 20 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 SmallOperatingSystem-PT-MT2048DC0512-CTLCardinality-10.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 624 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (X (A (G ((CPUUnit <= FreeMemSegment))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U (FreeMemSegment + 1 <= CPUUnit)))
lola: processed formula length: 45
lola: 7 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT2048DC0512-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 12 will run for 780 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(E (F ((FreeMemSegment <= TransferToDisk)))))
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 20 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 SmallOperatingSystem-PT-MT2048DC0512-CTLCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT2048DC0512-CTLCardinality-12.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 1040 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((1 <= DiskControllerUnit) AND A (G ((3 <= TaskOnDisk))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1040 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (1 <= DiskControllerUnit)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= DiskControllerUnit)
lola: processed formula length: 25
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT2048DC0512-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 14 will run for 1560 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= TaskOnDisk)))
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 20 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 SmallOperatingSystem-PT-MT2048DC0512-CTLCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT2048DC0512-CTLCardinality-14.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: SUBRESULT
lola: lola: result: yes
lola: ========================================
The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1560 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((TaskReady <= TaskSuspended) AND ((2 <= LoadingMem) OR (3 <= TaskOnDisk))) OR (ExecutingTask <= DiskControllerUnit))))
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 20 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 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT2048DC0512-CTLCardinality-14.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 3120 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (G ((TaskSuspended + 1 <= DiskControllerUnit)))))
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 20 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 SmallOperatingSystem-PT-MT2048DC0512-CTLCardinality-15.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no unknown unknown yes no yes yes no no no yes yes yes no no
FORMULA SmallOperatingSystem-PT-MT2048DC0512-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT2048DC0512-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT2048DC0512-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT2048DC0512-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT2048DC0512-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT2048DC0512-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT2048DC0512-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT2048DC0512-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT2048DC0512-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT2048DC0512-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT2048DC0512-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT2048DC0512-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT2048DC0512-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT2048DC0512-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT2048DC0512-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT2048DC0512-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494928296062

--------------------
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="SmallOperatingSystem-PT-MT2048DC0512"
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/SmallOperatingSystem-PT-MT2048DC0512.tgz
mv SmallOperatingSystem-PT-MT2048DC0512 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is SmallOperatingSystem-PT-MT2048DC0512, 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 r078-ebro-149441008100012"
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 ;