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 192K
-rw-r--r-- 1 mcc users 4.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K 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 3.1K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K 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.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K 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.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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 mcc4mcc-full
Input is SmallOperatingSystem-PT-MT4096DC2048, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r166-smll-152705516800115
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527071397025


BK_STOP 1527072037724

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using SmallOperatingSystem-PT-MT4096DC2048 as instance name.
Using SmallOperatingSystem as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': False, 'Reversible': True, 'Quasi Live': True, 'Live': True}.
Known tools are: [{'Time': 2054855, 'Memory': 15949.44, 'Tool': 'lola'}, {'Time': 2085553, 'Memory': 15952.72, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola SmallOperatingSystem-PT-MT4096DC2048...

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


checking for too many tokens
===========================================================================================
SmallOperatingSystem-PT-MT4096DC2048: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ SmallOperatingSystem-PT-MT4096DC2048 @ 3540 seconds
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
----- Kill lola and sara stderr -----
Makefile:222: recipe for target 'verify' failed
----- 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-MT4096DC2048-CTLCardinality.task
lola: A (G ((TaskReady <= CPUUnit))) : A (G ((E (F ((1 <= LoadingMem))) OR ((ExecutingTask + 1 <= TransferToDisk) AND (TaskReady <= 2))))) : ((E (G ((LoadingMem <= 1))) AND (A (G ((TaskReady <= FreeMemSegment))) AND (TransferToDisk <= LoadingMem))) AND (((TaskOnDisk <= 2) OR (TaskSuspended <= 2)) AND (TransferToDisk <= 0) AND (ExecutingTask <= TaskSuspended))) : A (F (((TaskOnDisk <= TaskReady) OR A (G (TRUE))))) : E (F (((TransferToDisk + 1 <= FreeMemSegment) AND (FreeMemSegment <= 1) AND (1 <= ExecutingTask)))) : E (F (((ExecutingTask + 1 <= FreeMemSegment) AND (TaskOnDisk + 1 <= TaskReady) AND ((2 <= CPUUnit) OR (CPUUnit <= TaskReady) OR ((1 <= ExecutingTask)))))) : A (G ((TaskReady + 1 <= FreeMemSegment))) : E (F (E (F (((CPUUnit <= TaskReady) OR (TaskOnDisk <= DiskControllerUnit)))))) : (E (((ExecutingTask + 1 <= DiskControllerUnit) U ((FreeMemSegment <= TaskSuspended) OR (TaskOnDisk <= TaskSuspended)))) AND NOT(A (X (((1 <= ExecutingTask) AND (CPUUnit <= ExecutingTask)))))) : A (G ((E (G ((2 <= TaskOnDisk))) OR A (X ((1 <= CPUUnit)))))) : (A (F (A (G ((TransferToDisk <= TaskOnDisk))))) AND E (G (A (X ((TaskReady <= FreeMemSegment)))))) : (A (G ((((3 <= TransferToDisk) AND (LoadingMem <= DiskControllerUnit)) OR (TransferToDisk + 1 <= CPUUnit)))) AND E (F (((CPUUnit <= TaskOnDisk) AND (3 <= DiskControllerUnit) AND (2 <= TaskSuspended))))) : (A (X (((2 <= DiskControllerUnit) OR (LoadingMem <= TaskSuspended) OR (1 <= TransferToDisk) OR (3 <= TaskSuspended)))) AND (NOT(A (F ((TransferToDisk <= CPUUnit)))) OR A (G ((2 <= FreeMemSegment))))) : A (G (E ((TRUE U (3 <= TaskSuspended))))) : A (F ((((CPUUnit <= LoadingMem) OR (2 <= TaskOnDisk)) AND ((2 <= TaskSuspended) OR (1 <= TaskReady) OR ((CPUUnit <= LoadingMem)))))) : A (G (((3 <= DiskControllerUnit) AND E (F ((DiskControllerUnit <= LoadingMem))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((TaskReady <= 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-MT4096DC2048-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT4096DC2048-CTLCardinality.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: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (F ((1 <= LoadingMem))) OR ((ExecutingTask + 1 <= TransferToDisk) AND (TaskReady <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (NOT(E(TRUE U (1 <= LoadingMem))) AND ((TransferToDisk <= ExecutingTask) OR (3 <= TaskReady)))))
lola: processed formula length: 110
lola: 4 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT4096DC2048-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: 2947836 markings, 8837232 edges, 3538169319433175040 markings/sec, 0 secs
lola: 5831203 markings, 17483060 edges, 576673 markings/sec, 5 secs
lola: 8489032 markings, 25452132 edges, 531566 markings/sec, 10 secs
lola: 11041934 markings, 33112502 edges, 510580 markings/sec, 15 secs
lola: 13585219 markings, 40737869 edges, 508657 markings/sec, 20 secs
lola: 16045516 markings, 48120362 edges, 492059 markings/sec, 25 secs
lola: 18968284 markings, 56884424 edges, 584554 markings/sec, 30 secs
lola: 21815388 markings, 65421451 edges, 569421 markings/sec, 35 secs
lola: 24296747 markings, 72867143 edges, 496272 markings/sec, 40 secs
lola: 27136357 markings, 81381681 edges, 567922 markings/sec, 45 secs
lola: 29947986 markings, 89812261 edges, 562326 markings/sec, 50 secs
lola: 32367624 markings, 97072751 edges, 483928 markings/sec, 55 secs
lola: 35087913 markings, 105229249 edges, 544058 markings/sec, 60 secs
lola: 37931930 markings, 113757013 edges, 568803 markings/sec, 65 secs
lola: 40341472 markings, 120987210 edges, 481908 markings/sec, 70 secs
lola: 42926984 markings, 128739292 edges, 517102 markings/sec, 75 secs
lola: 45738899 markings, 137176871 edges, 562383 markings/sec, 80 secs
lola: 48196306 markings, 144544555 edges, 491481 markings/sec, 85 secs
lola: 50620490 markings, 151812547 edges, 484837 markings/sec, 90 secs
lola: 53476030 markings, 160381034 edges, 571108 markings/sec, 95 secs
lola: 56027158 markings, 168029945 edges, 510226 markings/sec, 100 secs
lola: 58366641 markings, 175049922 edges, 467897 markings/sec, 105 secs
lola: 61157020 markings, 183416741 edges, 558076 markings/sec, 110 secs
lola: 63785128 markings, 191296642 edges, 525622 markings/sec, 115 secs
lola: 66096880 markings, 198233409 edges, 462350 markings/sec, 120 secs
lola: 68747501 markings, 206180865 edges, 530124 markings/sec, 125 secs
lola: 71473382 markings, 214354151 edges, 545176 markings/sec, 130 secs
lola: 73806753 markings, 221355789 edges, 466674 markings/sec, 135 secs
lola: 76286444 markings, 228790346 edges, 495938 markings/sec, 140 secs
lola: 79018991 markings, 236989776 edges, 546509 markings/sec, 145 secs
lola: 81444294 markings, 244261134 edges, 485061 markings/sec, 150 secs
lola: 83733511 markings, 251130284 edges, 457843 markings/sec, 155 secs
lola: 86521802 markings, 259490840 edges, 557658 markings/sec, 160 secs
lola: 87058746 markings, 261102026 edges, 107389 markings/sec, 165 secs
lola: 87062936 markings, 261114600 edges, 838 markings/sec, 170 secs
lola: 87066717 markings, 261125941 edges, 756 markings/sec, 175 secs
lola: 87066791 markings, 261126164 edges, 15 markings/sec, 180 secs
lola: 87070396 markings, 261136985 edges, 721 markings/sec, 185 secs
lola: 87070420 markings, 261137056 edges, 5 markings/sec, 190 secs
lola: 87072502 markings, 261143303 edges, 416 markings/sec, 195 secs
lola: 87072524 markings, 261143368 edges, 4 markings/sec, 200 secs
lola: 87075167 markings, 261151300 edges, 529 markings/sec, 205 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (G ((LoadingMem <= 1))) AND (A (G ((TaskReady <= FreeMemSegment))) AND (TransferToDisk <= LoadingMem))) AND (((TaskOnDisk <= 2) OR (TaskSuspended <= 2)) AND (TransferToDisk <= 0) AND (ExecutingTask <= TaskSuspended)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((LoadingMem <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (2 <= LoadingMem)))
lola: processed formula length: 32
lola: 4 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT4096DC2048-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 12288 markings, 12288 edges
lola: ========================================
lola: subprocess 3 will run for 253 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((TaskReady <= 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4098 markings, 4097 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 253 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((TaskOnDisk <= TaskReady) OR A (G (TRUE)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 6 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT4096DC2048-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: subprocess 4 will run for 274 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((TransferToDisk + 1 <= FreeMemSegment) AND (FreeMemSegment <= 1) AND (1 <= ExecutingTask))))
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: ========================================
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT4096DC2048-CTLCardinality-4.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6144 markings, 6143 edges
lola: ========================================
lola: subprocess 5 will run for 299 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((ExecutingTask + 1 <= FreeMemSegment) AND (TaskOnDisk + 1 <= TaskReady) AND ((2 <= CPUUnit) OR (CPUUnit <= TaskReady) OR ((1 <= ExecutingTask))))))
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 9 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT4096DC2048-CTLCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT4096DC2048-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 329 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((TaskReady + 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-MT4096DC2048-CTLCardinality-6.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4097 markings, 4096 edges
lola: ========================================
lola: subprocess 7 will run for 366 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (F (((CPUUnit <= TaskReady) OR (TaskOnDisk <= DiskControllerUnit))))))
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 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT4096DC2048-CTLCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT4096DC2048-CTLCardinality-7.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: 8193 markings, 8192 edges
lola: ========================================
lola: subprocess 8 will run for 412 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((ExecutingTask + 1 <= DiskControllerUnit) U ((FreeMemSegment <= TaskSuspended) OR (TaskOnDisk <= TaskSuspended)))) AND NOT(A (X (((1 <= ExecutingTask) AND (CPUUnit <= ExecutingTask))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 412 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((ExecutingTask + 1 <= DiskControllerUnit) U ((FreeMemSegment <= TaskSuspended) OR (TaskOnDisk <= TaskSuspended))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((ExecutingTask + 1 <= DiskControllerUnit) U ((FreeMemSegment <= TaskSuspended) OR (TaskOnDisk <= TaskSuspended)))
lola: processed formula length: 116
lola: 4 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT4096DC2048-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 8193 markings, 8192 edges
lola: ========================================
lola: subprocess 9 will run for 470 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((ExecutingTask <= 0) OR (ExecutingTask + 1 <= CPUUnit))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((ExecutingTask <= 0) OR (ExecutingTask + 1 <= CPUUnit)))
lola: processed formula length: 61
lola: 4 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT4096DC2048-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 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 470 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (G ((2 <= TaskOnDisk))) OR A (X ((1 <= CPUUnit))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (A(TRUE U (TaskOnDisk <= 1)) AND NOT(AX((1 <= CPUUnit))))))
lola: processed formula length: 72
lola: 6 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT4096DC2048-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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1278917 markings, 5107681 edges, 3689348869717491712 markings/sec, 0 secs
lola: 2603104 markings, 10404639 edges, 264837 markings/sec, 5 secs
lola: 3929272 markings, 15709527 edges, 265234 markings/sec, 10 secs
lola: 5188403 markings, 20740115 edges, 251826 markings/sec, 15 secs
lola: 6402609 markings, 25597133 edges, 242841 markings/sec, 20 secs
lola: 7569517 markings, 30264952 edges, 233382 markings/sec, 25 secs
lola: 8785217 markings, 35121811 edges, 243140 markings/sec, 30 secs
lola: 9966202 markings, 39845939 edges, 236197 markings/sec, 35 secs
lola: 11085346 markings, 44322699 edges, 223829 markings/sec, 40 secs
lola: 12193748 markings, 48756492 edges, 221680 markings/sec, 45 secs
lola: 13313564 markings, 53229791 edges, 223963 markings/sec, 50 secs
lola: 14396705 markings, 57562531 edges, 216628 markings/sec, 55 secs
lola: 15475804 markings, 61879108 edges, 215820 markings/sec, 60 secs
lola: 16571248 markings, 66261060 edges, 219089 markings/sec, 65 secs
lola: 17826956 markings, 71277950 edges, 251142 markings/sec, 70 secs
lola: 19074848 markings, 76269721 edges, 249578 markings/sec, 75 secs
lola: 20305004 markings, 81190550 edges, 246031 markings/sec, 80 secs
lola: 21492082 markings, 85932909 edges, 237416 markings/sec, 85 secs
lola: 22587126 markings, 90313271 edges, 219009 markings/sec, 90 secs
lola: 23668882 markings, 94640466 edges, 216351 markings/sec, 95 secs
lola: 24749518 markings, 98963184 edges, 216127 markings/sec, 100 secs
lola: 25958356 markings, 103792591 edges, 241768 markings/sec, 105 secs
lola: 27197998 markings, 108751363 edges, 247928 markings/sec, 110 secs
lola: 28398076 markings, 113551869 edges, 240016 markings/sec, 115 secs
lola: 29586663 markings, 118300271 edges, 237717 markings/sec, 120 secs
lola: 30666595 markings, 122620178 edges, 215986 markings/sec, 125 secs
lola: 31726100 markings, 126858373 edges, 211901 markings/sec, 130 secs
lola: 32781830 markings, 131081465 edges, 211146 markings/sec, 135 secs
lola: 33908952 markings, 135583990 edges, 225424 markings/sec, 140 secs
lola: 35142842 markings, 140519751 edges, 246778 markings/sec, 145 secs
lola: 36343332 markings, 145321907 edges, 240098 markings/sec, 150 secs
lola: 37539186 markings, 150105519 edges, 239171 markings/sec, 155 secs
lola: 38654366 markings, 154560284 edges, 223036 markings/sec, 160 secs
lola: 39716108 markings, 158807422 edges, 212348 markings/sec, 165 secs
lola: 40768908 markings, 163018793 edges, 210560 markings/sec, 170 secs
lola: 41828412 markings, 167256988 edges, 211901 markings/sec, 175 secs
lola: 43051046 markings, 172141584 edges, 244527 markings/sec, 180 secs
lola: 44255347 markings, 176958978 edges, 240860 markings/sec, 185 secs
lola: 45439762 markings, 181696831 edges, 236883 markings/sec, 190 secs
lola: 46590982 markings, 186295767 edges, 230244 markings/sec, 195 secs
lola: 47644557 markings, 190510232 edges, 210715 markings/sec, 200 secs
lola: 48685889 markings, 194675732 edges, 208266 markings/sec, 205 secs
lola: 49719118 markings, 198808815 edges, 206646 markings/sec, 210 secs
lola: 50853172 markings, 203339077 edges, 226811 markings/sec, 215 secs
lola: 52064208 markings, 208183419 edges, 242207 markings/sec, 220 secs
lola: 53250710 markings, 212929627 edges, 237300 markings/sec, 225 secs
lola: 54428126 markings, 217639477 edges, 235483 markings/sec, 230 secs
lola: 55511168 markings, 221965688 edges, 216608 markings/sec, 235 secs
lola: 56552654 markings, 226131798 edges, 208297 markings/sec, 240 secs
lola: 57588444 markings, 230275127 edges, 207158 markings/sec, 245 secs
lola: 58627445 markings, 234431307 edges, 207800 markings/sec, 250 secs
lola: 59837702 markings, 239266394 edges, 242051 markings/sec, 255 secs
lola: 61025639 markings, 244018336 edges, 237587 markings/sec, 260 secs
lola: 62197342 markings, 248705337 edges, 234341 markings/sec, 265 secs
lola: 63338296 markings, 253263204 edges, 228191 markings/sec, 270 secs
lola: 64387696 markings, 257460971 edges, 209880 markings/sec, 275 secs
lola: 65423136 markings, 261602903 edges, 207088 markings/sec, 280 secs
lola: 66458852 markings, 265745933 edges, 207143 markings/sec, 285 secs
lola: 67583263 markings, 270237628 edges, 224882 markings/sec, 290 secs
lola: 68780494 markings, 275026744 edges, 239446 markings/sec, 295 secs
lola: 69961429 markings, 279750681 edges, 236187 markings/sec, 300 secs
lola: 71126608 markings, 284411583 edges, 233036 markings/sec, 305 secs
lola: 72205425 markings, 288720896 edges, 215763 markings/sec, 310 secs
lola: 73240608 markings, 292861796 edges, 207037 markings/sec, 315 secs
lola: 74266560 markings, 296965775 edges, 205190 markings/sec, 320 secs
lola: 75292320 markings, 301068976 edges, 205152 markings/sec, 325 secs
lola: 76474095 markings, 305790134 edges, 236355 markings/sec, 330 secs
lola: 77646869 markings, 310481428 edges, 234555 markings/sec, 335 secs
lola: 78795997 markings, 315078125 edges, 229826 markings/sec, 340 secs
lola: 79934410 markings, 319625832 edges, 227683 markings/sec, 345 secs
lola: 80963168 markings, 323741025 edges, 205752 markings/sec, 350 secs
lola: 81979034 markings, 327804655 edges, 203173 markings/sec, 355 secs
lola: 82993546 markings, 331862875 edges, 202902 markings/sec, 360 secs
lola: 84055130 markings, 336103244 edges, 212317 markings/sec, 365 secs
lola: 85235610 markings, 340825360 edges, 236096 markings/sec, 370 secs
lola: 86398816 markings, 345478373 edges, 232641 markings/sec, 375 secs
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '
'
Aborted (core dumped)
FORMULA SmallOperatingSystem-PT-MT4096DC2048-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC2048-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC2048-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC2048-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC2048-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC2048-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC2048-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC2048-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC2048-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC2048-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC2048-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC2048-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC2048-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC2048-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC2048-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC2048-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

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-MT4096DC2048"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-full"
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-MT4096DC2048.tgz
mv SmallOperatingSystem-PT-MT4096DC2048 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 mcc4mcc-full"
echo " Input is SmallOperatingSystem-PT-MT4096DC2048, 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 r166-smll-152705516800115"
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 ;