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

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


BK_STOP 1527060510582

--------------------
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-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': 'itstools'}].
CTLCardinality lola SmallOperatingSystem-PT-MT8192DC4096...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
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 stdout -----
----- Start make result stderr -----
CTLCardinality @ SmallOperatingSystem-PT-MT8192DC4096 @ 3540 seconds
make: [verify] Error 134 (ignored)
----- Start make result 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-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: 3872854 markings, 7729638 edges, 774571 markings/sec, 0 secs
lola: 7874413 markings, 15733079 edges, 800312 markings/sec, 5 secs
lola: 11249946 markings, 22484421 edges, 675107 markings/sec, 10 secs
lola: 14561445 markings, 29107690 edges, 662300 markings/sec, 15 secs
lola: 17637292 markings, 35247345 edges, 615169 markings/sec, 20 secs
lola: 20036158 markings, 40045272 edges, 479773 markings/sec, 25 secs
lola: 22370911 markings, 44714969 edges, 466951 markings/sec, 30 secs
lola: 24684582 markings, 49342498 edges, 462734 markings/sec, 35 secs
lola: 26987829 markings, 53949179 edges, 460649 markings/sec, 40 secs
lola: 29294489 markings, 58562687 edges, 461332 markings/sec, 45 secs
lola: 31615250 markings, 63204396 edges, 464152 markings/sec, 50 secs
lola: 34052672 markings, 68067150 edges, 487484 markings/sec, 55 secs
lola: 36371530 markings, 72705057 edges, 463772 markings/sec, 60 secs
lola: 38617004 markings, 77196188 edges, 449095 markings/sec, 65 secs
lola: 40842508 markings, 81647377 edges, 445101 markings/sec, 70 secs
lola: 43040849 markings, 86044238 edges, 439668 markings/sec, 75 secs
lola: 45245105 markings, 90452927 edges, 440851 markings/sec, 80 secs
lola: 47456695 markings, 94876290 edges, 442318 markings/sec, 85 secs
lola: 49697851 markings, 99358783 edges, 448231 markings/sec, 90 secs
lola: 53030440 markings, 106011941 edges, 666518 markings/sec, 95 secs
lola: 56379017 markings, 112709370 edges, 669715 markings/sec, 100 secs
lola: 59579486 markings, 119110567 edges, 640094 markings/sec, 105 secs
lola: 62702154 markings, 125356160 edges, 624534 markings/sec, 110 secs
lola: 65771338 markings, 131494778 edges, 613837 markings/sec, 115 secs
lola: 68456468 markings, 136852969 edges, 537026 markings/sec, 120 secs
lola: 70683733 markings, 141307679 edges, 445453 markings/sec, 125 secs
lola: 72851909 markings, 145644207 edges, 433635 markings/sec, 130 secs
lola: 74995696 markings, 149931956 edges, 428757 markings/sec, 135 secs
lola: 77593305 markings, 155127385 edges, 519522 markings/sec, 140 secs
lola: 80225204 markings, 160391399 edges, 526380 markings/sec, 145 secs
lola: 82908439 markings, 165758087 edges, 536647 markings/sec, 150 secs
lola: 86308744 markings, 172546684 edges, 680061 markings/sec, 155 secs
lola: 89772209 markings, 179474103 edges, 692693 markings/sec, 160 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 240 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 259 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 281 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality-4.sara
lola: ========================================
lola: subprocess 5 will run for 306 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 306 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 || 4651143 markings, 6976712 edges, 930229 markings/sec, 0 secs
lola: sara is running 5 secs || 9086109 markings, 13629161 edges, 886993 markings/sec, 5 secs
lola: sara is running 10 secs || 12903574 markings, 19355359 edges, 763493 markings/sec, 10 secs
lola: sara is running 15 secs || 16384154 markings, 24576229 edges, 696116 markings/sec, 15 secs
lola: sara is running 20 secs || 19692162 markings, 29538242 edges, 661602 markings/sec, 20 secs
lola: sara is running 25 secs || 22898230 markings, 34347342 edges, 641214 markings/sec, 25 secs
lola: sara is running 30 secs || 26021185 markings, 39031776 edges, 624591 markings/sec, 30 secs
lola: sara is running 35 secs || 29075454 markings, 43613179 edges, 610854 markings/sec, 35 secs
lola: sara is running 40 secs || 31806520 markings, 47709778 edges, 546213 markings/sec, 40 secs
lola: sara is running 45 secs || 34236074 markings, 51354109 edges, 485911 markings/sec, 45 secs
lola: sara is running 50 secs || 36649872 markings, 54974806 edges, 482760 markings/sec, 50 secs
lola: sara is running 55 secs || 39058405 markings, 58587605 edges, 481707 markings/sec, 55 secs
lola: sara is running 60 secs || 41531222 markings, 62296831 edges, 494563 markings/sec, 60 secs
lola: sara is running 65 secs || 44016184 markings, 66024274 edges, 496992 markings/sec, 65 secs
lola: sara is running 70 secs || 46478800 markings, 69718199 edges, 492523 markings/sec, 70 secs
lola: sara is running 75 secs || 48929721 markings, 73394579 edges, 490184 markings/sec, 75 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 329 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 329 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: 2941393 markings, 8812133 edges, 3689329903141912576 markings/sec, 0 secs
lola: 6033938 markings, 18090020 edges, 618509 markings/sec, 5 secs
lola: 9098313 markings, 27283393 edges, 612875 markings/sec, 10 secs
lola: 12163145 markings, 36478140 edges, 612966 markings/sec, 15 secs
lola: 15248784 markings, 45735309 edges, 617128 markings/sec, 20 secs
lola: 18081634 markings, 54221808 edges, 566570 markings/sec, 25 secs
lola: 20490844 markings, 61449636 edges, 481842 markings/sec, 30 secs
lola: 22861988 markings, 68563261 edges, 474229 markings/sec, 35 secs
lola: 25216955 markings, 75628351 edges, 470993 markings/sec, 40 secs
lola: 27623959 markings, 82849561 edges, 481401 markings/sec, 45 secs
lola: 30075151 markings, 90203338 edges, 490238 markings/sec, 50 secs
lola: 32563654 markings, 97669049 edges, 497701 markings/sec, 55 secs
lola: 35081856 markings, 105211585 edges, 503640 markings/sec, 60 secs
lola: 37418672 markings, 112222221 edges, 467363 markings/sec, 65 secs
lola: 39678144 markings, 119000824 edges, 451894 markings/sec, 70 secs
lola: 41973416 markings, 125886825 edges, 459054 markings/sec, 75 secs
lola: 44207915 markings, 132590503 edges, 446900 markings/sec, 80 secs
lola: 46397094 markings, 139158218 edges, 437836 markings/sec, 85 secs
lola: 48701198 markings, 146070716 edges, 460821 markings/sec, 90 secs
lola: 51025731 markings, 153032231 edges, 464907 markings/sec, 95 secs
lola: 54006351 markings, 161974336 edges, 596124 markings/sec, 100 secs
lola: 56818229 markings, 170410199 edges, 562376 markings/sec, 105 secs
lola: 59521797 markings, 178521122 edges, 540714 markings/sec, 110 secs
lola: 62191750 markings, 186531197 edges, 533991 markings/sec, 115 secs
lola: 64820902 markings, 194418867 edges, 525830 markings/sec, 120 secs
lola: 67383746 markings, 202095335 edges, 512569 markings/sec, 125 secs
lola: 69469708 markings, 208353389 edges, 417192 markings/sec, 130 secs
lola: 71798028 markings, 215338540 edges, 465664 markings/sec, 135 secs
lola: 74082020 markings, 222190700 edges, 456798 markings/sec, 140 secs
lola: 76172944 markings, 228463645 edges, 418185 markings/sec, 145 secs
lola: 78418225 markings, 235199671 edges, 449056 markings/sec, 150 secs
lola: 80638558 markings, 241860848 edges, 444067 markings/sec, 155 secs
lola: 82930661 markings, 248737345 edges, 458421 markings/sec, 160 secs
lola: 85768387 markings, 257238481 edges, 567545 markings/sec, 165 secs
lola: 88780649 markings, 266275514 edges, 602452 markings/sec, 170 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)
----- Kill lola and sara stderr -----
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 -----
----- 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-MT8192DC4096"
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-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-structural"
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 r163-smll-152705514800129"
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 ;