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 272K
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K 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 3.5K 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 101 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 339 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K 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 1.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 110K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is DES-PT-60a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r054-smll-152646382300283
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526517364276


BK_STOP 1526518090844

--------------------
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 DES-PT-60a as instance name.
Using DES 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': False, 'Source Place': True, 'Sink Place': None, 'Source Transition': False, 'Sink Transition': None, 'Loop Free': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 2791780, 'Memory': 3316.83, 'Tool': 'lola'}, {'Time': 2792458, 'Memory': 3339.48, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola DES-PT-60a...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
DES-PT-60a: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
DES-PT-60a: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ DES-PT-60a @ 3540 seconds
----- Start make result stdout -----
----- 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: 665/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 354 places, 311 transitions, 295 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 336 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-60a-CTLCardinality.task
lola: E (F (((3 <= p214) AND (2 <= p128)))) : NOT(A (X (A (G ((p282 <= p23)))))) : A (((((3 <= p133) AND (2 <= p122)) OR (p270 <= 1)) U (p61 + 1 <= p284))) : E (G (E (F ((3 <= p17))))) : ((((p161 <= 0) AND (p314 <= 1)) OR (((p5 <= 2) OR (p232 <= 2)) AND (p163 <= p105))) AND NOT((A (F ((3 <= p190))) OR A (G ((1 <= p216)))))) : (E (G ((p126 <= p146))) OR NOT((A (X ((p329 <= p142))) OR (p286 <= p61)))) : A (G (A (F (((2 <= p45) AND (p68 <= p160)))))) : A (F (NOT(A (F ((p266 <= p306)))))) : E (X (E (((p353 <= p256) U (2 <= p130))))) : A ((E (F ((p306 <= p161))) U A (F ((2 <= p322))))) : E (F (E (G ((p180 <= p220))))) : ((p110 <= p6) AND (E (G ((p198 <= 1))) OR (E (G ((3 <= p5))) AND ((p202 <= 1) AND (p293 + 1 <= p67))))) : (E (G ((p340 <= p34))) OR A (F (E (G ((p27 <= p291)))))) : A (G (E (X ((p96 <= p183))))) : NOT((A (F ((p159 + 1 <= p156))) OR (A (F ((p311 <= p34))) AND E (G ((3 <= p0)))))) : ((E (F (((1 <= p122) AND (3 <= p187)))) OR A (G ((p75 + 1 <= p122)))) AND (p1 <= p93))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p214) AND (2 <= p128))))
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 40 bytes per marking, with 25 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 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-60a-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-60a-CTLCardinality.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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (X (A (G ((p282 <= p23))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U (p23 + 1 <= p282)))
lola: processed formula length: 31
lola: 7 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: 51594 markings, 304274 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((((3 <= p133) AND (2 <= p122)) OR (p270 <= 1)) U (p61 + 1 <= p284)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((((3 <= p133) AND (2 <= p122)) OR (p270 <= 1)) U (p61 + 1 <= p284)))
lola: processed formula: A (((((3 <= p133) AND (2 <= p122)) OR (p270 <= 1)) U (p61 + 1 <= p284)))
lola: processed formula length: 73
lola: 0 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 23 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 26 markings, 26 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((3 <= p17)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (3 <= p17)))))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: 595386 markings, 3666828 edges, 3192519972177838080 markings/sec, 0 secs
lola: 1131607 markings, 7305852 edges, 107244 markings/sec, 5 secs
lola: 1528849 markings, 10792046 edges, 79448 markings/sec, 10 secs
lola: 1897317 markings, 14144914 edges, 73694 markings/sec, 15 secs
lola: 2264227 markings, 17504717 edges, 73382 markings/sec, 20 secs
lola: 2605136 markings, 20829541 edges, 68182 markings/sec, 25 secs
lola: 3028521 markings, 24241146 edges, 84677 markings/sec, 30 secs
lola: 3498887 markings, 27788166 edges, 94073 markings/sec, 35 secs
lola: 3852269 markings, 31132061 edges, 70676 markings/sec, 40 secs
lola: 4214588 markings, 34494140 edges, 72464 markings/sec, 45 secs
lola: 4575889 markings, 37844640 edges, 72260 markings/sec, 50 secs
lola: 5089568 markings, 41352065 edges, 102736 markings/sec, 55 secs
lola: 5473791 markings, 44819923 edges, 76845 markings/sec, 60 secs
lola: 5817585 markings, 48145246 edges, 68759 markings/sec, 65 secs
lola: 6183467 markings, 51426394 edges, 73176 markings/sec, 70 secs
lola: 6518480 markings, 54615948 edges, 67003 markings/sec, 75 secs
lola: 6958975 markings, 57919058 edges, 88099 markings/sec, 80 secs
lola: 7341622 markings, 61171726 edges, 76529 markings/sec, 85 secs
lola: 7696236 markings, 64492228 edges, 70923 markings/sec, 90 secs
lola: 8023043 markings, 67833877 edges, 65361 markings/sec, 95 secs
lola: 8523837 markings, 71525562 edges, 100159 markings/sec, 100 secs
lola: 8954691 markings, 74930456 edges, 86171 markings/sec, 105 secs
lola: 9359075 markings, 78192931 edges, 80877 markings/sec, 110 secs
lola: 9715006 markings, 81378959 edges, 71186 markings/sec, 115 secs
lola: 10071724 markings, 84410762 edges, 71344 markings/sec, 120 secs
lola: 10412507 markings, 87470744 edges, 68157 markings/sec, 125 secs
lola: 10784643 markings, 90643171 edges, 74427 markings/sec, 130 secs
lola: 11143857 markings, 93864640 edges, 71843 markings/sec, 135 secs
lola: 11538738 markings, 97237486 edges, 78976 markings/sec, 140 secs
lola: 11909349 markings, 100542636 edges, 74122 markings/sec, 145 secs
lola: 12249562 markings, 103661287 edges, 68043 markings/sec, 150 secs
lola: 12553428 markings, 106687529 edges, 60773 markings/sec, 155 secs
lola: 12866616 markings, 109671937 edges, 62638 markings/sec, 160 secs
lola: 13158990 markings, 112584444 edges, 58475 markings/sec, 165 secs
lola: 13475710 markings, 115604817 edges, 63344 markings/sec, 170 secs
lola: 13785814 markings, 118698139 edges, 62021 markings/sec, 175 secs
lola: 14162616 markings, 122050970 edges, 75360 markings/sec, 180 secs
lola: 14615226 markings, 125553092 edges, 90522 markings/sec, 185 secs
lola: 15040748 markings, 128967041 edges, 85104 markings/sec, 190 secs
lola: 15416488 markings, 132370782 edges, 75148 markings/sec, 195 secs
lola: 15786241 markings, 135902837 edges, 73951 markings/sec, 200 secs
lola: 16119580 markings, 139330340 edges, 66668 markings/sec, 205 secs
lola: 16465045 markings, 142766925 edges, 69093 markings/sec, 210 secs
lola: 16872861 markings, 146358141 edges, 81563 markings/sec, 215 secs
lola: 17260194 markings, 149913357 edges, 77467 markings/sec, 220 secs
lola: 17617446 markings, 153251885 edges, 71450 markings/sec, 225 secs
lola: 17985548 markings, 156718313 edges, 73620 markings/sec, 230 secs
lola: 18331332 markings, 160093015 edges, 69157 markings/sec, 235 secs
lola: 18618366 markings, 163029004 edges, 57407 markings/sec, 240 secs
lola: 18935212 markings, 166145702 edges, 63369 markings/sec, 245 secs
lola: 19223075 markings, 169145631 edges, 57573 markings/sec, 250 secs
lola: 19603978 markings, 172549428 edges, 76181 markings/sec, 255 secs
lola: 19947554 markings, 175853974 edges, 68715 markings/sec, 260 secs
lola: 20275324 markings, 179306231 edges, 65554 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((p161 <= 0) AND (p314 <= 1)) OR (((p5 <= 2) OR (p232 <= 2)) AND (p163 <= p105))) AND NOT((A (F ((3 <= p190))) OR A (G ((1 <= p216))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p161 <= 0) AND (p314 <= 1)) OR (((p5 <= 2) OR (p232 <= 2)) AND (p163 <= p105)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p161 <= 0) AND (p314 <= 1)) OR (((p5 <= 2) OR (p232 <= 2)) AND (p163 <= p105)))
lola: processed formula length: 84
lola: 7 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: processed formula with 5 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 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p190 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (3 <= p190)))
lola: processed formula length: 26
lola: 9 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: 45 markings, 44 edges
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p216 <= 0)))
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 40 bytes per marking, with 25 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 reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G ((p126 <= p146))) OR NOT((A (X ((p329 <= p142))) OR (p286 <= p61))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p126 <= p146)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p146 + 1 <= p126)))
lola: processed formula length: 33
lola: 7 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: 45 markings, 44 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((2 <= p45) AND (p68 <= p160))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U ((2 <= p45) AND (p68 <= p160))))))
lola: processed formula length: 60
lola: 2 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 45 markings, 45 edges
lola: ========================================
lola: subprocess 7 will run for 363 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (NOT(A (F ((p266 <= p306))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (p266 <= p306))))
lola: processed formula length: 39
lola: 6 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 45 markings, 89 edges
lola: ========================================
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (((p353 <= p256) U (2 <= p130)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E((p353 <= p256) U (2 <= p130)))
lola: processed formula length: 35
lola: 2 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: 725762 markings, 3407412 edges, 3689329903141912576 markings/sec, 0 secs
lola: 1376227 markings, 7105839 edges, 130093 markings/sec, 5 secs
lola: 1869591 markings, 10810671 edges, 98673 markings/sec, 10 secs
lola: 2420236 markings, 14551179 edges, 110129 markings/sec, 15 secs
lola: 3002565 markings, 18273772 edges, 116466 markings/sec, 20 secs
lola: 3658855 markings, 22077551 edges, 131258 markings/sec, 25 secs
lola: 4163758 markings, 25862546 edges, 100981 markings/sec, 30 secs
lola: 4619711 markings, 29402910 edges, 91191 markings/sec, 35 secs
lola: 5105888 markings, 33050330 edges, 97235 markings/sec, 40 secs
lola: 5535512 markings, 36563415 edges, 85925 markings/sec, 45 secs
lola: 6040842 markings, 40093010 edges, 101066 markings/sec, 50 secs
lola: 6475446 markings, 43542818 edges, 86921 markings/sec, 55 secs
lola: 6950663 markings, 47259470 edges, 95043 markings/sec, 60 secs
lola: 7374190 markings, 51060995 edges, 84705 markings/sec, 65 secs
lola: 7803215 markings, 54844615 edges, 85805 markings/sec, 70 secs
lola: 8241953 markings, 58517232 edges, 87748 markings/sec, 75 secs
lola: 8619457 markings, 62148027 edges, 75501 markings/sec, 80 secs
lola: 9037675 markings, 65523518 edges, 83644 markings/sec, 85 secs
lola: 9541511 markings, 69098671 edges, 100767 markings/sec, 90 secs
lola: 9929462 markings, 72606363 edges, 77590 markings/sec, 95 secs
lola: 10263851 markings, 76357262 edges, 66878 markings/sec, 100 secs
lola: 10541357 markings, 79929466 edges, 55501 markings/sec, 105 secs
lola: 10985174 markings, 83493167 edges, 88763 markings/sec, 110 secs
lola: 11396948 markings, 86863841 edges, 82355 markings/sec, 115 secs
lola: 11859346 markings, 90345588 edges, 92480 markings/sec, 120 secs
lola: 12209463 markings, 93655745 edges, 70023 markings/sec, 125 secs
lola: 12532960 markings, 97286790 edges, 64699 markings/sec, 130 secs
lola: 12822832 markings, 100866877 edges, 57974 markings/sec, 135 secs
lola: 13052789 markings, 104272740 edges, 45991 markings/sec, 140 secs
lola: 13432456 markings, 108009601 edges, 75933 markings/sec, 145 secs
lola: 13821588 markings, 111750201 edges, 77826 markings/sec, 150 secs
lola: 14103633 markings, 115523392 edges, 56409 markings/sec, 155 secs
lola: 14419359 markings, 119164212 edges, 63145 markings/sec, 160 secs
lola: 14735226 markings, 122837318 edges, 63173 markings/sec, 165 secs
lola: 15156232 markings, 126439547 edges, 84201 markings/sec, 170 secs
lola: 15457897 markings, 130068067 edges, 60333 markings/sec, 175 secs
lola: 15801794 markings, 133574564 edges, 68779 markings/sec, 180 secs
lola: 16190991 markings, 137216168 edges, 77839 markings/sec, 185 secs
lola: 16933607 markings, 141013387 edges, 148523 markings/sec, 190 secs
lola: 17408555 markings, 144593522 edges, 94990 markings/sec, 195 secs
lola: 17749165 markings, 148217419 edges, 68122 markings/sec, 200 secs
lola: 18127189 markings, 151710902 edges, 75605 markings/sec, 205 secs
lola: 18556702 markings, 155332088 edges, 85903 markings/sec, 210 secs
lola: 19077478 markings, 158907423 edges, 104155 markings/sec, 215 secs
lola: 19492759 markings, 162308820 edges, 83056 markings/sec, 220 secs
lola: 19869433 markings, 165771260 edges, 75335 markings/sec, 225 secs
lola: 20258919 markings, 169252236 edges, 77897 markings/sec, 230 secs
lola: 20636256 markings, 172649523 edges, 75467 markings/sec, 235 secs
lola: 20942865 markings, 176088934 edges, 61322 markings/sec, 240 secs
lola: 21313031 markings, 179402833 edges, 74033 markings/sec, 245 secs
lola: 21587327 markings, 182751336 edges, 54859 markings/sec, 250 secs
lola: 21883846 markings, 186188271 edges, 59304 markings/sec, 255 secs
lola: 22180596 markings, 189716847 edges, 59350 markings/sec, 260 secs
lola: 22508313 markings, 193194955 edges, 65543 markings/sec, 265 secs
lola: 22808009 markings, 196653010 edges, 59939 markings/sec, 270 secs
lola: 23365024 markings, 200198536 edges, 111403 markings/sec, 275 secs
lola: 23687623 markings, 203639844 edges, 64520 markings/sec, 280 secs
lola: 24303644 markings, 207236263 edges, 123204 markings/sec, 285 secs
lola: 24947894 markings, 210960326 edges, 128850 markings/sec, 290 secs
lola: 25415539 markings, 214611465 edges, 93529 markings/sec, 295 secs
lola: 25842577 markings, 218194059 edges, 85408 markings/sec, 300 secs
lola: 26345328 markings, 221842342 edges, 100550 markings/sec, 305 secs
lola: 26990877 markings, 225359846 edges, 129110 markings/sec, 310 secs
lola: 27457574 markings, 228849227 edges, 93339 markings/sec, 315 secs
lola: 27919096 markings, 232244758 edges, 92304 markings/sec, 320 secs
lola: 28340889 markings, 235685998 edges, 84359 markings/sec, 325 secs
lola: 28769213 markings, 239119793 edges, 85665 markings/sec, 330 secs
lola: 29170160 markings, 242449058 edges, 80189 markings/sec, 335 secs
lola: 29591289 markings, 245813446 edges, 84226 markings/sec, 340 secs
lola: 30019562 markings, 249197230 edges, 85655 markings/sec, 345 secs
lola: 30439463 markings, 252468224 edges, 83980 markings/sec, 350 secs
lola: 30940531 markings, 255615989 edges, 100214 markings/sec, 355 secs
lola: 31330900 markings, 258769314 edges, 78074 markings/sec, 360 secs
lola: 31717304 markings, 261859324 edges, 77281 markings/sec, 365 secs
lola: 32205332 markings, 265192164 edges, 97606 markings/sec, 370 secs
lola: 32614959 markings, 268497302 edges, 81925 markings/sec, 375 secs
lola: 33092037 markings, 271608513 edges, 95416 markings/sec, 380 secs
lola: 33501448 markings, 275044713 edges, 81882 markings/sec, 385 secs
lola: 34130778 markings, 278604259 edges, 125866 markings/sec, 390 secs
lola: 34579034 markings, 282312100 edges, 89651 markings/sec, 395 secs
lola: 35043236 markings, 285941304 edges, 92840 markings/sec, 400 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (F ((p306 <= p161))) U A (F ((2 <= p322)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(E(TRUE U (p306 <= p161)) U A(TRUE U (2 <= p322)))
lola: processed formula length: 51
lola: 3 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 45 markings, 178 edges
lola: ========================================
lola: subprocess 10 will run for 476 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((p180 <= p220)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (p220 + 1 <= p180))))
lola: processed formula length: 43
lola: 3 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 45 markings, 49 edges
lola: ========================================
lola: subprocess 11 will run for 571 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p110 <= p6) AND (E (G ((p198 <= 1))) OR (E (G ((3 <= p5))) AND ((p202 <= 1) AND (p293 + 1 <= p67)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 571 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p110 <= p6)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p110 <= p6)
lola: processed formula length: 12
lola: 0 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-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: subprocess 12 will run for 714 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p198 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (2 <= p198)))
lola: processed formula length: 26
lola: 2 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: 45 markings, 44 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 714 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G ((p340 <= p34))) OR A (F (E (G ((p27 <= p291))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 714 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p340 <= p34)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p34 + 1 <= p340)))
lola: processed formula length: 32
lola: 2 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 16786 markings, 66503 edges
lola: ========================================
lola: subprocess 13 will run for 953 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((p27 <= p291)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (p291 + 1 <= p27))))
lola: processed formula length: 42
lola: 3 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 45 markings, 45 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 953 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((p96 <= p183)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((p96 <= p183)))))
lola: processed formula length: 37
lola: 2 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 45 markings, 44 edges
lola: ========================================
lola: subprocess 14 will run for 1429 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (F ((p159 + 1 <= p156))) OR (A (F ((p311 <= p34))) AND E (G ((3 <= p0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1429 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p156 <= p159)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p159 + 1 <= p156)))
lola: processed formula length: 33
lola: 13 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: 45 markings, 44 edges
lola: ========================================
lola: subprocess 15 will run for 2859 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p34 + 1 <= p311)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p311 <= p34)))
lola: processed formula length: 28
lola: 13 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 2859 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (F (((1 <= p122) AND (3 <= p187)))) OR A (G ((p75 + 1 <= p122)))) AND (p1 <= p93))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2859 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p122) AND (3 <= p187))))
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 40 bytes per marking, with 25 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 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-60a-CTLCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-60a-CTLCardinality-15.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: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p1 <= p93)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p1 <= p93)
lola: processed formula length: 11
lola: 0 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-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: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no unknown yes yes no no unknown no yes yes yes no unknown unknown
FORMULA DES-PT-60a-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- 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="DES-PT-60a"
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/DES-PT-60a.tgz
mv DES-PT-60a 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 DES-PT-60a, 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 r054-smll-152646382300283"
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 ;