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 S_SmallOperatingSystem-PT-MT2048DC0512, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-ebro-149443463800012
=====================================================================

--------------------
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 1496556680550


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


checking for too many tokens
===========================================================================================
S_SmallOperatingSystem-PT-MT2048DC0512: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_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: SUBRESULTlola:
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.
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 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: SUBRESULT
lola: 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: 2194321 markings, 4378799 edges, 2692686659115286528 markings/sec, 0 secs
lola: 4194127 markings, 8368961 edges, 399961 markings/sec, 5 secs
lola: 6167382 markings, 12309594 edges, 394651 markings/sec, 10 secs
lola: 8168039 markings, 16301469 edges, 400131 markings/sec, 15 secs
lola: 10177672 markings, 20314894 edges, 401927 markings/sec, 20 secs
lola: 12105851 markings, 24161782 edges, 385636 markings/sec, 25 secs
lola: 14011648 markings, 27967475 edges, 381159 markings/sec, 30 secs
lola: 15971757 markings, 31878256 edges, 392022 markings/sec, 35 secs
lola: 17939464 markings, 35807824 edges, 393541 markings/sec, 40 secs
lola: 19840826 markings, 39601086 edges, 380272 markings/sec, 45 secs
lola: 21720796 markings, 43355134 edges, 375994 markings/sec, 50 secs
lola: 23633125 markings, 47170350 edges, 382466 markings/sec, 55 secs
lola: 25525812 markings, 50949853 edges, 378537 markings/sec, 60 secs
lola: 27398825 markings, 54686424 edges, 374603 markings/sec, 65 secs
lola: 29255044 markings, 58392978 edges, 371244 markings/sec, 70 secs
lola: 31107191 markings, 62087817 edges, 370429 markings/sec, 75 secs
lola: 33001773 markings, 65871133 edges, 378916 markings/sec, 80 secs
lola: 34871151 markings, 69600460 edges, 373876 markings/sec, 85 secs
lola: 36646605 markings, 73145450 edges, 355091 markings/sec, 90 secs
lola: 38446674 markings, 76739689 edges, 360014 markings/sec, 95 secs
lola: 40320144 markings, 80477224 edges, 374694 markings/sec, 100 secs
lola: 42189321 markings, 84209740 edges, 373835 markings/sec, 105 secs
lola: 44012912 markings, 87847497 edges, 364718 markings/sec, 110 secs
lola: 45816078 markings, 91447955 edges, 360633 markings/sec, 115 secs
lola: 47654695 markings, 95115786 edges, 367723 markings/sec, 120 secs
lola: 49524605 markings, 98849793 edges, 373982 markings/sec, 125 secs
lola: 51355882 markings, 102502955 edges, 366255 markings/sec, 130 secs
lola: 53147809 markings, 106080950 edges, 358385 markings/sec, 135 secs
lola: 54950223 markings, 109676382 edges, 360483 markings/sec, 140 secs
lola: 56805198 markings, 113380528 edges, 370995 markings/sec, 145 secs
lola: 58647564 markings, 117055905 edges, 368473 markings/sec, 150 secs
lola: 60428725 markings, 120612386 edges, 356232 markings/sec, 155 secs
lola: 62220295 markings, 124186146 edges, 358314 markings/sec, 160 secs
lola: 64110247 markings, 127960298 edges, 377990 markings/sec, 165 secs
lola: 65963419 markings, 131657321 edges, 370634 markings/sec, 170 secs
lola: 67757768 markings, 135240208 edges, 358870 markings/sec, 175 secs
lola: 69603768 markings, 138922898 edges, 369200 markings/sec, 180 secs
lola: 71493455 markings, 142696545 edges, 377937 markings/sec, 185 secs
lola: 73302428 markings, 146305169 edges, 361795 markings/sec, 190 secs
lola: 74272770 markings, 148243012 edges, 194068 markings/sec, 195 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: 2238433 markings, 4467049 edges, 2549028318120771584 markings/sec, 0 secs
lola: 4318929 markings, 8618642 edges, 416099 markings/sec, 5 secs
lola: 6338940 markings, 12649233 edges, 404002 markings/sec, 10 secs
lola: 8404091 markings, 16773727 edges, 413030 markings/sec, 15 secs
lola: 10411835 markings, 20779792 edges, 401549 markings/sec, 20 secs
lola: 12360076 markings, 24670397 edges, 389648 markings/sec, 25 secs
lola: 14340237 markings, 28621291 edges, 396032 markings/sec, 30 secs
lola: 16322582 markings, 32580141 edges, 396469 markings/sec, 35 secs
lola: 18210861 markings, 36347223 edges, 377656 markings/sec, 40 secs
lola: 20055565 markings, 40030710 edges, 368941 markings/sec, 45 secs
lola: 21926332 markings, 43762767 edges, 374153 markings/sec, 50 secs
lola: 23837072 markings, 47578382 edges, 382148 markings/sec, 55 secs
lola: 25714604 markings, 51323991 edges, 375506 markings/sec, 60 secs
lola: 27530265 markings, 54949392 edges, 363132 markings/sec, 65 secs
lola: 29345405 markings, 58573760 edges, 363028 markings/sec, 70 secs
lola: 31209478 markings, 62292460 edges, 372815 markings/sec, 75 secs
lola: 33101622 markings, 66070899 edges, 378429 markings/sec, 80 secs
lola: 34955819 markings, 69769853 edges, 370839 markings/sec, 85 secs
lola: 36771071 markings, 73394467 edges, 363050 markings/sec, 90 secs
lola: 38614080 markings, 77071053 edges, 368602 markings/sec, 95 secs
lola: 40527630 markings, 80892340 edges, 382710 markings/sec, 100 secs
lola: 42448654 markings, 84725023 edges, 384205 markings/sec, 105 secs
lola: 44300358 markings, 88422587 edges, 370341 markings/sec, 110 secs
lola: 46195874 markings, 92204250 edges, 379103 markings/sec, 115 secs
lola: 48117033 markings, 96040786 edges, 384232 markings/sec, 120 secs
lola: 49974254 markings, 99745847 edges, 371444 markings/sec, 125 secs
lola: 51778386 markings, 103348258 edges, 360826 markings/sec, 130 secs
lola: 53642263 markings, 107066651 edges, 372775 markings/sec, 135 secs
lola: 55569935 markings, 110916241 edges, 385534 markings/sec, 140 secs
lola: 57422273 markings, 114611561 edges, 370468 markings/sec, 145 secs
lola: 59262552 markings, 118286313 edges, 368056 markings/sec, 150 secs
lola: 61200720 markings, 122153371 edges, 387634 markings/sec, 155 secs
lola: 63096461 markings, 125935553 edges, 379148 markings/sec, 160 secs
lola: 64942763 markings, 129622376 edges, 369260 markings/sec, 165 secs
lola: 66837134 markings, 133401829 edges, 378874 markings/sec, 170 secs
lola: 68745101 markings, 137208494 edges, 381593 markings/sec, 175 secs
lola: 70573581 markings, 140859680 edges, 365696 markings/sec, 180 secs
lola: 72408443 markings, 144520096 edges, 366972 markings/sec, 185 secs
lola: 74259882 markings, 148217229 edges, 370288 markings/sec, 190 secs
lola: 74306130 markings, 148309756 edges, 9250 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: SUBRESULT
lola: lola: result: yes
========================================lola:
The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 285 seconds at most (--localtimelimit=-1)
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: lola: ========================================
subprocess 7 will run for 348 seconds at most (--localtimelimit=-1)
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: 2275700 markings, 4541615 edges, 3542916460886097920 markings/sec, 0 secs
lola: 4286745 markings, 8554256 edges, 402209 markings/sec, 5 secs
lola: 6257496 markings, 12489883 edges, 394150 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: subprocess 8 will run for 389 seconds at most (--localtimelimit=-1)
lola: ========================================
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 519 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 623 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 779 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 1039 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 1039 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 1558 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: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 14 will run for 1558 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 3117 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: state equation: calling and running 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 1496557103202

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="S_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/S_SmallOperatingSystem-PT-MT2048DC0512.tgz
mv S_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 S_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 r158-ebro-149443463800012"
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 ;