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 188K
-rw-r--r-- 1 mcc users 4.3K 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 3.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.7K 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 9.4K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K 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.1K 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-full
Input is SmallOperatingSystem-PT-MT8192DC4096, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-152705514000129
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527060192751


BK_STOP 1527060607523

--------------------
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-MT8192DC4096 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': 2000877, 'Memory': 15950.52, 'Tool': 'lola'}, {'Time': 2051916, 'Memory': 15946.52, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola SmallOperatingSystem-PT-MT8192DC4096...

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


checking for too many tokens
===========================================================================================
SmallOperatingSystem-PT-MT8192DC4096: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ SmallOperatingSystem-PT-MT8192DC4096 @ 3540 seconds
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
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-MT8192DC4096-CTLCardinality.task
lola: (NOT(A (G (((1 <= FreeMemSegment) AND (TaskSuspended <= DiskControllerUnit))))) AND NOT(((ExecutingTask + 1 <= TransferToDisk) AND E (X ((CPUUnit <= FreeMemSegment)))))) : E (F ((A (G ((1 <= TaskOnDisk))) OR ((DiskControllerUnit <= 1) AND ((2 <= TransferToDisk) OR (3 <= TransferToDisk)))))) : E (G (A (X (((DiskControllerUnit <= LoadingMem) OR (ExecutingTask <= TransferToDisk)))))) : E (F ((TaskOnDisk + 1 <= ExecutingTask))) : NOT(E (F ((TaskOnDisk + 1 <= DiskControllerUnit)))) : NOT((A (G (((ExecutingTask <= CPUUnit) AND (ExecutingTask <= CPUUnit)))) OR ((CPUUnit <= 2) OR ((CPUUnit <= TaskReady) AND (1 <= TransferToDisk)) OR ((2 <= TaskSuspended) AND (3 <= TaskReady) AND ((1 <= FreeMemSegment) OR (2 <= TaskOnDisk)))))) : A (G (E (F ((3 <= TaskReady))))) : NOT(NOT(A (G ((TaskSuspended + 1 <= FreeMemSegment))))) : ((TaskReady <= LoadingMem) AND E (F ((CPUUnit <= TaskReady)))) : ((A (G ((1 <= TransferToDisk))) AND (1 <= TaskSuspended)) OR (((TaskOnDisk + 1 <= ExecutingTask) AND (((3 <= FreeMemSegment) AND (2 <= TransferToDisk)) OR (TaskReady <= 0))) OR NOT(A (G ((1 <= DiskControllerUnit)))))) : A (G (A (((3 <= FreeMemSegment) U (TaskSuspended <= DiskControllerUnit))))) : A (F (A (G ((3 <= TaskOnDisk))))) : NOT((E (X ((1 <= TransferToDisk))) OR (A (G ((3 <= TaskOnDisk))) AND E (X ((TransferToDisk <= TaskReady)))))) : E ((((2 <= DiskControllerUnit) OR (ExecutingTask <= LoadingMem) OR ((TaskSuspended <= CPUUnit) AND (1 <= FreeMemSegment))) U E (F ((CPUUnit <= TaskReady))))) : (((TransferToDisk <= CPUUnit) OR (TaskReady <= FreeMemSegment)) AND E (G (A (G (TRUE))))) : (A (F (A (G ((DiskControllerUnit <= TaskOnDisk))))) AND A (F (E (F (TRUE)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (G (((1 <= FreeMemSegment) AND (TaskSuspended <= DiskControllerUnit))))) AND NOT(((ExecutingTask + 1 <= TransferToDisk) AND E (X ((CPUUnit <= FreeMemSegment))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FreeMemSegment <= 0) OR (DiskControllerUnit + 1 <= TaskSuspended))))
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-MT8192DC4096-CTLCardinality.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12289 markings, 12288 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (TransferToDisk <= ExecutingTask)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (TransferToDisk <= ExecutingTask)
lola: processed formula length: 33
lola: 8 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((A (G ((1 <= TaskOnDisk))) OR ((DiskControllerUnit <= 1) AND ((2 <= TransferToDisk) OR (3 <= TransferToDisk))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((1 <= TaskOnDisk)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (TaskOnDisk <= 0))))
lola: processed formula length: 42
lola: 4 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT8192DC4096-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: 3534976 markings, 7053852 edges, 706995 markings/sec, 0 secs
lola: 7462434 markings, 14909090 edges, 785492 markings/sec, 5 secs
lola: 11346916 markings, 22678368 edges, 776896 markings/sec, 10 secs
lola: 15214155 markings, 30413163 edges, 773448 markings/sec, 15 secs
lola: 18597609 markings, 37168057 edges, 676691 markings/sec, 20 secs
lola: 21499835 markings, 42972743 edges, 580445 markings/sec, 25 secs
lola: 24356520 markings, 48686347 edges, 571337 markings/sec, 30 secs
lola: 27205686 markings, 54384910 edges, 569833 markings/sec, 35 secs
lola: 30061872 markings, 60097514 edges, 571237 markings/sec, 40 secs
lola: 32953287 markings, 65880579 edges, 578283 markings/sec, 45 secs
lola: 35814239 markings, 71590427 edges, 572190 markings/sec, 50 secs
lola: 38521636 markings, 77005444 edges, 541479 markings/sec, 55 secs
lola: 41193780 markings, 82349948 edges, 534429 markings/sec, 60 secs
lola: 43867245 markings, 87697096 edges, 534693 markings/sec, 65 secs
lola: 46547039 markings, 93056902 edges, 535959 markings/sec, 70 secs
lola: 49245577 markings, 98454199 edges, 539708 markings/sec, 75 secs
lola: 52797826 markings, 105546697 edges, 710450 markings/sec, 80 secs
lola: 56605614 markings, 113162581 edges, 761558 markings/sec, 85 secs
lola: 60291572 markings, 120534799 edges, 737192 markings/sec, 90 secs
lola: 63913726 markings, 127779402 edges, 724431 markings/sec, 95 secs
lola: 67456442 markings, 134852833 edges, 708543 markings/sec, 100 secs
lola: 70283802 markings, 140507783 edges, 565472 markings/sec, 105 secs
lola: 72973428 markings, 145887256 edges, 537925 markings/sec, 110 secs
lola: 75571164 markings, 151082940 edges, 519547 markings/sec, 115 secs
lola: 78155084 markings, 156250989 edges, 516784 markings/sec, 120 secs
lola: 80745526 markings, 161432083 edges, 518088 markings/sec, 125 secs
lola: 83394217 markings, 166729682 edges, 529738 markings/sec, 130 secs
lola: 87025794 markings, 173980844 edges, 726315 markings/sec, 135 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: '
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 242 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (X (((DiskControllerUnit <= LoadingMem) OR (ExecutingTask <= TransferToDisk))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(AX(((DiskControllerUnit <= LoadingMem) OR (ExecutingTask <= TransferToDisk))))))
lola: processed formula length: 98
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 14339 markings, 14339 edges
lola: ========================================
lola: subprocess 3 will run for 261 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((TaskOnDisk + 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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality-3.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 4 will run for 282 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F ((TaskOnDisk + 1 <= DiskControllerUnit))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 308 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (G (((ExecutingTask <= CPUUnit) AND (ExecutingTask <= CPUUnit)))) OR ((CPUUnit <= 2) OR ((CPUUnit <= TaskReady) AND (1 <= TransferToDisk)) OR ((2 <= TaskSuspended) AND (3 <= TaskReady) AND ((1 <= FreeMemSegment) OR (2 <= TaskOnDisk))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 308 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((CPUUnit + 1 <= ExecutingTask) OR (CPUUnit + 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 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality-5.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 4649229 markings, 6973842 edges, 929846 markings/sec, 0 secs
lola: sara is running 5 secs || 8837780 markings, 13256668 edges, 837710 markings/sec, 5 secs
lola: sara is running 10 secs || 12587290 markings, 18880933 edges, 749902 markings/sec, 10 secs
lola: sara is running 15 secs || 16031767 markings, 24047648 edges, 688895 markings/sec, 15 secs
lola: sara is running 20 secs || 19315663 markings, 28973491 edges, 656779 markings/sec, 20 secs
lola: sara is running 25 secs || 22493096 markings, 33739640 edges, 635487 markings/sec, 25 secs
lola: sara is running 30 secs || 25584782 markings, 38377169 edges, 618337 markings/sec, 30 secs
lola: sara is running 35 secs || 28624590 markings, 42936883 edges, 607962 markings/sec, 35 secs
lola: sara is running 40 secs || 31630474 markings, 47445710 edges, 601177 markings/sec, 40 secs
lola: sara is running 45 secs || 34497473 markings, 51746206 edges, 573400 markings/sec, 45 secs
lola: sara is running 50 secs || 37444413 markings, 56166617 edges, 589388 markings/sec, 50 secs
lola: sara is running 55 secs || 40386314 markings, 60579469 edges, 588380 markings/sec, 55 secs
lola: sara is running 60 secs || 43321332 markings, 64981996 edges, 587004 markings/sec, 60 secs
lola: sara is running 65 secs || 46240477 markings, 69360713 edges, 583829 markings/sec, 65 secs
lola: sara is running 70 secs || 49140822 markings, 73711231 edges, 580069 markings/sec, 70 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 50360329 markings, 75540496 edges
lola: ========================================
lola: subprocess 6 will run for 331 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= CPUUnit) AND ((TaskReady + 1 <= CPUUnit) OR (TransferToDisk <= 0)) AND ((TaskSuspended <= 1) OR (TaskReady <= 2) OR ((FreeMemSegment <= 0) AND (TaskOnDisk <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= CPUUnit) AND ((TaskReady + 1 <= CPUUnit) OR (TransferToDisk <= 0)) AND ((TaskSuspended <= 1) OR (TaskReady <= 2) OR ((FreeMemSegment <= 0) AND (TaskOnDisk <= 1))))
lola: processed formula length: 173
lola: 5 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality.task
lola: processed formula with 7 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 331 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((3 <= TaskReady)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (3 <= TaskReady)))))
lola: processed formula length: 46
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT8192DC4096-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: 3198770 markings, 9584283 edges, 3689329903141912576 markings/sec, 0 secs
lola: 6329980 markings, 18978169 edges, 626242 markings/sec, 5 secs
lola: 9433649 markings, 28289426 edges, 620734 markings/sec, 10 secs
lola: 12332569 markings, 36986423 edges, 579784 markings/sec, 15 secs
lola: 15360048 markings, 46069109 edges, 605496 markings/sec, 20 secs
lola: 18011061 markings, 54010085 edges, 530203 markings/sec, 25 secs
lola: 19926095 markings, 59755343 edges, 383007 markings/sec, 30 secs
lola: 21971883 markings, 65892872 edges, 409158 markings/sec, 35 secs
lola: 24088056 markings, 72241565 edges, 423235 markings/sec, 40 secs
lola: 26313311 markings, 78917511 edges, 445051 markings/sec, 45 secs
lola: 28569669 markings, 85686767 edges, 451272 markings/sec, 50 secs
lola: 30834838 markings, 92482460 edges, 453034 markings/sec, 55 secs
lola: 33147301 markings, 99420036 edges, 462493 markings/sec, 60 secs
lola: 35444517 markings, 106299594 edges, 459443 markings/sec, 65 secs
lola: 37566019 markings, 112664273 edges, 424300 markings/sec, 70 secs
lola: 39651302 markings, 118920294 edges, 417057 markings/sec, 75 secs
lola: 41751844 markings, 125222090 edges, 420108 markings/sec, 80 secs
lola: 43826928 markings, 131447512 edges, 415017 markings/sec, 85 secs
lola: 45902548 markings, 137674541 edges, 415124 markings/sec, 90 secs
lola: 47986634 markings, 143926968 edges, 416817 markings/sec, 95 secs
lola: 50110492 markings, 150298714 edges, 424772 markings/sec, 100 secs
lola: 53238811 markings, 159671652 edges, 625664 markings/sec, 105 secs
lola: 56305678 markings, 168872503 edges, 613373 markings/sec, 110 secs
lola: 59294720 markings, 177839873 edges, 597808 markings/sec, 115 secs
lola: 62247275 markings, 186697777 edges, 590511 markings/sec, 120 secs
lola: 65160200 markings, 195436788 edges, 582585 markings/sec, 125 secs
lola: 67818252 markings, 203398889 edges, 531610 markings/sec, 130 secs
lola: 70071180 markings, 210157853 edges, 450586 markings/sec, 135 secs
lola: 72206712 markings, 216564625 edges, 427106 markings/sec, 140 secs
lola: 74069244 markings, 222152372 edges, 372506 markings/sec, 145 secs
lola: 75848756 markings, 227491054 edges, 355902 markings/sec, 150 secs
lola: 77897701 markings, 233638055 edges, 409789 markings/sec, 155 secs
lola: 79964098 markings, 239837416 edges, 413279 markings/sec, 160 secs
lola: 82054878 markings, 246109926 edges, 418156 markings/sec, 165 secs
lola: 84367044 markings, 253034336 edges, 462433 markings/sec, 170 secs
lola: 87412853 markings, 262172013 edges, 609162 markings/sec, 175 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-MT8192DC4096-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SmallOperatingSystem-PT-MT8192DC4096"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-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-MT8192DC4096.tgz
mv SmallOperatingSystem-PT-MT8192DC4096 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-full"
echo " Input is SmallOperatingSystem-PT-MT8192DC4096, 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 r162-smll-152705514000129"
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 ;