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)
.......................
/home/mcc/execution
total 180K
-rw-r--r-- 1 mcc users 4.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.6K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.9K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 127 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 365 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 13 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 8.1K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is SmallOperatingSystem-PT-MT4096DC1024, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r160-smll-152705512500108
=====================================================================

--------------------
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-MT4096DC1024-CTLCardinality-00
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-01
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-02
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-03
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-04
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-05
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-06
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-07
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-08
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-09
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-10
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-11
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-12
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-13
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-14
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1527240444390

info: Time: 3600 - MCC
===========================================================================================
prep: translating SmallOperatingSystem-PT-MT4096DC1024 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating SmallOperatingSystem-PT-MT4096DC1024 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ SmallOperatingSystem-PT-MT4096DC1024 @ 3570 seconds
lola: LoLA will run for 3570 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: Size of bit vector: 288
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-MT4096DC1024-CTLCardinality.task
lola: always true
lola: LP says that atomic proposition is always true: (TaskReady <= TaskOnDisk)
lola: LP says that atomic proposition is always false: (TaskOnDisk <= ExecutingTask)
lola: always true
lola: LP says that atomic proposition is always true: (ExecutingTask <= TaskOnDisk)
lola: LP says that atomic proposition is always true: (CPUUnit <= TaskOnDisk)
lola: LP says that atomic proposition is always true: (CPUUnit <= TaskOnDisk)
lola: place invariant simplifies atomic proposition
lola: before: (TaskOnDisk <= DiskControllerUnit)
lola: after: (3072 <= 0)
lola: always false
lola: LP says that atomic proposition is always true: (ExecutingTask <= TaskOnDisk)
lola: LP says that atomic proposition is always false: (TaskOnDisk <= TransferToDisk)
lola: always true
lola: always true
lola: always true
lola: always true
lola: (A (((ExecutingTask <= 2) U ((2 <= TaskSuspended) AND (CPUUnit <= FreeMemSegment)))) OR A (X (E (F ((FreeMemSegment <= TaskSuspended)))))) : (E ((TRUE U ((1 <= TaskReady) OR (1 <= DiskControllerUnit)))) AND A (G (()))) : E (F (A (X (FALSE)))) : E (F ((((FreeMemSegment + 1 <= TaskSuspended))))) : NOT(NOT(NOT(A (G ((ExecutingTask <= CPUUnit)))))) : ((NOT(E (G ((3 <= LoadingMem)))) OR (DiskControllerUnit <= LoadingMem)) AND ((3 <= LoadingMem) OR E (F ((CPUUnit <= TransferToDisk))))) : ((3 <= ExecutingTask) OR (E (X ((DiskControllerUnit <= TransferToDisk))) OR E (F (((CPUUnit <= LoadingMem) AND (1 <= DiskControllerUnit)))))) : A (G (NOT(A (X ((CPUUnit <= ExecutingTask)))))) : A (G (A (G ((TransferToDisk + 1 <= CPUUnit))))) : A (X (A (G ((TaskReady <= DiskControllerUnit))))) : E (F (A (G (())))) : A (G (((TransferToDisk + 1 <= CPUUnit)))) : (E (((LoadingMem <= FreeMemSegment) U ())) OR A (X ((2 <= ExecutingTask)))) : A (G (TRUE)) : (A (G (())) AND A (F (A (F ((LoadingMem <= TaskReady)))))) : (NOT(A (G (TRUE))) AND (A (X (TRUE)) AND (1 <= DiskControllerUnit)))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:392
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:136
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 49 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT4096DC1024-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: 0 markings, 0 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 49 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 49 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT4096DC1024-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: 0 markings, 0 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((TaskReady <= DiskControllerUnit)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:663
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (DiskControllerUnit + 1 <= TaskReady)
lola: processed formula length: 37
lola: 51 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 1026 markings, 1025 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((ExecutingTask <= 2) U ((2 <= TaskSuspended) AND (CPUUnit <= FreeMemSegment)))) OR A (X (E (F ((FreeMemSegment <= TaskSuspended))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((ExecutingTask <= 2) U ((2 <= TaskSuspended) AND (CPUUnit <= FreeMemSegment))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (((ExecutingTask <= 2) U ((2 <= TaskSuspended) AND (CPUUnit <= FreeMemSegment))))
lola: processed formula length: 83
lola: 53 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 8193 markings, 8193 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((FreeMemSegment <= TaskSuspended)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(E(TRUE U (FreeMemSegment <= TaskSuspended)))
lola: processed formula length: 47
lola: 51 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 7168 markings, 7167 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((2 <= ExecutingTask)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX((2 <= ExecutingTask))
lola: processed formula length: 24
lola: 50 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((3 <= ExecutingTask) OR (E (X ((DiskControllerUnit <= TransferToDisk))) OR E (F (((CPUUnit <= LoadingMem) AND (1 <= DiskControllerUnit))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((CPUUnit <= LoadingMem) AND (1 <= DiskControllerUnit))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((CPUUnit <= LoadingMem) AND (1 <= DiskControllerUnit))))
lola: processed formula length: 63
lola: 50 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((CPUUnit <= LoadingMem) AND (1 <= DiskControllerUnit))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-6-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4099 markings, 4098 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((ExecutingTask + 1 <= CPUUnit)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(EX((ExecutingTask + 1 <= CPUUnit)))))
lola: processed formula length: 54
lola: 51 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 3349329 markings, 6684382 edges, 669866 markings/sec, 0 secs
lola: 6433444 markings, 12846442 edges, 616823 markings/sec, 5 secs
lola: 9927647 markings, 19828817 edges, 698841 markings/sec, 10 secs
lola: 12998173 markings, 25963701 edges, 614105 markings/sec, 15 secs
lola: 16361790 markings, 32684863 edges, 672723 markings/sec, 20 secs
lola: 19382943 markings, 38720983 edges, 604231 markings/sec, 25 secs
lola: 22671735 markings, 45292474 edges, 657758 markings/sec, 30 secs
lola: 25642446 markings, 51227699 edges, 594142 markings/sec, 35 secs
lola: 28899522 markings, 57735748 edges, 651415 markings/sec, 40 secs
lola: 31794189 markings, 63518861 edges, 578933 markings/sec, 45 secs
lola: 35013445 markings, 69951262 edges, 643851 markings/sec, 50 secs
lola: 37884537 markings, 75687218 edges, 574218 markings/sec, 55 secs
lola: 41157364 markings, 82226780 edges, 654565 markings/sec, 60 secs
lola: 43983508 markings, 87879992 edges, 565229 markings/sec, 65 secs
lola: 47266577 markings, 94432878 edges, 656614 markings/sec, 70 secs
lola: 50065473 markings, 100031589 edges, 559779 markings/sec, 75 secs
lola: 53328744 markings, 106552036 edges, 652654 markings/sec, 80 secs
lola: 56142054 markings, 112172417 edges, 562662 markings/sec, 85 secs
lola: 59364142 markings, 118610488 edges, 644418 markings/sec, 90 secs
lola: 62196889 markings, 124269750 edges, 566549 markings/sec, 95 secs
lola: 65380111 markings, 130630078 edges, 636644 markings/sec, 100 secs
lola: 68238785 markings, 136341205 edges, 571735 markings/sec, 105 secs
lola: 71384709 markings, 142626926 edges, 629185 markings/sec, 110 secs
lola: 74264381 markings, 148380055 edges, 575934 markings/sec, 115 secs
lola: 77358897 markings, 154562948 edges, 618903 markings/sec, 120 secs
lola: 80239471 markings, 160317887 edges, 576115 markings/sec, 125 secs
lola: 83259531 markings, 166351841 edges, 604012 markings/sec, 130 secs
lola: 86174915 markings, 172176414 edges, 583077 markings/sec, 135 secs
lola: 88458014 markings, 176736206 edges, 456620 markings/sec, 140 secs
lola: 88518800 markings, 176857798 edges, 12157 markings/sec, 145 secs
lola: 88529935 markings, 176880072 edges, 2227 markings/sec, 150 secs
lola: 88557481 markings, 176935173 edges, 5509 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 425 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking reachability of deadlocks
lola: Planning: workflow for deadlock check: search (--findpath=off,--siphontrap=off)
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using deadlock preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 4254471 markings, 6380385 edges, 850894 markings/sec, 0 secs
lola: 8204817 markings, 12305569 edges, 790069 markings/sec, 5 secs
lola: 12045730 markings, 18067693 edges, 768183 markings/sec, 10 secs
lola: 15877844 markings, 23817196 edges, 766423 markings/sec, 15 secs
lola: 19362765 markings, 29043725 edges, 696984 markings/sec, 20 secs
lola: 23433424 markings, 35150790 edges, 814132 markings/sec, 25 secs
lola: 26169266 markings, 41231453 edges, 547168 markings/sec, 30 secs
lola: 27711822 markings, 46630959 edges, 308511 markings/sec, 35 secs
lola: 29107194 markings, 51514526 edges, 279074 markings/sec, 40 secs
lola: 30217351 markings, 55400956 edges, 222031 markings/sec, 45 secs
lola: 31405642 markings, 59559123 edges, 237658 markings/sec, 50 secs
lola: 32683504 markings, 64033155 edges, 255572 markings/sec, 55 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The net does not have deadlocks.
lola: 33562626 markings, 67117058 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 477 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= TaskReady) OR (1 <= DiskControllerUnit))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((1 <= TaskReady) OR (1 <= DiskControllerUnit))))
lola: processed formula length: 56
lola: 50 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((1 <= TaskReady) OR (1 <= DiskControllerUnit))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 557 seconds at most (--localtimelimit=0)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((TransferToDisk + 1 <= CPUUnit))))
lola: processed formula length: 41
lola: 51 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((CPUUnit <= TransferToDisk))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-10-0.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: 35333 markings, 55827 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 668 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((FreeMemSegment + 1 <= TaskSuspended)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((((FreeMemSegment + 1 <= TaskSuspended)))))
lola: processed formula length: 49
lola: 50 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (((FreeMemSegment + 1 <= TaskSuspended)))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-11-0.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: 7171 markings, 7171 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 835 seconds at most (--localtimelimit=0)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((TransferToDisk + 1 <= CPUUnit)))
lola: processed formula length: 39
lola: 51 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (CPUUnit <= TransferToDisk)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-12-0.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: 35333 markings, 55827 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1113 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((CPUUnit + 1 <= ExecutingTask)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((CPUUnit + 1 <= ExecutingTask)))
lola: processed formula length: 38
lola: 50 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (CPUUnit + 1 <= ExecutingTask)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-13-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1670 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((LoadingMem <= TaskReady)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (TaskReady + 1 <= LoadingMem)
lola: processed formula length: 29
lola: 51 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3341 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (F ((LoadingMem <= 2))) OR (DiskControllerUnit <= LoadingMem)) AND ((3 <= LoadingMem) OR E (F ((CPUUnit <= TransferToDisk)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3341 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((LoadingMem <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (3 <= LoadingMem)
lola: processed formula length: 17
lola: 51 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((CPUUnit <= TransferToDisk)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((CPUUnit <= TransferToDisk)))
lola: processed formula length: 35
lola: 50 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (CPUUnit <= TransferToDisk)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-17-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-17-0.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: 35333 markings, 55827 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((ExecutingTask + 1 <= CPUUnit)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(EX((ExecutingTask + 1 <= CPUUnit)))))
lola: processed formula length: 54
lola: 51 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 3438277 markings, 6862306 edges, 687655 markings/sec, 0 secs
lola: 6563689 markings, 13106981 edges, 625082 markings/sec, 5 secs
lola: 9924699 markings, 19822924 edges, 672202 markings/sec, 10 secs
lola: 13020945 markings, 26009255 edges, 619249 markings/sec, 15 secs
lola: 16400711 markings, 32762719 edges, 675953 markings/sec, 20 secs
lola: 19457493 markings, 38870115 edges, 611356 markings/sec, 25 secs
lola: 22747731 markings, 45444494 edges, 658048 markings/sec, 30 secs
lola: 25761382 markings, 51465613 edges, 602730 markings/sec, 35 secs
lola: 29016947 markings, 57970639 edges, 651113 markings/sec, 40 secs
lola: 31994640 markings, 63919833 edges, 595539 markings/sec, 45 secs
lola: 35233308 markings, 70391062 edges, 647734 markings/sec, 50 secs
lola: 38173322 markings, 76264886 edges, 588003 markings/sec, 55 secs
lola: 41411109 markings, 82734353 edges, 647557 markings/sec, 60 secs
lola: 44317444 markings, 88540808 edges, 581267 markings/sec, 65 secs
lola: 47551823 markings, 95003461 edges, 646876 markings/sec, 70 secs
lola: 50401170 markings, 100695927 edges, 569869 markings/sec, 75 secs
lola: 53657593 markings, 107202679 edges, 651285 markings/sec, 80 secs
lola: 56473713 markings, 112835843 edges, 563224 markings/sec, 85 secs
lola: 59745666 markings, 119366497 edges, 654391 markings/sec, 90 secs
lola: 62548647 markings, 124973381 edges, 560596 markings/sec, 95 secs
lola: 65795983 markings, 131461959 edges, 649467 markings/sec, 100 secs
lola: 68612349 markings, 137088456 edges, 563273 markings/sec, 105 secs
lola: 71824329 markings, 143506310 edges, 642396 markings/sec, 110 secs
lola: 74657181 markings, 149165788 edges, 566570 markings/sec, 115 secs
lola: 77826580 markings, 155498470 edges, 633880 markings/sec, 120 secs
lola: 80659160 markings, 161157402 edges, 566516 markings/sec, 125 secs
lola: 83765025 markings, 167362997 edges, 621173 markings/sec, 130 secs
lola: 86619393 markings, 173065515 edges, 570874 markings/sec, 135 secs
lola: 88523486 markings, 176869246 edges, 380819 markings/sec, 140 secs
lola: 88537986 markings, 176896174 edges, 2900 markings/sec, 145 secs
lola: 88540479 markings, 176901161 edges, 499 markings/sec, 150 secs
lola: 88559944 markings, 176940100 edges, 3893 markings/sec, 155 secs
lola: 88581662 markings, 176983543 edges, 4344 markings/sec, 160 secs

BK_STOP 1527240842747

--------------------
content from stderr:

Killed

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-MT4096DC1024"
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-MT4096DC1024.tgz
mv SmallOperatingSystem-PT-MT4096DC1024 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is SmallOperatingSystem-PT-MT4096DC1024, 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 r160-smll-152705512500108"
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 ;