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 892K
-rw-r--r-- 1 mcc users 5.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 80K 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.0K 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 10K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 26K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.0K 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-full
Input is PermAdmissibility-PT-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-csrt-152666478500479
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527295922418


BK_STOP 1527296779528

--------------------
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-PT-02 as instance name.
Using PermAdmissibility as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', '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': 1698283, 'Memory': 15945.32, 'Tool': 'lola'}, {'Time': 1700645, 'Memory': 15946.14, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola PermAdmissibility-PT-02...

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


checking for too many tokens
===========================================================================================
PermAdmissibility-PT-02: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ PermAdmissibility-PT-02 @ 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: 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-02-CTLCardinality.task
lola: E (X ((((in1_0 + in1_1 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7) OR (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= aux7_2 + aux7_3 + aux7_6 + aux7_7) OR ((aux6_0 + aux6_1 + aux6_4 + aux6_5 <= c7) AND (2 <= c7))) AND A (F ((2 <= c20)))))) : E (G (((aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7 <= 0) OR (c16 <= 0) OR (3 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7)))) : (E (G (((in3_4 + in3_5 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7) OR (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= 1)))) AND E (X ((aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7)))) : A (F (((out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7 <= c6) AND (3 <= in2_2 + in2_3) AND (c19 + 1 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7) AND (3 <= c12) AND (3 <= c16) AND (c20 <= 1)))) : (NOT((E (F ((in2_2 + in2_3 <= aux7_2 + aux7_3 + aux7_6 + aux7_7))) AND A (X ((2 <= aux5_0 + aux5_1 + aux5_4 + aux5_5))))) OR (A (G (((2 <= c14) AND (c6 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7)))) OR E (G (((3 <= in2_2 + in2_3) OR (3 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7)))))) : E (G (E (F (((in2_2 + in2_3 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7) AND (c15 <= in3_4 + in3_5)))))) : E (G (NOT(A (G ((3 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7)))))) : NOT(A (F (A (G ((c9 <= in3_4 + in3_5)))))) : (((((out3_2 <= 2) AND (aux16_6 + 1 <= c15)) OR (2 <= out7_5)) AND A (F (((aux15_2 <= aux11_3) AND (2 <= out7_5))))) OR E (G (((aux16_6 <= 0) OR (out5_2 + 1 <= out6_7))))) : A ((A (X ((out8_5 <= c110))) U ((c17 + 1 <= aux5_1) OR (out7_6 + 1 <= aux5_4)))) : E (F ((A (F ((1 <= c19))) AND (aux13_0 + 1 <= out4_5)))) : NOT((A (F (((2 <= out6_0) OR (2 <= aux9_0)))) OR E (G ((aux10_3 + 1 <= out5_1))))) : A (X (A (F (((2 <= in1_1) AND (out6_6 <= out1_5)))))) : E (G ((out1_4 <= aux6_4))) : ((((1 <= out2_7) AND (aux7_3 <= aux11_2)) AND (E (F ((2 <= out7_6))) AND (3 <= aux6_1))) OR E (G (E (G ((c8 <= in4_6)))))) : A (F ((A (X ((3 <= aux13_7))) OR E (G ((out1_3 <= out4_2))))))
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 (X ((((in1_0 + in1_1 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7) OR (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= aux7_2 + aux7_3 + aux7_6 + aux7_7) OR ((aux6_0 + aux6_1 + aux6_4 + aux6_5 <= c7) AND (2 <= c7))) AND A (F ((2 <= c20))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((((in1_0 + in1_1 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7) OR (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= aux7_2 + aux7_3 + aux7_6 + aux7_7) OR ((aux6_0 + aux6_1 + aux6_4 + aux6_5 <= c7) AND (2 <= c7))) AND A(TRUE U (2 <= c20))))
lola: processed formula length: 304
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-02-CTLCardinality.task
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: 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: 38 markings, 40 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7 <= 0) OR (c16 <= 0) OR (3 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((1 <= aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7) AND (1 <= c16) AND (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= 2))))
lola: processed formula length: 205
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-02-CTLCardinality.task
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: 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: 64 markings, 63 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (((in3_4 + in3_5 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7) OR (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= 1)))) AND E (X ((aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((in3_4 + in3_5 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7) OR (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7 + 1 <= in3_4 + in3_5) AND (2 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7))))
lola: processed formula length: 198
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-02-CTLCardinality.task
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: 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: 33 markings, 32 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7))
lola: processed formula length: 156
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-02-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7 <= c6) AND (3 <= in2_2 + in2_3) AND (c19 + 1 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7) AND (3 <= c12) AND (3 <= c16) AND (c20 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7 <= c6) AND (3 <= in2_2 + in2_3) AND (c19 + 1 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7) AND (3 <= c12) AND (3 <= c16) AND (c20 <= 1))))
lola: processed formula: A (F (((out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7 <= c6) AND (3 <= in2_2 + in2_3) AND (c19 + 1 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7) AND (3 <= c12) AND (3 <= c16) AND (c20 <= 1))))
lola: processed formula length: 244
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-02-CTLCardinality.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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 33 markings, 33 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT((E (F ((in2_2 + in2_3 <= aux7_2 + aux7_3 + aux7_6 + aux7_7))) AND A (X ((2 <= aux5_0 + aux5_1 + aux5_4 + aux5_5))))) OR (A (G (((2 <= c14) AND (c6 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7)))) OR E (G (((3 <= in2_2 + in2_3) OR (3 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((aux7_2 + aux7_3 + aux7_6 + aux7_7 + 1 <= in2_2 + in2_3)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((aux5_0 + aux5_1 + aux5_4 + aux5_5 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((aux5_0 + aux5_1 + aux5_4 + aux5_5 <= 1))
lola: processed formula length: 44
lola: 9 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-02-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= c14) AND (c6 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((3 <= in2_2 + in2_3) OR (3 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((in2_2 + in2_3 <= 2) AND (out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7 <= 2))))
lola: processed formula length: 118
lola: 10 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-02-CTLCardinality.task
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: 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: 956 markings, 1276 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((in2_2 + in2_3 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7) AND (c15 <= in3_4 + in3_5))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U ((in2_2 + in2_3 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7) AND (c15 <= in3_4 + in3_5))))))
lola: processed formula length: 147
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-02-CTLCardinality.task
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: 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: 33 markings, 82 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT(A (G ((3 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= 2)))))
lola: processed formula length: 114
lola: 5 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-02-CTLCardinality.task
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: 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: 33 markings, 65 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (A (G ((c9 <= in3_4 + in3_5))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (in3_4 + in3_5 + 1 <= c9)))))
lola: processed formula length: 55
lola: 7 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-02-CTLCardinality.task
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: 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: 1017131 markings, 2684040 edges, 3689330178019819520 markings/sec, 0 secs
lola: 1956550 markings, 5427048 edges, 187884 markings/sec, 5 secs
lola: 2921233 markings, 7916252 edges, 192937 markings/sec, 10 secs
lola: 3847565 markings, 10227056 edges, 185266 markings/sec, 15 secs
lola: 4755059 markings, 12578447 edges, 181499 markings/sec, 20 secs
lola: 5627582 markings, 14790623 edges, 174505 markings/sec, 25 secs
lola: 6472563 markings, 16992997 edges, 168996 markings/sec, 30 secs
lola: 7335518 markings, 19280730 edges, 172591 markings/sec, 35 secs
lola: 8171926 markings, 21786637 edges, 167282 markings/sec, 40 secs
lola: 9011508 markings, 24412918 edges, 167916 markings/sec, 45 secs
lola: 9884614 markings, 26943191 edges, 174621 markings/sec, 50 secs
lola: 10726422 markings, 29732595 edges, 168362 markings/sec, 55 secs
lola: 11547485 markings, 32206949 edges, 164213 markings/sec, 60 secs
lola: 12361464 markings, 34285213 edges, 162796 markings/sec, 65 secs
lola: 13162769 markings, 36296951 edges, 160261 markings/sec, 70 secs
lola: 13968552 markings, 38345530 edges, 161157 markings/sec, 75 secs
lola: 14756918 markings, 40342658 edges, 157673 markings/sec, 80 secs
lola: 15573421 markings, 42325714 edges, 163301 markings/sec, 85 secs
lola: 16366414 markings, 44270154 edges, 158599 markings/sec, 90 secs
lola: 17180308 markings, 46188907 edges, 162779 markings/sec, 95 secs
lola: 18085397 markings, 48673793 edges, 181018 markings/sec, 100 secs
lola: 18949666 markings, 51081070 edges, 172854 markings/sec, 105 secs
lola: 19783832 markings, 53045583 edges, 166833 markings/sec, 110 secs
lola: 20646336 markings, 55547755 edges, 172501 markings/sec, 115 secs
lola: 21480614 markings, 58018967 edges, 166856 markings/sec, 120 secs
lola: 22314346 markings, 60530330 edges, 166746 markings/sec, 125 secs
lola: 23086709 markings, 62850422 edges, 154473 markings/sec, 130 secs
lola: 23865465 markings, 65181340 edges, 155751 markings/sec, 135 secs
lola: 24594316 markings, 67422919 edges, 145770 markings/sec, 140 secs
lola: 25347666 markings, 69670838 edges, 150670 markings/sec, 145 secs
lola: 26142752 markings, 72033108 edges, 159017 markings/sec, 150 secs
lola: 26941512 markings, 74378610 edges, 159752 markings/sec, 155 secs
lola: 27725818 markings, 76705602 edges, 156861 markings/sec, 160 secs
lola: 28475523 markings, 78988870 edges, 149941 markings/sec, 165 secs
lola: 29217156 markings, 81247585 edges, 148327 markings/sec, 170 secs
lola: 29948105 markings, 83483201 edges, 146190 markings/sec, 175 secs
lola: 30699616 markings, 85675751 edges, 150302 markings/sec, 180 secs
lola: 31570506 markings, 88030543 edges, 174178 markings/sec, 185 secs
lola: 32385392 markings, 90217551 edges, 162977 markings/sec, 190 secs
lola: 33191649 markings, 92459688 edges, 161251 markings/sec, 195 secs
lola: 34036406 markings, 94626831 edges, 168951 markings/sec, 200 secs
lola: 34874946 markings, 96806437 edges, 167708 markings/sec, 205 secs
lola: 35706174 markings, 99127512 edges, 166246 markings/sec, 210 secs
lola: 36554380 markings, 101456237 edges, 169641 markings/sec, 215 secs
lola: 37412725 markings, 103491725 edges, 171669 markings/sec, 220 secs
lola: 38251534 markings, 105611056 edges, 167762 markings/sec, 225 secs
lola: 39067442 markings, 107868177 edges, 163182 markings/sec, 230 secs
lola: 39824681 markings, 109847964 edges, 151448 markings/sec, 235 secs
lola: 40564761 markings, 111795592 edges, 148016 markings/sec, 240 secs
lola: 41311062 markings, 113663275 edges, 149260 markings/sec, 245 secs
lola: 42074051 markings, 115567724 edges, 152598 markings/sec, 250 secs
lola: 42839455 markings, 117371774 edges, 153081 markings/sec, 255 secs
lola: 43634706 markings, 119569225 edges, 159050 markings/sec, 260 secs
lola: 44440661 markings, 121852696 edges, 161191 markings/sec, 265 secs
lola: 45237118 markings, 124075174 edges, 159291 markings/sec, 270 secs
lola: 46129061 markings, 126485402 edges, 178389 markings/sec, 275 secs
lola: 47001027 markings, 128735134 edges, 174393 markings/sec, 280 secs
lola: 47872604 markings, 131111751 edges, 174315 markings/sec, 285 secs
lola: 48690072 markings, 133215949 edges, 163494 markings/sec, 290 secs
lola: 49471428 markings, 135434199 edges, 156271 markings/sec, 295 secs
lola: 50237897 markings, 137643198 edges, 153294 markings/sec, 300 secs
lola: 51019964 markings, 139630652 edges, 156413 markings/sec, 305 secs
lola: 51824857 markings, 141802701 edges, 160979 markings/sec, 310 secs
lola: 52574800 markings, 143748408 edges, 149989 markings/sec, 315 secs
lola: 53324407 markings, 145863469 edges, 149921 markings/sec, 320 secs
lola: 54043350 markings, 147876325 edges, 143789 markings/sec, 325 secs
lola: 54773006 markings, 149922828 edges, 145931 markings/sec, 330 secs
lola: 55564848 markings, 151928585 edges, 158368 markings/sec, 335 secs
lola: 56338088 markings, 154118276 edges, 154648 markings/sec, 340 secs
lola: 57118095 markings, 156188705 edges, 156001 markings/sec, 345 secs
lola: 57923523 markings, 158272732 edges, 161086 markings/sec, 350 secs
lola: 58714864 markings, 160348129 edges, 158268 markings/sec, 355 secs
lola: 59524234 markings, 162422161 edges, 161874 markings/sec, 360 secs
lola: 60280248 markings, 164495709 edges, 151203 markings/sec, 365 secs
lola: 61059894 markings, 166419867 edges, 155929 markings/sec, 370 secs
lola: 61779080 markings, 168416545 edges, 143837 markings/sec, 375 secs
lola: 62529864 markings, 170358098 edges, 150157 markings/sec, 380 secs
lola: 63248823 markings, 172297589 edges, 143792 markings/sec, 385 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((((out3_2 <= 2) AND (aux16_6 + 1 <= c15)) OR (2 <= out7_5)) AND A (F (((aux15_2 <= aux11_3) AND (2 <= out7_5))))) OR E (G (((aux16_6 <= 0) OR (out5_2 + 1 <= out6_7)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((out3_2 <= 2) AND (aux16_6 + 1 <= c15)) OR (2 <= out7_5))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((out3_2 <= 2) AND (aux16_6 + 1 <= c15)) OR (2 <= out7_5))
lola: processed formula length: 60
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-02-CTLCardinality.task
lola: processed formula with 3 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 9 will run for 449 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((aux16_6 <= 0) OR (out5_2 + 1 <= out6_7))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((1 <= aux16_6) AND (out6_7 <= out5_2))))
lola: processed formula length: 54
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-02-CTLCardinality.task
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: 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: 33 markings, 32 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 9 will run for 449 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A ((A (X ((out8_5 <= c110))) U ((c17 + 1 <= aux5_1) OR (out7_6 + 1 <= aux5_4))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(AX((out8_5 <= c110)) U ((c17 + 1 <= aux5_1) OR (out7_6 + 1 <= aux5_4)))
lola: processed formula length: 74
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-02-CTLCardinality.task
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: 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: 2365 markings, 2368 edges
lola: ========================================
lola: subprocess 10 will run for 524 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((A (F ((1 <= c19))) AND (aux13_0 + 1 <= out4_5))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (A(TRUE U (1 <= c19)) AND (aux13_0 + 1 <= out4_5)))
lola: processed formula length: 60
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-02-CTLCardinality.task
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: 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: 1284608 markings, 1836411 edges, 3689330178019819520 markings/sec, 0 secs
lola: 2384502 markings, 3455967 edges, 219979 markings/sec, 5 secs
lola: 3496359 markings, 5007193 edges, 222371 markings/sec, 10 secs
lola: 4625072 markings, 6588196 edges, 225743 markings/sec, 15 secs
lola: 5613873 markings, 8085051 edges, 197760 markings/sec, 20 secs
lola: 6619962 markings, 9537678 edges, 201218 markings/sec, 25 secs
lola: 7665224 markings, 11098793 edges, 209052 markings/sec, 30 secs
lola: 8704456 markings, 12589718 edges, 207846 markings/sec, 35 secs
lola: 9712810 markings, 14112948 edges, 201671 markings/sec, 40 secs
lola: 10738589 markings, 15598839 edges, 205156 markings/sec, 45 secs
lola: 11592856 markings, 17174122 edges, 170853 markings/sec, 50 secs
lola: 12434514 markings, 18925415 edges, 168332 markings/sec, 55 secs
lola: 13274121 markings, 20551326 edges, 167921 markings/sec, 60 secs
lola: 14040628 markings, 22130612 edges, 153301 markings/sec, 65 secs
lola: 14869418 markings, 23753910 edges, 165758 markings/sec, 70 secs
lola: 15689975 markings, 25334352 edges, 164111 markings/sec, 75 secs
lola: 16483575 markings, 26917548 edges, 158720 markings/sec, 80 secs
lola: 17458053 markings, 28518421 edges, 194896 markings/sec, 85 secs
lola: 18417706 markings, 29898692 edges, 191931 markings/sec, 90 secs
lola: 19453994 markings, 31283958 edges, 207258 markings/sec, 95 secs
lola: 20387581 markings, 32649929 edges, 186717 markings/sec, 100 secs
lola: 21333773 markings, 34007467 edges, 189238 markings/sec, 105 secs
lola: 22323301 markings, 35408412 edges, 197906 markings/sec, 110 secs
lola: 23307826 markings, 36810456 edges, 196905 markings/sec, 115 secs
lola: 24165588 markings, 38212368 edges, 171552 markings/sec, 120 secs
lola: 24997733 markings, 39751862 edges, 166429 markings/sec, 125 secs
lola: 25835278 markings, 41263425 edges, 167509 markings/sec, 130 secs
lola: 26656581 markings, 42719691 edges, 164261 markings/sec, 135 secs
lola: 27469021 markings, 44141494 edges, 162488 markings/sec, 140 secs
lola: 28292656 markings, 45681794 edges, 164727 markings/sec, 145 secs
lola: 29310770 markings, 47159259 edges, 203623 markings/sec, 150 secs
lola: 30240434 markings, 48541888 edges, 185933 markings/sec, 155 secs
lola: 31143585 markings, 49927065 edges, 180630 markings/sec, 160 secs
lola: 31997893 markings, 51386644 edges, 170862 markings/sec, 165 secs
lola: 32835795 markings, 52870563 edges, 167580 markings/sec, 170 secs
lola: 33794050 markings, 54291182 edges, 191651 markings/sec, 175 secs
lola: 34684643 markings, 55644396 edges, 178119 markings/sec, 180 secs
lola: 35524827 markings, 57049418 edges, 168037 markings/sec, 185 secs
lola: 36351289 markings, 58427809 edges, 165292 markings/sec, 190 secs
lola: 37202430 markings, 59883533 edges, 170228 markings/sec, 195 secs
lola: 38157086 markings, 61230898 edges, 190931 markings/sec, 200 secs
lola: 39119934 markings, 62533604 edges, 192570 markings/sec, 205 secs
lola: 40067018 markings, 63801179 edges, 189417 markings/sec, 210 secs
lola: 40965940 markings, 65069036 edges, 179784 markings/sec, 215 secs
lola: 41861181 markings, 66324499 edges, 179048 markings/sec, 220 secs
lola: 42726649 markings, 67670061 edges, 173094 markings/sec, 225 secs
lola: 43543885 markings, 69089319 edges, 163447 markings/sec, 230 secs
lola: 44375209 markings, 70450859 edges, 166265 markings/sec, 235 secs
lola: 45175915 markings, 71801989 edges, 160141 markings/sec, 240 secs
lola: 46085292 markings, 73061935 edges, 181875 markings/sec, 245 secs
lola: 46925962 markings, 74323259 edges, 168134 markings/sec, 250 secs
lola: 47676595 markings, 75635161 edges, 150127 markings/sec, 255 secs
lola: 48481318 markings, 77055100 edges, 160945 markings/sec, 260 secs
lola: 49472663 markings, 78455037 edges, 198269 markings/sec, 265 secs
lola: 50399280 markings, 79731817 edges, 185323 markings/sec, 270 secs
lola: 51323511 markings, 81031096 edges, 184846 markings/sec, 275 secs
lola: 52299087 markings, 82392554 edges, 195115 markings/sec, 280 secs
lola: 53277717 markings, 83747243 edges, 195726 markings/sec, 285 secs
lola: 54222842 markings, 85044163 edges, 189025 markings/sec, 290 secs
lola: 55208731 markings, 86363944 edges, 197178 markings/sec, 295 secs
lola: 56155262 markings, 87637493 edges, 189306 markings/sec, 300 secs
lola: 57006266 markings, 88899790 edges, 170201 markings/sec, 305 secs
lola: 57855991 markings, 90147056 edges, 169945 markings/sec, 310 secs
lola: 58711662 markings, 91364590 edges, 171134 markings/sec, 315 secs
lola: 59730095 markings, 92644560 edges, 203687 markings/sec, 320 secs
lola: 60644045 markings, 93958976 edges, 182790 markings/sec, 325 secs
lola: 61525781 markings, 95264675 edges, 176347 markings/sec, 330 secs
lola: 62407551 markings, 96517704 edges, 176354 markings/sec, 335 secs
lola: 63402509 markings, 97821644 edges, 198992 markings/sec, 340 secs
lola: 64320350 markings, 99182814 edges, 183568 markings/sec, 345 secs
lola: 65088098 markings, 100465104 edges, 153550 markings/sec, 350 secs
lola: 65625385 markings, 101332883 edges, 107457 markings/sec, 355 secs
lola: 65693686 markings, 101434563 edges, 13660 markings/sec, 360 secs
lola: 65697282 markings, 101440137 edges, 719 markings/sec, 365 secs
lola: 65699643 markings, 101444266 edges, 472 markings/sec, 370 secs
lola: 65699676 markings, 101444374 edges, 7 markings/sec, 375 secs
lola: 65699728 markings, 101444524 edges, 10 markings/sec, 380 secs
lola: lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 546 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (F (((2 <= out6_0) OR (2 <= aux9_0)))) OR E (G ((aux10_3 + 1 <= out5_1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 546 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((out6_0 <= 1) AND (aux9_0 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((2 <= out6_0) OR (2 <= aux9_0))))
lola: processed formula length: 48
lola: 9 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-02-CTLCardinality.task
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: 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: 33 markings, 32 edges
lola: ========================================
lola: subprocess 12 will run for 682 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((out5_1 <= aux10_3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((out5_1 <= aux10_3)))
lola: processed formula: A (F ((out5_1 <= aux10_3)))
lola: processed formula length: 27
lola: 7 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-02-CTLCardinality.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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 682 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (((2 <= in1_1) AND (out6_6 <= out1_5))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U ((2 <= in1_1) AND (out6_6 <= out1_5))))
lola: processed formula length: 51
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-02-CTLCardinality.task
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: 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: 32 markings, 31 edges
lola: ========================================
lola: subprocess 13 will run for 910 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((out1_4 <= aux6_4)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (aux6_4 + 1 <= out1_4)))
lola: processed formula length: 37
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-02-CTLCardinality.task
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: 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: 33 markings, 32 edges
lola: ========================================
lola: subprocess 14 will run for 1365 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((1 <= out2_7) AND (aux7_3 <= aux11_2)) AND (E (F ((2 <= out7_6))) AND (3 <= aux6_1))) OR E (G (E (G ((c8 <= in4_6))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1365 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((1 <= out2_7) AND (aux7_3 <= aux11_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= out2_7) AND (aux7_3 <= aux11_2))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-02-CTLCardinality.task
lola: processed formula with 2 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 15 will run for 2730 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (G ((c8 <= in4_6)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U A(TRUE U (in4_6 + 1 <= c8))))
lola: processed formula length: 42
lola: 4 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-02-CTLCardinality.task
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: 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: 33 markings, 97 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 2730 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (X ((3 <= aux13_7))) OR E (G ((out1_3 <= out4_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (AX((3 <= aux13_7)) OR NOT(A(TRUE U (out4_2 + 1 <= out1_3)))))
lola: processed formula length: 71
lola: 4 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-02-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
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: 33 markings, 33 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes no no yes yes unknown yes no unknown yes no yes yes yes
FORMULA PermAdmissibility-PT-02-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-02-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-02-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-02-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-02-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-02-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-02-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-02-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-02-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-02-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-02-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-02-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-02-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-02-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-02-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-02-CTLCardinality-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-02"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-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-PT-02.tgz
mv PermAdmissibility-PT-02 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-full"
echo " Input is PermAdmissibility-PT-02, 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 r118-csrt-152666478500479"
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 ;