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 868K
-rw-r--r-- 1 mcc users 5.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 90K 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 3.2K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 33K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 481K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is PermAdmissibility-PT-20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-csrt-152732587500143
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527831272670


BK_STOP 1527832311968

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using PermAdmissibility-PT-20 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': 1787034, 'Memory': 15950.71, 'Tool': 'lola'}, {'Time': 1798076, 'Memory': 15946.08, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola PermAdmissibility-PT-20...

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


checking for too many tokens
===========================================================================================
PermAdmissibility-PT-20: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ PermAdmissibility-PT-20 @ 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: 760/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 168 places, 592 transitions, 136 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 820 transition conflict sets
lola: TASK
lola: reading formula from PermAdmissibility-PT-20-LTLCardinality.task
lola: A ((X (X ((aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= c6))) U F (F ((c6 <= c16))))) : A (G (G (X (X ((1 <= c19)))))) : A (X (G (G ((2 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7))))) : A (((out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7) U (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= aux5_0 + aux5_1 + aux5_4 + aux5_5))) : A (X ((out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7 <= c16))) : A (X (F (X ((1 <= in2_2 + in2_3))))) : A ((X (X ((aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7 <= c110))) U (2 <= aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7))) : A (G ((3 <= c18))) : A (F (G (X (X ((aux9_7 <= out2_5)))))) : A ((3 <= c18)) : A (F ((X ((out1_0 <= aux5_4)) U (out3_0 <= aux15_3)))) : A ((aux11_7 <= in3_4)) : A (F ((aux11_0 <= aux8_7))) : A (G ((out8_2 <= out2_1))) : A (G (G ((out6_7 <= out1_5)))) : A ((((out6_0 <= out5_1) U (out2_1 <= out4_2)) U F ((aux7_6 <= aux6_4))))
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 ((X (X ((aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= c6))) U F (F ((c6 <= c16)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (X ((aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= c6))) U F ((c6 <= c16))))
lola: processed formula: A ((X (X ((aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= c6))) U F ((c6 <= c16))))
lola: processed formula length: 117
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 bytes per marking, with 31 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (X (X ((1 <= c19))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (X (X ((1 <= c19))))))
lola: processed formula: A (G (G (X (X ((1 <= c19))))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 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: 321 markings, 321 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (G ((2 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (G ((2 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7)))))
lola: processed formula: A (X (G (G ((2 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7)))))
lola: processed formula length: 100
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 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: 321 markings, 321 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7) U (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= aux5_0 + aux5_1 + aux5_4 + aux5_5)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7) U (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= aux5_0 + aux5_1 + aux5_4 + aux5_5)))
lola: processed formula: A (((out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7) U (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= aux5_0 + aux5_1 + aux5_4 + aux5_5)))
lola: processed formula length: 269
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 bytes per marking, with 30 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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7 <= c16)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7 <= c16)))
lola: processed formula: A (X ((out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7 <= c16)))
lola: processed formula length: 86
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 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 (X (F (X ((1 <= in2_2 + in2_3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (X ((1 <= in2_2 + in2_3)))))
lola: processed formula: A (X (F (X ((1 <= in2_2 + in2_3)))))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 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: 30 markings, 36 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (X ((aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7 <= c110))) U (2 <= aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (X ((aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7 <= c110))) U (2 <= aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7)))
lola: processed formula: A ((X (X ((aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7 <= c110))) U (2 <= aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7)))
lola: processed formula length: 188
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 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: 708 markings, 708 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= c18)))
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 544 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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (X (X ((aux9_7 <= out2_5))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X (X ((aux9_7 <= out2_5))))))
lola: processed formula: A (F (G (X (X ((aux9_7 <= out2_5))))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 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: 1041852 markings, 2907963 edges, 208370 markings/sec, 0 secs
lola: 1810251 markings, 6013767 edges, 153680 markings/sec, 5 secs
lola: 2606263 markings, 8895101 edges, 159202 markings/sec, 10 secs
lola: 3346745 markings, 11822198 edges, 148096 markings/sec, 15 secs
lola: 4284806 markings, 14546800 edges, 187612 markings/sec, 20 secs
lola: 5003346 markings, 17606506 edges, 143708 markings/sec, 25 secs
lola: 5706142 markings, 20652588 edges, 140559 markings/sec, 30 secs
lola: 6636398 markings, 23510514 edges, 186051 markings/sec, 35 secs
lola: 7333143 markings, 26621537 edges, 139349 markings/sec, 40 secs
lola: 8056077 markings, 29639653 edges, 144587 markings/sec, 45 secs
lola: 8863902 markings, 32442177 edges, 161565 markings/sec, 50 secs
lola: 9473324 markings, 35343120 edges, 121884 markings/sec, 55 secs
lola: 10082626 markings, 38249124 edges, 121860 markings/sec, 60 secs
lola: 10680083 markings, 41300783 edges, 119491 markings/sec, 65 secs
lola: 11273857 markings, 44286361 edges, 118755 markings/sec, 70 secs
lola: 11958718 markings, 47336702 edges, 136972 markings/sec, 75 secs
lola: 12542112 markings, 50350956 edges, 116679 markings/sec, 80 secs
lola: 13157983 markings, 53304817 edges, 123174 markings/sec, 85 secs
lola: 13818657 markings, 56509322 edges, 132135 markings/sec, 90 secs
lola: 14509412 markings, 59979380 edges, 138151 markings/sec, 95 secs
lola: 15241377 markings, 63287926 edges, 146393 markings/sec, 100 secs
lola: 16095987 markings, 66821455 edges, 170922 markings/sec, 105 secs
lola: 16927764 markings, 70273456 edges, 166355 markings/sec, 110 secs
lola: 17684187 markings, 73662779 edges, 151285 markings/sec, 115 secs
lola: 18521989 markings, 77209050 edges, 167560 markings/sec, 120 secs
lola: 19379938 markings, 80507434 edges, 171590 markings/sec, 125 secs
lola: 20045633 markings, 83558522 edges, 133139 markings/sec, 130 secs
lola: 20766945 markings, 86784511 edges, 144262 markings/sec, 135 secs
lola: 21429414 markings, 89729359 edges, 132494 markings/sec, 140 secs
lola: 22097343 markings, 92795863 edges, 133586 markings/sec, 145 secs
lola: 22765195 markings, 95789750 edges, 133570 markings/sec, 150 secs
lola: 23531785 markings, 98674786 edges, 153318 markings/sec, 155 secs
lola: 24199870 markings, 101630314 edges, 133617 markings/sec, 160 secs
lola: 24947131 markings, 105065012 edges, 149452 markings/sec, 165 secs
lola: 25689201 markings, 108362914 edges, 148414 markings/sec, 170 secs
lola: 26398006 markings, 111618636 edges, 141761 markings/sec, 175 secs
lola: 27119180 markings, 114804607 edges, 144235 markings/sec, 180 secs
lola: 27915706 markings, 117911206 edges, 159305 markings/sec, 185 secs
lola: 28595020 markings, 121062875 edges, 135863 markings/sec, 190 secs
lola: 29284250 markings, 124260247 edges, 137846 markings/sec, 195 secs
lola: 29948222 markings, 127322726 edges, 132794 markings/sec, 200 secs
lola: 30684987 markings, 130389934 edges, 147353 markings/sec, 205 secs
lola: 31470576 markings, 133668068 edges, 157118 markings/sec, 210 secs
lola: 32225177 markings, 136866556 edges, 150920 markings/sec, 215 secs
lola: 32938349 markings, 140005743 edges, 142634 markings/sec, 220 secs
lola: 33719709 markings, 143421586 edges, 156272 markings/sec, 225 secs
lola: 34541516 markings, 146855188 edges, 164361 markings/sec, 230 secs
lola: 35303717 markings, 150260836 edges, 152440 markings/sec, 235 secs
lola: 36031043 markings, 153493544 edges, 145465 markings/sec, 240 secs
lola: 36713184 markings, 156499754 edges, 136428 markings/sec, 245 secs
lola: 37356090 markings, 159476805 edges, 128581 markings/sec, 250 secs
lola: 37979091 markings, 162380973 edges, 124600 markings/sec, 255 secs
lola: 38631061 markings, 165369221 edges, 130394 markings/sec, 260 secs
lola: 39373885 markings, 168482224 edges, 148565 markings/sec, 265 secs
lola: 40031563 markings, 171425999 edges, 131536 markings/sec, 270 secs
lola: 40703358 markings, 174380000 edges, 134359 markings/sec, 275 secs
lola: 41390499 markings, 177414835 edges, 137428 markings/sec, 280 secs
lola: 42065930 markings, 180531526 edges, 135086 markings/sec, 285 secs
lola: 42758834 markings, 183749459 edges, 138581 markings/sec, 290 secs
lola: 43504365 markings, 187107070 edges, 149106 markings/sec, 295 secs
lola: 44257871 markings, 190421049 edges, 150701 markings/sec, 300 secs
lola: 44971465 markings, 193654625 edges, 142719 markings/sec, 305 secs
lola: 45664505 markings, 196831699 edges, 138608 markings/sec, 310 secs
lola: 46376522 markings, 200030191 edges, 142403 markings/sec, 315 secs
lola: 47038161 markings, 203128345 edges, 132328 markings/sec, 320 secs
lola: 47697056 markings, 206240260 edges, 131779 markings/sec, 325 secs
lola: 48317215 markings, 209355132 edges, 124032 markings/sec, 330 secs
lola: 49113378 markings, 212488324 edges, 159233 markings/sec, 335 secs
lola: 49866761 markings, 215372077 edges, 150677 markings/sec, 340 secs
lola: 50625981 markings, 218380911 edges, 151844 markings/sec, 345 secs
lola: 51365729 markings, 221385971 edges, 147950 markings/sec, 350 secs
lola: 52124766 markings, 224486376 edges, 151807 markings/sec, 355 secs
lola: 52874493 markings, 227570385 edges, 149945 markings/sec, 360 secs
lola: 53616288 markings, 230619061 edges, 148359 markings/sec, 365 secs
lola: 54285434 markings, 233456844 edges, 133829 markings/sec, 370 secs
lola: 55003592 markings, 236278525 edges, 143632 markings/sec, 375 secs
lola: 55721940 markings, 238993570 edges, 143670 markings/sec, 380 secs
lola: 56393421 markings, 241677023 edges, 134296 markings/sec, 385 secs
lola: 57055242 markings, 244337653 edges, 132364 markings/sec, 390 secs
lola: 57780281 markings, 247345500 edges, 145008 markings/sec, 395 secs
lola: 58585711 markings, 250511173 edges, 161086 markings/sec, 400 secs
lola: 59313680 markings, 253477653 edges, 145594 markings/sec, 405 secs
lola: 60077575 markings, 256590673 edges, 152779 markings/sec, 410 secs
lola: 60795495 markings, 259348823 edges, 143584 markings/sec, 415 secs
lola: 61510627 markings, 261954493 edges, 143026 markings/sec, 420 secs
lola: 62229515 markings, 264518753 edges, 143778 markings/sec, 425 secs
lola: 62909129 markings, 267138364 edges, 135923 markings/sec, 430 secs
lola: 63526880 markings, 269904370 edges, 123550 markings/sec, 435 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 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= c18))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= c18)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-20-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 10 will run for 516 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((X ((out1_0 <= aux5_4)) U (out3_0 <= aux15_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((X ((out1_0 <= aux5_4)) U (out3_0 <= aux15_3))))
lola: processed formula: A (F ((X ((out1_0 <= aux5_4)) U (out3_0 <= aux15_3))))
lola: processed formula length: 54
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 bytes per marking, with 31 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 619 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((aux11_7 <= in3_4))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (aux11_7 <= in3_4)
lola: processed formula length: 18
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-20-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 12 will run for 774 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((aux11_0 <= aux8_7)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((aux11_0 <= aux8_7)))
lola: processed formula: A (F ((aux11_0 <= aux8_7)))
lola: processed formula length: 27
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 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 13 will run for 1032 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((out8_2 <= out2_1)))
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 544 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: 957910 markings, 3207688 edges, 191582 markings/sec, 0 secs
lola: 1664434 markings, 5707934 edges, 141305 markings/sec, 5 secs
lola: 2386152 markings, 8516625 edges, 144344 markings/sec, 10 secs
lola: 3209804 markings, 11541565 edges, 164730 markings/sec, 15 secs
lola: 3935002 markings, 14370620 edges, 145040 markings/sec, 20 secs
lola: 4678635 markings, 17269225 edges, 148727 markings/sec, 25 secs
lola: 5387740 markings, 19816701 edges, 141821 markings/sec, 30 secs
lola: 6022494 markings, 22209641 edges, 126951 markings/sec, 35 secs
lola: 6672531 markings, 24623356 edges, 130007 markings/sec, 40 secs
lola: 7263117 markings, 27052042 edges, 118117 markings/sec, 45 secs
lola: 7935329 markings, 29652352 edges, 134442 markings/sec, 50 secs
lola: 8638701 markings, 32467278 edges, 140674 markings/sec, 55 secs
lola: 9446028 markings, 35398058 edges, 161465 markings/sec, 60 secs
lola: 10273928 markings, 38218232 edges, 165580 markings/sec, 65 secs
lola: 10969183 markings, 40850612 edges, 139051 markings/sec, 70 secs
lola: 11581803 markings, 43334816 edges, 122524 markings/sec, 75 secs
lola: 12223858 markings, 45895517 edges, 128411 markings/sec, 80 secs
lola: 12804103 markings, 48440293 edges, 116049 markings/sec, 85 secs
lola: 13466672 markings, 51049409 edges, 132514 markings/sec, 90 secs
lola: 14097896 markings, 53633890 edges, 126245 markings/sec, 95 secs
lola: 14744737 markings, 56257229 edges, 129368 markings/sec, 100 secs
lola: 15375077 markings, 58920159 edges, 126068 markings/sec, 105 secs
lola: 16048355 markings, 61612989 edges, 134656 markings/sec, 110 secs
lola: 16682508 markings, 64283039 edges, 126831 markings/sec, 115 secs
lola: 17375807 markings, 66866079 edges, 138660 markings/sec, 120 secs
lola: 18073575 markings, 69452647 edges, 139554 markings/sec, 125 secs
lola: 18679512 markings, 71756266 edges, 121187 markings/sec, 130 secs
lola: 19191933 markings, 74023001 edges, 102484 markings/sec, 135 secs
lola: 19712594 markings, 76275021 edges, 104132 markings/sec, 140 secs
lola: 20253023 markings, 78559840 edges, 108086 markings/sec, 145 secs
lola: 20702096 markings, 80784730 edges, 89815 markings/sec, 150 secs
lola: 21280037 markings, 83158447 edges, 115588 markings/sec, 155 secs
lola: 21831247 markings, 85504296 edges, 110242 markings/sec, 160 secs
lola: 22405011 markings, 88027248 edges, 114753 markings/sec, 165 secs
lola: 22989504 markings, 90535102 edges, 116899 markings/sec, 170 secs
lola: 23543845 markings, 92955507 edges, 110868 markings/sec, 175 secs
lola: 24175298 markings, 95357958 edges, 126291 markings/sec, 180 secs
lola: 24836400 markings, 97679449 edges, 132220 markings/sec, 185 secs
lola: 25436295 markings, 99924145 edges, 119979 markings/sec, 190 secs
lola: 26064872 markings, 102452688 edges, 125715 markings/sec, 195 secs
lola: 26714713 markings, 104864797 edges, 129968 markings/sec, 200 secs
lola: 27358986 markings, 107183541 edges, 128855 markings/sec, 205 secs
lola: 27904240 markings, 109485466 edges, 109051 markings/sec, 210 secs
lola: 28548185 markings, 111825474 edges, 128789 markings/sec, 215 secs
lola: 29053702 markings, 113944666 edges, 101103 markings/sec, 220 secs
lola: 29567101 markings, 116157106 edges, 102680 markings/sec, 225 secs
lola: 30050212 markings, 118446795 edges, 96622 markings/sec, 230 secs
lola: 30752268 markings, 121351310 edges, 140411 markings/sec, 235 secs
lola: 31297675 markings, 123813338 edges, 109081 markings/sec, 240 secs
lola: 32050448 markings, 126422460 edges, 150555 markings/sec, 245 secs
lola: 32684425 markings, 128791374 edges, 126795 markings/sec, 250 secs
lola: 33342635 markings, 131017539 edges, 131642 markings/sec, 255 secs
lola: 33949953 markings, 133263657 edges, 121464 markings/sec, 260 secs
lola: 34506077 markings, 135360812 edges, 111225 markings/sec, 265 secs
lola: 34995942 markings, 137553725 edges, 97973 markings/sec, 270 secs
lola: 35533151 markings, 139761593 edges, 107442 markings/sec, 275 secs
lola: 36088642 markings, 142020055 edges, 111098 markings/sec, 280 secs
lola: 36567411 markings, 144166122 edges, 95754 markings/sec, 285 secs
lola: 37209993 markings, 146549456 edges, 128516 markings/sec, 290 secs
lola: 37766320 markings, 148859901 edges, 111265 markings/sec, 295 secs
lola: 38316861 markings, 151353831 edges, 110108 markings/sec, 300 secs
lola: 39009360 markings, 154229783 edges, 138500 markings/sec, 305 secs
lola: 39680165 markings, 156886754 edges, 134161 markings/sec, 310 secs
lola: 40302273 markings, 159046312 edges, 124422 markings/sec, 315 secs
lola: 40869545 markings, 161142997 edges, 113454 markings/sec, 320 secs
lola: 41438602 markings, 163395182 edges, 113811 markings/sec, 325 secs
lola: 41919621 markings, 165500216 edges, 96204 markings/sec, 330 secs
lola: 42412234 markings, 167489296 edges, 98523 markings/sec, 335 secs
lola: 42918153 markings, 169595058 edges, 101184 markings/sec, 340 secs
lola: 43412571 markings, 171810904 edges, 98884 markings/sec, 345 secs
lola: 43838484 markings, 173852067 edges, 85183 markings/sec, 350 secs
lola: 44439738 markings, 176191665 edges, 120251 markings/sec, 355 secs
lola: 44982778 markings, 178546880 edges, 108608 markings/sec, 360 secs
lola: 45487924 markings, 180904350 edges, 101029 markings/sec, 365 secs
lola: 46020778 markings, 183376174 edges, 106571 markings/sec, 370 secs
lola: 46636936 markings, 186012608 edges, 123232 markings/sec, 375 secs
lola: 47211585 markings, 188167209 edges, 114930 markings/sec, 380 secs
lola: 47683077 markings, 190245765 edges, 94298 markings/sec, 385 secs
lola: 48130788 markings, 192296360 edges, 89542 markings/sec, 390 secs
lola: 48611827 markings, 194491893 edges, 96208 markings/sec, 395 secs
lola: 49172747 markings, 196893308 edges, 112184 markings/sec, 400 secs
lola: 49635272 markings, 198921875 edges, 92505 markings/sec, 405 secs
lola: 50073521 markings, 200871742 edges, 87650 markings/sec, 410 secs
lola: 50486616 markings, 202880236 edges, 82619 markings/sec, 415 secs
lola: 50926184 markings, 204992226 edges, 87914 markings/sec, 420 secs
lola: 51384272 markings, 207251835 edges, 91618 markings/sec, 425 secs
lola: 52013488 markings, 209395565 edges, 125843 markings/sec, 430 secs
lola: 52596793 markings, 211485462 edges, 116661 markings/sec, 435 secs
lola: 53114129 markings, 213680059 edges, 103467 markings/sec, 440 secs
lola: 53609805 markings, 215728336 edges, 99135 markings/sec, 445 secs
lola: 54073927 markings, 217843592 edges, 92824 markings/sec, 450 secs
lola: 54623927 markings, 220050588 edges, 110000 markings/sec, 455 secs
lola: 55151814 markings, 222245630 edges, 105577 markings/sec, 460 secs
lola: 55628992 markings, 224550373 edges, 95436 markings/sec, 465 secs
lola: 56176853 markings, 226806423 edges, 109572 markings/sec, 470 secs
lola: 56643344 markings, 228867654 edges, 93298 markings/sec, 475 secs
lola: 57110096 markings, 230867189 edges, 93350 markings/sec, 480 secs
lola: 57530338 markings, 232855564 edges, 84048 markings/sec, 485 secs
lola: 57946911 markings, 234899208 edges, 83315 markings/sec, 490 secs
lola: 58361846 markings, 236885120 edges, 82987 markings/sec, 495 secs
lola: 58489634 markings, 237395394 edges, 25558 markings/sec, 500 secs
lola: 58494452 markings, 237417515 edges, 964 markings/sec, 505 secs
lola: 58494825 markings, 237419846 edges, 75 markings/sec, 510 secs
lola: 58496877 markings, 237432289 edges, 410 markings/sec, 515 secs
lola: lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G ((out6_7 <= out1_5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G ((out6_7 <= out1_5))))
lola: processed formula: A (G (G ((out6_7 <= out1_5))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 bytes per marking, with 30 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: 321 markings, 321 edges
lola: ========================================
lola: subprocess 15 will run for 2545 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((out6_0 <= out5_1) U (out2_1 <= out4_2)) U F ((aux7_6 <= aux6_4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((out6_0 <= out5_1) U (out2_1 <= out4_2)) U F ((aux7_6 <= aux6_4))))
lola: processed formula: A ((((out6_0 <= out5_1) U (out2_1 <= out4_2)) U F ((aux7_6 <= aux6_4))))
lola: processed formula length: 72
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 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: RESULT
lola:
SUMMARY: yes no no yes yes yes no no unknown no yes yes yes unknown no yes
FORMULA PermAdmissibility-PT-20-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-LTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-LTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PermAdmissibility-PT-20"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="mcc4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-PT-20.tgz
mv PermAdmissibility-PT-20 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 mcc4mcc-structural"
echo " Input is PermAdmissibility-PT-20, 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 r263-csrt-152732587500143"
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 ;