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 irma4mcc-structural
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 r115-csrt-152666474100479
=====================================================================

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


BK_STOP 1527154819872

--------------------
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-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': 'itstools'}].
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: 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: ========================================
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: 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
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: 1047066 markings, 2768490 edges, 3689329903141912576 markings/sec, 0 secs
lola: 1970415 markings, 5459026 edges, 184670 markings/sec, 5 secs
lola: 2901349 markings, 7863345 edges, 186187 markings/sec, 10 secs
lola: 3815889 markings, 10152547 edges, 182908 markings/sec, 15 secs
lola: 4684235 markings, 12413263 edges, 173669 markings/sec, 20 secs
lola: 5558591 markings, 14634877 edges, 174871 markings/sec, 25 secs
lola: 6413429 markings, 16814300 edges, 170968 markings/sec, 30 secs
lola: 7281260 markings, 19134742 edges, 173566 markings/sec, 35 secs
lola: 8132872 markings, 21655830 edges, 170322 markings/sec, 40 secs
lola: 8975603 markings, 24298894 edges, 168546 markings/sec, 45 secs
lola: 9813204 markings, 26728397 edges, 167520 markings/sec, 50 secs
lola: 10625995 markings, 29397680 edges, 162558 markings/sec, 55 secs
lola: 11439407 markings, 31944348 edges, 162682 markings/sec, 60 secs
lola: 12326702 markings, 34190382 edges, 177459 markings/sec, 65 secs
lola: 13190732 markings, 36374462 edges, 172806 markings/sec, 70 secs
lola: 14051225 markings, 38556129 edges, 172099 markings/sec, 75 secs
lola: 14891582 markings, 40710250 edges, 168071 markings/sec, 80 secs
lola: 15769076 markings, 42771168 edges, 175499 markings/sec, 85 secs
lola: 16620369 markings, 44847113 edges, 170259 markings/sec, 90 secs
lola: 17496099 markings, 47064395 edges, 175146 markings/sec, 95 secs
lola: 18407861 markings, 49508356 edges, 182352 markings/sec, 100 secs
lola: 19280605 markings, 51892973 edges, 174549 markings/sec, 105 secs
lola: 20150805 markings, 54053340 edges, 174040 markings/sec, 110 secs
lola: 21011813 markings, 56601422 edges, 172202 markings/sec, 115 secs
lola: 21847587 markings, 59130827 edges, 167155 markings/sec, 120 secs
lola: 22650126 markings, 61505343 edges, 160508 markings/sec, 125 secs
lola: 23444400 markings, 63967109 edges, 158855 markings/sec, 130 secs
lola: 24240001 markings, 66319319 edges, 159120 markings/sec, 135 secs
lola: 24994935 markings, 68633543 edges, 150987 markings/sec, 140 secs
lola: 25830090 markings, 71075132 edges, 167031 markings/sec, 145 secs
lola: 26679280 markings, 73600855 edges, 169838 markings/sec, 150 secs
lola: 27535185 markings, 76146414 edges, 171181 markings/sec, 155 secs
lola: 28322740 markings, 78482322 edges, 157511 markings/sec, 160 secs
lola: 29073351 markings, 80822601 edges, 150122 markings/sec, 165 secs
lola: 29844257 markings, 83116031 edges, 154181 markings/sec, 170 secs
lola: 30593081 markings, 85383540 edges, 149765 markings/sec, 175 secs
lola: 31504007 markings, 87865947 edges, 182185 markings/sec, 180 secs
lola: 32347310 markings, 90130489 edges, 168661 markings/sec, 185 secs
lola: 33190360 markings, 92453240 edges, 168610 markings/sec, 190 secs
lola: 34071183 markings, 94732412 edges, 176165 markings/sec, 195 secs
lola: 34925785 markings, 96971111 edges, 170920 markings/sec, 200 secs
lola: 35749832 markings, 99253539 edges, 164809 markings/sec, 205 secs
lola: 36579249 markings, 101506205 edges, 165883 markings/sec, 210 secs
lola: 37430770 markings, 103541972 edges, 170304 markings/sec, 215 secs
lola: 38285229 markings, 105719594 edges, 170892 markings/sec, 220 secs
lola: 39115458 markings, 108003289 edges, 166046 markings/sec, 225 secs
lola: 39947523 markings, 110140574 edges, 166413 markings/sec, 230 secs
lola: 40767292 markings, 112272353 edges, 163954 markings/sec, 235 secs
lola: 41572992 markings, 114363858 edges, 161140 markings/sec, 240 secs
lola: 42340961 markings, 116170467 edges, 153594 markings/sec, 245 secs
lola: 43153727 markings, 118241667 edges, 162553 markings/sec, 250 secs
lola: 43972278 markings, 120480844 edges, 163710 markings/sec, 255 secs
lola: 44774765 markings, 122757407 edges, 160497 markings/sec, 260 secs
lola: 45584148 markings, 125032948 edges, 161877 markings/sec, 265 secs
lola: 46422075 markings, 127272520 edges, 167585 markings/sec, 270 secs
lola: 47258730 markings, 129440351 edges, 167331 markings/sec, 275 secs
lola: 48061455 markings, 131629935 edges, 160545 markings/sec, 280 secs
lola: 48892866 markings, 133845663 edges, 166282 markings/sec, 285 secs
lola: 49703823 markings, 136094003 edges, 162191 markings/sec, 290 secs
lola: 50497962 markings, 138344301 edges, 158828 markings/sec, 295 secs
lola: 51299106 markings, 140365873 edges, 160229 markings/sec, 300 secs
lola: 52077743 markings, 142472885 edges, 155727 markings/sec, 305 secs
lola: 52867651 markings, 144531504 edges, 157982 markings/sec, 310 secs
lola: 53633806 markings, 146705942 edges, 153231 markings/sec, 315 secs
lola: 54406066 markings, 148922729 edges, 154452 markings/sec, 320 secs
lola: 55187963 markings, 150917182 edges, 156379 markings/sec, 325 secs
lola: 56007073 markings, 153122415 edges, 163822 markings/sec, 330 secs
lola: 56796504 markings, 155309912 edges, 157886 markings/sec, 335 secs
lola: 57559415 markings, 157396761 edges, 152582 markings/sec, 340 secs
lola: 58360035 markings, 159315750 edges, 160124 markings/sec, 345 secs
lola: 59123428 markings, 161449074 edges, 152679 markings/sec, 350 secs
lola: 59921273 markings, 163490911 edges, 159569 markings/sec, 355 secs
lola: 60700062 markings, 165609044 edges, 155758 markings/sec, 360 secs
lola: 61467413 markings, 167576610 edges, 153470 markings/sec, 365 secs
lola: 62245406 markings, 169600867 edges, 155599 markings/sec, 370 secs
lola: 62996223 markings, 171590047 edges, 150163 markings/sec, 375 secs
lola: 63749448 markings, 173522454 edges, 150645 markings/sec, 380 secs
lola: 64671933 markings, 175865371 edges, 184497 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: ========================================
lola: subprocess 9 will run for 449 seconds at most (--localtimelimit=-1)
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: 1327455 markings, 1898709 edges, 3689329903141912576 markings/sec, 0 secs
lola: 2505418 markings, 3630611 edges, 235593 markings/sec, 5 secs
lola: 3685302 markings, 5248159 edges, 235977 markings/sec, 10 secs
lola: 4798405 markings, 6853118 edges, 222621 markings/sec, 15 secs
lola: 5800300 markings, 8353794 edges, 200379 markings/sec, 20 secs
lola: 6847002 markings, 9866395 edges, 209340 markings/sec, 25 secs
lola: 7950159 markings, 11457492 edges, 220631 markings/sec, 30 secs
lola: 8971916 markings, 12997980 edges, 204351 markings/sec, 35 secs
lola: 9991362 markings, 14551304 edges, 203889 markings/sec, 40 secs
lola: 11005812 markings, 16043264 edges, 202890 markings/sec, 45 secs
lola: 11876061 markings, 17720894 edges, 174050 markings/sec, 50 secs
lola: 12716591 markings, 19467190 edges, 168106 markings/sec, 55 secs
lola: 13557592 markings, 21231792 edges, 168200 markings/sec, 60 secs
lola: 14448177 markings, 22887646 edges, 178117 markings/sec, 65 secs
lola: 15269489 markings, 24585251 edges, 164262 markings/sec, 70 secs
lola: 16117732 markings, 26152454 edges, 169649 markings/sec, 75 secs
lola: 16963117 markings, 27801900 edges, 169077 markings/sec, 80 secs
lola: 18001206 markings, 29307204 edges, 207618 markings/sec, 85 secs
lola: 19033444 markings, 30726783 edges, 206448 markings/sec, 90 secs
lola: 20075203 markings, 32195195 edges, 208352 markings/sec, 95 secs
lola: 21021718 markings, 33552438 edges, 189303 markings/sec, 100 secs
lola: 22031884 markings, 34985173 edges, 202033 markings/sec, 105 secs
lola: 22991845 markings, 36392570 edges, 191992 markings/sec, 110 secs
lola: 23941699 markings, 37797930 edges, 189971 markings/sec, 115 secs
lola: 24794745 markings, 39392253 edges, 170609 markings/sec, 120 secs
lola: 25660778 markings, 40969905 edges, 173207 markings/sec, 125 secs
lola: 26517885 markings, 42507079 edges, 171421 markings/sec, 130 secs
lola: 27352776 markings, 43959038 edges, 166978 markings/sec, 135 secs
lola: 28183737 markings, 45503233 edges, 166192 markings/sec, 140 secs
lola: 29178277 markings, 46990021 edges, 198908 markings/sec, 145 secs
lola: 30164656 markings, 48427114 edges, 197276 markings/sec, 150 secs
lola: 31104483 markings, 49864153 edges, 187965 markings/sec, 155 secs
lola: 31985919 markings, 51367218 edges, 176287 markings/sec, 160 secs
lola: 32848604 markings, 52893751 edges, 172537 markings/sec, 165 secs
lola: 33843452 markings, 54355206 edges, 198970 markings/sec, 170 secs
lola: 34797933 markings, 55798034 edges, 190896 markings/sec, 175 secs
lola: 35645610 markings, 57254061 edges, 169535 markings/sec, 180 secs
lola: 36525404 markings, 58725046 edges, 175959 markings/sec, 185 secs
lola: 37484958 markings, 60282881 edges, 191911 markings/sec, 190 secs
lola: 38529488 markings, 61714601 edges, 208906 markings/sec, 195 secs
lola: 39526590 markings, 63099266 edges, 199420 markings/sec, 200 secs
lola: 40541716 markings, 64470522 edges, 203025 markings/sec, 205 secs
lola: 41523396 markings, 65806500 edges, 196336 markings/sec, 210 secs
lola: 42416549 markings, 67169595 edges, 178631 markings/sec, 215 secs
lola: 43288853 markings, 68605081 edges, 174461 markings/sec, 220 secs
lola: 44132025 markings, 70051175 edges, 168634 markings/sec, 225 secs
lola: 44973738 markings, 71511505 edges, 168343 markings/sec, 230 secs
lola: 45903127 markings, 72801098 edges, 185878 markings/sec, 235 secs
lola: 46818795 markings, 74144460 edges, 183134 markings/sec, 240 secs
lola: 47595977 markings, 75515177 edges, 155436 markings/sec, 245 secs
lola: 48400693 markings, 76917827 edges, 160943 markings/sec, 250 secs
lola: 49376899 markings, 78334625 edges, 195241 markings/sec, 255 secs
lola: 50314951 markings, 79610249 edges, 187610 markings/sec, 260 secs
lola: 51267262 markings, 80955539 edges, 190462 markings/sec, 265 secs
lola: 52223840 markings, 82286814 edges, 191316 markings/sec, 270 secs
lola: 53177630 markings, 83614065 edges, 190758 markings/sec, 275 secs
lola: 54126302 markings, 84908677 edges, 189734 markings/sec, 280 secs
lola: 55098621 markings, 86228222 edges, 194464 markings/sec, 285 secs
lola: 56119068 markings, 87579288 edges, 204089 markings/sec, 290 secs
lola: 57022924 markings, 88923960 edges, 180771 markings/sec, 295 secs
lola: 57908744 markings, 90219800 edges, 177164 markings/sec, 300 secs
lola: 58759107 markings, 91435800 edges, 170073 markings/sec, 305 secs
lola: 59790789 markings, 92730406 edges, 206336 markings/sec, 310 secs
lola: 60701231 markings, 94043877 edges, 182088 markings/sec, 315 secs
lola: 61571263 markings, 95322382 edges, 174006 markings/sec, 320 secs
lola: 62438063 markings, 96565151 edges, 173360 markings/sec, 325 secs
lola: 63432046 markings, 97860491 edges, 198797 markings/sec, 330 secs
lola: 64293350 markings, 99138123 edges, 172261 markings/sec, 335 secs
lola: 65037287 markings, 100376274 edges, 148787 markings/sec, 340 secs
lola: 65686520 markings, 101424123 edges, 129847 markings/sec, 345 secs
lola: 65691860 markings, 101431572 edges, 1068 markings/sec, 350 secs
lola: 65694949 markings, 101436953 edges, 618 markings/sec, 355 secs
lola: 65697629 markings, 101440738 edges, 536 markings/sec, 360 secs
lola: 65698240 markings, 101441763 edges, 122 markings/sec, 365 secs
lola: 65699245 markings, 101443102 edges, 201 markings/sec, 370 secs
lola: 65699569 markings, 101444015 edges, 65 markings/sec, 375 secs
lola: 65700443 markings, 101446425 edges, 175 markings/sec, 380 secs
lola: 65701218 markings, 101448647 edges, 155 markings/sec, 385 secs
lola: 65701232 markings, 101448693 edges, 3 markings/sec, 390 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 543 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 543 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 679 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 679 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 906 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 1359 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 1359 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 2719 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 2719 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: RESULT
lola:
SUMMARY: no yes yes no no yes yes unknown yes no unknown yes no yes yes yes
lola: ========================================
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 stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/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 irma4mcc-structural"
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 r115-csrt-152666474100479"
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 ;