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 irma4mcc-structural
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 r163-smll-152705514800115
=====================================================================

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


BK_STOP 1527059008523

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-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': 'itstools'}].
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 stdout -----
----- Start make result stderr -----
CTLCardinality @ SmallOperatingSystem-PT-MT4096DC2048 @ 3539 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 3539 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 235 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: 2755273 markings, 8259415 edges, 3538169319433175040 markings/sec, 0 secs
lola: 5475240 markings, 16414940 edges, 543993 markings/sec, 5 secs
lola: 7901415 markings, 23695046 edges, 485235 markings/sec, 10 secs
lola: 10231810 markings, 30681601 edges, 466079 markings/sec, 15 secs
lola: 12528143 markings, 37572098 edges, 459267 markings/sec, 20 secs
lola: 14793338 markings, 44363012 edges, 453039 markings/sec, 25 secs
lola: 17119667 markings, 51337373 edges, 465266 markings/sec, 30 secs
lola: 19964862 markings, 59874810 edges, 569039 markings/sec, 35 secs
lola: 22468818 markings, 67382164 edges, 500791 markings/sec, 40 secs
lola: 24743336 markings, 74207204 edges, 454904 markings/sec, 45 secs
lola: 27470305 markings, 82383743 edges, 545394 markings/sec, 50 secs
lola: 30068958 markings, 90175254 edges, 519731 markings/sec, 55 secs
lola: 32299260 markings, 96867614 edges, 446060 markings/sec, 60 secs
lola: 34794036 markings, 104347427 edges, 498955 markings/sec, 65 secs
lola: 37489043 markings, 112434205 edges, 539001 markings/sec, 70 secs
lola: 39775568 markings, 119289130 edges, 457305 markings/sec, 75 secs
lola: 41983920 markings, 125909485 edges, 441670 markings/sec, 80 secs
lola: 44694490 markings, 134042962 edges, 542114 markings/sec, 85 secs
lola: 47150435 markings, 141406262 edges, 491189 markings/sec, 90 secs
lola: 49321849 markings, 147921921 edges, 434283 markings/sec, 95 secs
lola: 51816826 markings, 155402341 edges, 498995 markings/sec, 100 secs
lola: 54450881 markings, 163306225 edges, 526811 markings/sec, 105 secs
lola: 56667900 markings, 169952587 edges, 443404 markings/sec, 110 secs
lola: 58872116 markings, 176560539 edges, 440843 markings/sec, 115 secs
lola: 61538697 markings, 184562022 edges, 533316 markings/sec, 120 secs
lola: 63957004 markings, 191812384 edges, 483661 markings/sec, 125 secs
lola: 66105210 markings, 198258406 edges, 429641 markings/sec, 130 secs
lola: 68570870 markings, 205650859 edges, 493132 markings/sec, 135 secs
lola: 71164045 markings, 213432077 edges, 518635 markings/sec, 140 secs
lola: 73354924 markings, 220000009 edges, 438176 markings/sec, 145 secs
lola: 75493552 markings, 226411155 edges, 427726 markings/sec, 150 secs
lola: 78127439 markings, 234314536 edges, 526777 markings/sec, 155 secs
lola: 80532615 markings, 241525501 edges, 481035 markings/sec, 160 secs
lola: 82651233 markings, 247882742 edges, 423724 markings/sec, 165 secs
lola: 85037283 markings, 255036315 edges, 477210 markings/sec, 170 secs
lola: 87042071 markings, 261051988 edges, 400958 markings/sec, 175 secs
lola: 87046007 markings, 261063801 edges, 787 markings/sec, 180 secs
lola: 87052398 markings, 261082978 edges, 1278 markings/sec, 185 secs
lola: 87056614 markings, 261095628 edges, 843 markings/sec, 190 secs
lola: 87061787 markings, 261111151 edges, 1035 markings/sec, 195 secs
lola: 87062945 markings, 261114626 edges, 232 markings/sec, 200 secs
lola: 87062963 markings, 261114681 edges, 4 markings/sec, 205 secs
lola: 87062972 markings, 261114706 edges, 2 markings/sec, 210 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: state equation: write sara problem file to SmallOperatingSystem-PT-MT4096DC2048-CTLCardinality-3.sara
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: ========================================
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: 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
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 411 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 411 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
----- Finished stderr -----
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: 1232605 markings, 4922420 edges, 3689348869717491712 markings/sec, 0 secs
lola: 2449233 markings, 9789130 edges, 243326 markings/sec, 5 secs
lola: 3662757 markings, 14643424 edges, 242705 markings/sec, 10 secs
lola: 4834322 markings, 19323727 edges, 234313 markings/sec, 15 secs
lola: 5942757 markings, 23757653 edges, 221687 markings/sec, 20 secs
lola: 7039799 markings, 28145997 edges, 219408 markings/sec, 25 secs
lola: 8142620 markings, 32557462 edges, 220564 markings/sec, 30 secs
lola: 9244636 markings, 36959562 edges, 220403 markings/sec, 35 secs
lola: 10313426 markings, 41234898 edges, 213758 markings/sec, 40 secs
lola: 11374055 markings, 45477580 edges, 212126 markings/sec, 45 secs
lola: 12442679 markings, 49752250 edges, 213725 markings/sec, 50 secs
lola: 13521852 markings, 54062975 edges, 215835 markings/sec, 55 secs
lola: 14590016 markings, 58335805 edges, 213633 markings/sec, 60 secs
lola: 15651515 markings, 62581975 edges, 212300 markings/sec, 65 secs
lola: 16719016 markings, 66852156 edges, 213500 markings/sec, 70 secs
lola: 17939586 markings, 71728488 edges, 244114 markings/sec, 75 secs
lola: 19129904 markings, 76489954 edges, 238064 markings/sec, 80 secs
lola: 20305911 markings, 81194180 edges, 235201 markings/sec, 85 secs
lola: 21381992 markings, 85492531 edges, 215216 markings/sec, 90 secs
lola: 22509976 markings, 90004651 edges, 225597 markings/sec, 95 secs
lola: 23625374 markings, 94466431 edges, 223080 markings/sec, 100 secs
lola: 24739104 markings, 98921526 edges, 222746 markings/sec, 105 secs
lola: 25945257 markings, 103740197 edges, 241231 markings/sec, 110 secs
lola: 27170794 markings, 108642541 edges, 245107 markings/sec, 115 secs
lola: 28380091 markings, 113479926 edges, 241859 markings/sec, 120 secs
lola: 29576799 markings, 118260812 edges, 239342 markings/sec, 125 secs
lola: 30695764 markings, 122736855 edges, 223793 markings/sec, 130 secs
lola: 31796761 markings, 127141023 edges, 220199 markings/sec, 135 secs
lola: 32895741 markings, 131537125 edges, 219796 markings/sec, 140 secs
lola: 34062794 markings, 136199385 edges, 233411 markings/sec, 145 secs
lola: 35285074 markings, 141088708 edges, 244456 markings/sec, 150 secs
lola: 36490682 markings, 145911331 edges, 241122 markings/sec, 155 secs
lola: 37687128 markings, 150697316 edges, 239289 markings/sec, 160 secs
lola: 38813626 markings, 155197346 edges, 225300 markings/sec, 165 secs
lola: 39864288 markings, 159400166 edges, 210132 markings/sec, 170 secs
lola: 40932109 markings, 163671631 edges, 213564 markings/sec, 175 secs
lola: 41934008 markings, 167679383 edges, 200380 markings/sec, 180 secs
lola: 43156640 markings, 172563971 edges, 244526 markings/sec, 185 secs
lola: 44352445 markings, 177347392 edges, 239161 markings/sec, 190 secs
lola: 45536844 markings, 182085175 edges, 236880 markings/sec, 195 secs
lola: 46690737 markings, 186694801 edges, 230779 markings/sec, 200 secs
lola: 47783762 markings, 191067075 edges, 218605 markings/sec, 205 secs
lola: 48866684 markings, 195398944 edges, 216584 markings/sec, 210 secs
lola: 49947922 markings, 199724072 edges, 216248 markings/sec, 215 secs
lola: 51131512 markings, 204452489 edges, 236718 markings/sec, 220 secs
lola: 52334404 markings, 209264247 edges, 240578 markings/sec, 225 secs
lola: 53522691 markings, 214017593 edges, 237657 markings/sec, 230 secs
lola: 54698494 markings, 218714855 edges, 235161 markings/sec, 235 secs
lola: 55748961 markings, 222916901 edges, 210093 markings/sec, 240 secs
lola: 56825331 markings, 227222554 edges, 215274 markings/sec, 245 secs
lola: 57898596 markings, 231515792 edges, 214653 markings/sec, 250 secs
lola: 59016828 markings, 235982764 edges, 223646 markings/sec, 255 secs
lola: 60213295 markings, 240768826 edges, 239293 markings/sec, 260 secs
lola: 61393544 markings, 245490015 edges, 236050 markings/sec, 265 secs
lola: 62564461 markings, 250173871 edges, 234183 markings/sec, 270 secs
lola: 63688196 markings, 254662858 edges, 224747 markings/sec, 275 secs
lola: 64720422 markings, 258791930 edges, 206445 markings/sec, 280 secs
lola: 65747743 markings, 262901383 edges, 205464 markings/sec, 285 secs
lola: 66818383 markings, 267184118 edges, 214128 markings/sec, 290 secs
lola: 67999962 markings, 271904494 edges, 236316 markings/sec, 295 secs
lola: 69185974 markings, 276648730 edges, 237202 markings/sec, 300 secs
lola: 70358785 markings, 281340170 edges, 234562 markings/sec, 305 secs
lola: 71516312 markings, 285964327 edges, 231505 markings/sec, 310 secs
lola: 72598990 markings, 290295220 edges, 216536 markings/sec, 315 secs
lola: 73667646 markings, 294570021 edges, 213731 markings/sec, 320 secs
lola: 74733688 markings, 298834357 edges, 213208 markings/sec, 325 secs
lola: 75856182 markings, 303318381 edges, 224499 markings/sec, 330 secs
lola: 77039795 markings, 308053028 edges, 236723 markings/sec, 335 secs
lola: 78207800 markings, 312725238 edges, 233601 markings/sec, 340 secs
lola: 79367802 markings, 317365435 edges, 232000 markings/sec, 345 secs
lola: 80474924 markings, 321787970 edges, 221424 markings/sec, 350 secs
lola: 81541992 markings, 326056422 edges, 213414 markings/sec, 355 secs
lola: 82601856 markings, 330296045 edges, 211973 markings/sec, 360 secs
lola: 83664408 markings, 334546431 edges, 212510 markings/sec, 365 secs
lola: 84847342 markings, 339272221 edges, 236587 markings/sec, 370 secs
lola: 86019298 markings, 343960237 edges, 234391 markings/sec, 375 secs
lola: 87080067 markings, 348203490 edges, 212154 markings/sec, 380 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 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="irma4mcc-structural"
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 irma4mcc-structural"
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 r163-smll-152705514800115"
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 ;