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 204K
-rw-r--r-- 1 mcc users 3.3K 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.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.0K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.6K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.0K 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.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 37K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is PermAdmissibility-COL-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-csrt-152732584000129
=====================================================================

--------------------
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 PermAdmissibility-COL-10-LTLCardinality-00
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-01
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-02
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-03
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-04
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-05
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-06
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-07
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-08
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-09
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-10
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-11
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-12
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-13
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-14
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1527457046888


BK_STOP 1527458060438

--------------------
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 PermAdmissibility-COL-10 as instance name.
Using PermAdmissibility as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 1769493, 'Memory': 7934.23, 'Tool': 'lola'}, {'Time': 1770567, 'Memory': 11344.28, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
LTLCardinality lola PermAdmissibility-COL-10...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
PermAdmissibility-COL-10: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PermAdmissibility-COL-10: translating COL formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ PermAdmissibility-COL-10 @ 3540 seconds
----- Start make result stderr -----
----- 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: 1232/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 208 places, 1024 transitions, 177 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1460 transition conflict sets
lola: TASK
lola: reading formula from PermAdmissibility-COL-10-LTLCardinality.task
lola: A ((1 <= p79 + p78 + p77 + p76 + p75 + p74 + p73 + p80)) : A (X ((p79 + p78 + p77 + p76 + p75 + p74 + p73 + p80 <= p134))) : A (X (G (X (F ((2 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191)))))) : A (X (((2 <= p17) U G ((p17 <= p36))))) : A (X (F (F ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191))))) : A ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p99 <= p34)) : A ((p90 <= p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166)) : A (X (G (F ((1 <= p90))))) : A ((((1 <= p34) U (2 <= p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150)) U G (G ((1 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15))))) : A (G ((3 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25))) : A ((p134 <= p71)) : A (F ((2 <= p81))) : A (X ((p72 <= p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183))) : A (((2 <= p71) U F ((p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 <= p79 + p78 + p77 + p76 + p75 + p74 + p73 + p80)))) : A (X (F (G ((2 <= p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123))))) : A (X (G (G ((1 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= p79 + p78 + p77 + p76 + p75 + p74 + p73 + p80))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p79 + p78 + p77 + p76 + p75 + p74 + p73 + p80)
lola: processed formula length: 52
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p79 + p78 + p77 + p76 + p75 + p74 + p73 + p80 <= p134)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((p79 + p78 + p77 + p76 + p75 + p74 + p73 + p80 <= p134)))
lola: processed formula: A (X ((p79 + p78 + p77 + p76 + p75 + p74 + p73 + p80 <= p134)))
lola: processed formula length: 63
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (X (F ((2 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (X (F ((2 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191))))))
lola: processed formula: A (X (G (X (F ((2 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191))))))
lola: processed formula length: 80
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 261 markings, 261 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((2 <= p17) U G ((p17 <= p36)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((2 <= p17) U G ((p17 <= p36)))))
lola: processed formula: A (X (((2 <= p17) U G ((p17 <= p36)))))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 161 markings, 161 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (F ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191))))
lola: processed formula: A (X (F ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191))))
lola: processed formula length: 108
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p99 <= p34))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p99 <= p34)
lola: processed formula length: 61
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p90 <= p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p90 <= p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166)
lola: processed formula length: 62
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (F ((1 <= p90)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (F ((1 <= p90)))))
lola: processed formula: A (X (G (F ((1 <= p90)))))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1032562 markings, 1103219 edges, 206512 markings/sec, 0 secs
lola: 2064153 markings, 2229166 edges, 206318 markings/sec, 5 secs
lola: 3164758 markings, 3417682 edges, 220121 markings/sec, 10 secs
lola: 4267703 markings, 4600642 edges, 220589 markings/sec, 15 secs
lola: 5297730 markings, 5714282 edges, 206005 markings/sec, 20 secs
lola: 6323649 markings, 6819083 edges, 205184 markings/sec, 25 secs
lola: 7274510 markings, 7837563 edges, 190172 markings/sec, 30 secs
lola: 8232221 markings, 8867065 edges, 191542 markings/sec, 35 secs
lola: 9211180 markings, 9912885 edges, 195792 markings/sec, 40 secs
lola: 10155497 markings, 10928178 edges, 188863 markings/sec, 45 secs
lola: 11095162 markings, 11928964 edges, 187933 markings/sec, 50 secs
lola: 12012818 markings, 12924726 edges, 183531 markings/sec, 55 secs
lola: 12923731 markings, 13902406 edges, 182183 markings/sec, 60 secs
lola: 13922472 markings, 14978116 edges, 199748 markings/sec, 65 secs
lola: 14838377 markings, 15959966 edges, 183181 markings/sec, 70 secs
lola: 15859548 markings, 17058487 edges, 204234 markings/sec, 75 secs
lola: 16923159 markings, 18207766 edges, 212722 markings/sec, 80 secs
lola: 17891451 markings, 19247526 edges, 193658 markings/sec, 85 secs
lola: 18857482 markings, 20286126 edges, 193206 markings/sec, 90 secs
lola: 19821732 markings, 21321565 edges, 192850 markings/sec, 95 secs
lola: 20780202 markings, 22365413 edges, 191694 markings/sec, 100 secs
lola: 21664593 markings, 23332887 edges, 176878 markings/sec, 105 secs
lola: 22622812 markings, 24372579 edges, 191644 markings/sec, 110 secs
lola: 23567573 markings, 25402648 edges, 188952 markings/sec, 115 secs
lola: 24502118 markings, 26414796 edges, 186909 markings/sec, 120 secs
lola: 25496795 markings, 27501284 edges, 198935 markings/sec, 125 secs
lola: 26433286 markings, 28541108 edges, 187298 markings/sec, 130 secs
lola: 27293309 markings, 29505946 edges, 172005 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 424 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p34) U (2 <= p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150)) U G (G ((1 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((1 <= p34) U (2 <= p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150)) U G (G ((1 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15)))))
lola: processed formula: A ((((1 <= p34) U (2 <= p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150)) U G (G ((1 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15)))))
lola: processed formula length: 142
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 29 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: 161 markings, 161 edges
lola: subprocess 9 will run for 484 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 565 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p134 <= p71))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p134 <= p71)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.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: ========================================
lola: subprocess 11 will run for 678 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p81)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= p81)))
lola: processed formula: A (F ((2 <= p81)))
lola: processed formula length: 18
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 31 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: 185 markings, 185 edges
lola: ========================================
lola: subprocess 12 will run for 848 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p72 <= p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((p72 <= p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183)))
lola: processed formula: A (X ((p72 <= p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183)))
lola: processed formula length: 70
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 13 will run for 1131 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((2 <= p71) U F ((p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 <= p79 + p78 + p77 + p76 + p75 + p74 + p73 + p80))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((2 <= p71) U F ((p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 <= p79 + p78 + p77 + p76 + p75 + p74 + p73 + p80))))
lola: processed formula: A (((2 <= p71) U F ((p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 <= p79 + p78 + p77 + p76 + p75 + p74 + p73 + p80))))
lola: processed formula length: 127
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 31 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1697 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (G ((2 <= p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (G ((2 <= p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123)))))
lola: processed formula: A (X (F (G ((2 <= p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123)))))
lola: processed formula length: 76
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 407344 markings, 3486991 edges, 81469 markings/sec, 0 secs
lola: 780476 markings, 7029872 edges, 74626 markings/sec, 5 secs
lola: 1098292 markings, 10432817 edges, 63563 markings/sec, 10 secs
lola: 1411775 markings, 13871645 edges, 62697 markings/sec, 15 secs
lola: 1706373 markings, 17200224 edges, 58920 markings/sec, 20 secs
lola: 2051687 markings, 20607746 edges, 69063 markings/sec, 25 secs
lola: 2320777 markings, 23739716 edges, 53818 markings/sec, 30 secs
lola: 2593891 markings, 26864207 edges, 54623 markings/sec, 35 secs
lola: 2934231 markings, 30320760 edges, 68068 markings/sec, 40 secs
lola: 3246655 markings, 33765738 edges, 62485 markings/sec, 45 secs
lola: 3556777 markings, 37241995 edges, 62024 markings/sec, 50 secs
lola: 3832079 markings, 40558026 edges, 55060 markings/sec, 55 secs
lola: 4137923 markings, 43952028 edges, 61169 markings/sec, 60 secs
lola: 4404716 markings, 47170469 edges, 53359 markings/sec, 65 secs
lola: 4657164 markings, 50311158 edges, 50490 markings/sec, 70 secs
lola: 4953399 markings, 53683318 edges, 59247 markings/sec, 75 secs
lola: 5214633 markings, 56902245 edges, 52247 markings/sec, 80 secs
lola: 5477711 markings, 60114255 edges, 52616 markings/sec, 85 secs
lola: 5724203 markings, 63321790 edges, 49298 markings/sec, 90 secs
lola: 6053747 markings, 66604443 edges, 65909 markings/sec, 95 secs
lola: 6338038 markings, 69736706 edges, 56858 markings/sec, 100 secs
lola: 6616148 markings, 72902657 edges, 55622 markings/sec, 105 secs
lola: 6896297 markings, 76181538 edges, 56030 markings/sec, 110 secs
lola: 7151899 markings, 79305637 edges, 51120 markings/sec, 115 secs
lola: 7394693 markings, 82350848 edges, 48559 markings/sec, 120 secs
lola: 7651642 markings, 85363322 edges, 51390 markings/sec, 125 secs
lola: 7888438 markings, 88355168 edges, 47359 markings/sec, 130 secs
lola: 8140191 markings, 91410042 edges, 50351 markings/sec, 135 secs
lola: 8466009 markings, 94725235 edges, 65164 markings/sec, 140 secs
lola: 8761138 markings, 97985467 edges, 59026 markings/sec, 145 secs
lola: 9031738 markings, 101184080 edges, 54120 markings/sec, 150 secs
lola: 9315176 markings, 104386303 edges, 56688 markings/sec, 155 secs
lola: 9572670 markings, 107487233 edges, 51499 markings/sec, 160 secs
lola: 9810471 markings, 110494507 edges, 47560 markings/sec, 165 secs
lola: 10114374 markings, 113864977 edges, 60781 markings/sec, 170 secs
lola: 10367462 markings, 117053070 edges, 50618 markings/sec, 175 secs
lola: 10617397 markings, 120138816 edges, 49987 markings/sec, 180 secs
lola: 10847656 markings, 123172428 edges, 46052 markings/sec, 185 secs
lola: 11123852 markings, 126308238 edges, 55239 markings/sec, 190 secs
lola: 11378313 markings, 129351045 edges, 50892 markings/sec, 195 secs
lola: 11628835 markings, 132445763 edges, 50104 markings/sec, 200 secs
lola: 11862617 markings, 135526202 edges, 46756 markings/sec, 205 secs
lola: 12098791 markings, 138474179 edges, 47235 markings/sec, 210 secs
lola: 12356428 markings, 141596008 edges, 51527 markings/sec, 215 secs
lola: 12616134 markings, 144755451 edges, 51941 markings/sec, 220 secs
lola: 12871086 markings, 147854761 edges, 50990 markings/sec, 225 secs
lola: 13093222 markings, 150818905 edges, 44427 markings/sec, 230 secs
lola: 13338274 markings, 153890753 edges, 49010 markings/sec, 235 secs
lola: 13566477 markings, 156860681 edges, 45641 markings/sec, 240 secs
lola: 13783989 markings, 159784442 edges, 43502 markings/sec, 245 secs
lola: 14054766 markings, 162848498 edges, 54155 markings/sec, 250 secs
lola: 14343472 markings, 165872434 edges, 57741 markings/sec, 255 secs
lola: 14618582 markings, 168891593 edges, 55022 markings/sec, 260 secs
lola: 14873890 markings, 171893083 edges, 51062 markings/sec, 265 secs
lola: 15127768 markings, 174928055 edges, 50776 markings/sec, 270 secs
lola: 15383861 markings, 177966399 edges, 51219 markings/sec, 275 secs
lola: 15608720 markings, 180903356 edges, 44972 markings/sec, 280 secs
lola: 15885476 markings, 183901417 edges, 55351 markings/sec, 285 secs
lola: 16129586 markings, 186829780 edges, 48822 markings/sec, 290 secs
lola: 16361941 markings, 189747179 edges, 46471 markings/sec, 295 secs
lola: 16590120 markings, 192650204 edges, 45636 markings/sec, 300 secs
lola: 16827296 markings, 195639196 edges, 47435 markings/sec, 305 secs
lola: 17066816 markings, 198677833 edges, 47904 markings/sec, 310 secs
lola: 17315606 markings, 201743790 edges, 49758 markings/sec, 315 secs
lola: 17557363 markings, 204836204 edges, 48351 markings/sec, 320 secs
lola: 17779108 markings, 207803320 edges, 44349 markings/sec, 325 secs
lola: 18079635 markings, 211052702 edges, 60105 markings/sec, 330 secs
lola: 18407273 markings, 214543186 edges, 65528 markings/sec, 335 secs
lola: 18697853 markings, 217756493 edges, 58116 markings/sec, 340 secs
lola: 18955162 markings, 220810461 edges, 51462 markings/sec, 345 secs
lola: 19247405 markings, 224095065 edges, 58449 markings/sec, 350 secs
lola: 19511720 markings, 227359673 edges, 52863 markings/sec, 355 secs
lola: 19782500 markings, 230681514 edges, 54156 markings/sec, 360 secs
lola: 20027061 markings, 233868145 edges, 48912 markings/sec, 365 secs
lola: 20327870 markings, 237169278 edges, 60162 markings/sec, 370 secs
lola: 20594089 markings, 240392984 edges, 53244 markings/sec, 375 secs
lola: 20833741 markings, 243405008 edges, 47930 markings/sec, 380 secs
lola: 21072087 markings, 246436369 edges, 47669 markings/sec, 385 secs
lola: 21352570 markings, 249673980 edges, 56097 markings/sec, 390 secs
lola: 21603792 markings, 252816371 edges, 50244 markings/sec, 395 secs
lola: 21842614 markings, 255832687 edges, 47764 markings/sec, 400 secs
lola: 22066997 markings, 258836090 edges, 44877 markings/sec, 405 secs
lola: 22323919 markings, 261988929 edges, 51384 markings/sec, 410 secs
lola: 22548480 markings, 265001593 edges, 44912 markings/sec, 415 secs
lola: 22782789 markings, 268094996 edges, 46862 markings/sec, 420 secs
lola: 23062369 markings, 271116779 edges, 55916 markings/sec, 425 secs
lola: 23307414 markings, 274109076 edges, 49009 markings/sec, 430 secs
lola: 23554799 markings, 277200472 edges, 49477 markings/sec, 435 secs
lola: 23794429 markings, 280232933 edges, 47926 markings/sec, 440 secs
lola: 24022209 markings, 283192603 edges, 45556 markings/sec, 445 secs
lola: 24247919 markings, 286154437 edges, 45142 markings/sec, 450 secs
lola: 24531610 markings, 289529161 edges, 56738 markings/sec, 455 secs
lola: 24796315 markings, 292810870 edges, 52941 markings/sec, 460 secs
lola: 25044217 markings, 295982003 edges, 49580 markings/sec, 465 secs
lola: 25298901 markings, 299241148 edges, 50937 markings/sec, 470 secs
lola: 25532223 markings, 302251554 edges, 46664 markings/sec, 475 secs
lola: 25752780 markings, 305225552 edges, 44111 markings/sec, 480 secs
lola: 25995152 markings, 308233606 edges, 48474 markings/sec, 485 secs
lola: 26217576 markings, 311163593 edges, 44485 markings/sec, 490 secs
lola: 26437347 markings, 314127300 edges, 43954 markings/sec, 495 secs
lola: 26707783 markings, 317135860 edges, 54087 markings/sec, 500 secs
lola: 26998307 markings, 320158649 edges, 58105 markings/sec, 505 secs
lola: 27266939 markings, 323129569 edges, 53726 markings/sec, 510 secs
lola: 27516723 markings, 326137255 edges, 49957 markings/sec, 515 secs
lola: 27779134 markings, 329119887 edges, 52482 markings/sec, 520 secs
lola: 28034337 markings, 332060129 edges, 51041 markings/sec, 525 secs
lola: 28273929 markings, 334993723 edges, 47918 markings/sec, 530 secs
lola: 28508538 markings, 337925241 edges, 46922 markings/sec, 535 secs
lola: 28758136 markings, 340909921 edges, 49920 markings/sec, 540 secs
lola: 28985035 markings, 343787400 edges, 45380 markings/sec, 545 secs
lola: 29206960 markings, 346724719 edges, 44385 markings/sec, 550 secs
lola: 29472175 markings, 349658403 edges, 53043 markings/sec, 555 secs
lola: 29711632 markings, 352591353 edges, 47891 markings/sec, 560 secs
lola: 29950458 markings, 355478388 edges, 47765 markings/sec, 565 secs
lola: 30181703 markings, 358376949 edges, 46249 markings/sec, 570 secs
lola: 30411105 markings, 361277821 edges, 45880 markings/sec, 575 secs
lola: 30649564 markings, 364297737 edges, 47692 markings/sec, 580 secs
lola: 30886947 markings, 367307056 edges, 47477 markings/sec, 585 secs
lola: 31122945 markings, 370262861 edges, 47200 markings/sec, 590 secs
lola: 31348097 markings, 373179956 edges, 45030 markings/sec, 595 secs
lola: 31579673 markings, 376146345 edges, 46315 markings/sec, 600 secs
lola: 31803373 markings, 379172028 edges, 44740 markings/sec, 605 secs
lola: 32153827 markings, 382499753 edges, 70091 markings/sec, 610 secs
lola: 32473382 markings, 385853909 edges, 63911 markings/sec, 615 secs
lola: 32747812 markings, 389085464 edges, 54886 markings/sec, 620 secs
lola: 33001074 markings, 392213922 edges, 50652 markings/sec, 625 secs
lola: 33292011 markings, 395338505 edges, 58187 markings/sec, 630 secs
lola: 33542509 markings, 398355955 edges, 50100 markings/sec, 635 secs
lola: 33819054 markings, 401570830 edges, 55309 markings/sec, 640 secs
lola: 34086867 markings, 404817613 edges, 53563 markings/sec, 645 secs
lola: 34333197 markings, 407845671 edges, 49266 markings/sec, 650 secs
lola: 34563188 markings, 410824526 edges, 45998 markings/sec, 655 secs
lola: 34803773 markings, 413759302 edges, 48117 markings/sec, 660 secs
lola: 35020275 markings, 416627711 edges, 43300 markings/sec, 665 secs
lola: 35268950 markings, 419609530 edges, 49735 markings/sec, 670 secs
lola: 35519049 markings, 422438275 edges, 50020 markings/sec, 675 secs
lola: 35760492 markings, 425299192 edges, 48289 markings/sec, 680 secs
lola: 35976624 markings, 428134477 edges, 43226 markings/sec, 685 secs
lola: 36207172 markings, 430985912 edges, 46110 markings/sec, 690 secs
lola: 36456501 markings, 433998409 edges, 49866 markings/sec, 695 secs
lola: 36705003 markings, 437028883 edges, 49700 markings/sec, 700 secs
lola: 36946348 markings, 440018493 edges, 48269 markings/sec, 705 secs
lola: 37172683 markings, 443013255 edges, 45267 markings/sec, 710 secs
lola: 37411091 markings, 445950577 edges, 47682 markings/sec, 715 secs
lola: 37624346 markings, 448823514 edges, 42651 markings/sec, 720 secs
lola: 37854752 markings, 451747646 edges, 46081 markings/sec, 725 secs
lola: 38081281 markings, 454613454 edges, 45306 markings/sec, 730 secs
lola: 38291488 markings, 457443894 edges, 42041 markings/sec, 735 secs
lola: 38533583 markings, 460407868 edges, 48419 markings/sec, 740 secs
lola: 38793291 markings, 463294964 edges, 51942 markings/sec, 745 secs
lola: 39025377 markings, 466188703 edges, 46417 markings/sec, 750 secs
lola: 39252470 markings, 469037523 edges, 45419 markings/sec, 755 secs
lola: 39485003 markings, 471874818 edges, 46507 markings/sec, 760 secs
lola: 39705098 markings, 474755984 edges, 44019 markings/sec, 765 secs
lola: 39943190 markings, 477752433 edges, 47618 markings/sec, 770 secs
lola: 40210898 markings, 480963682 edges, 53542 markings/sec, 775 secs
lola: 40462775 markings, 484053493 edges, 50375 markings/sec, 780 secs
lola: 40693861 markings, 487057472 edges, 46217 markings/sec, 785 secs
lola: 40937929 markings, 490100364 edges, 48814 markings/sec, 790 secs
lola: 41166830 markings, 493163692 edges, 45780 markings/sec, 795 secs
lola: 41405538 markings, 496109073 edges, 47742 markings/sec, 800 secs
lola: 41633740 markings, 499112236 edges, 45640 markings/sec, 805 secs
lola: 41830859 markings, 501771788 edges, 39424 markings/sec, 810 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 2570 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (G ((1 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (G ((1 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191)))))
lola: processed formula: A (X (G (G ((1 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191)))))
lola: processed formula length: 76
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 161 markings, 161 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no yes yes yes unknown no no yes no yes yes unknown no
FORMULA PermAdmissibility-COL-10-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- 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="PermAdmissibility-COL-10"
export BK_EXAMINATION="LTLCardinality"
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/PermAdmissibility-COL-10.tgz
mv PermAdmissibility-COL-10 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 PermAdmissibility-COL-10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r258-csrt-152732584000129"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;