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 360K
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.5K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.5K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 183K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is TriangularGrid-PT-5020, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-smll-152708748600402
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527210144399


BK_STOP 1527212106665

--------------------
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 TriangularGrid-PT-5020 as instance name.
Using TriangularGrid as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
Known tools are: [{'Time': 1107240, 'Memory': 13472.73, 'Tool': 'lola'}, {'Time': 1108093, 'Memory': 13464.27, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola TriangularGrid-PT-5020...

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


checking for too many tokens
===========================================================================================
TriangularGrid-PT-5020: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ TriangularGrid-PT-5020 @ 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: 520/65536 symbol table entries, 4 collisions
lola: preprocessing...
lola: finding significant places
lola: 280 places, 240 transitions, 164 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 355 transition conflict sets
lola: TASK
lola: reading formula from TriangularGrid-PT-5020-CTLCardinality.task
lola: (A (G (A (G ((1 <= pb1_2_3))))) AND (((pb2_3_1 <= 0) OR (pi3_3_1 <= 1) OR (1 <= po3_3_3)) AND E (X ((pil2_5_3 <= pil2_5_9))))) : A (((po1_3_1 <= 2) U ((2 <= pol2_5_5) OR ((pb2_2_3 <= pb3_4_7) AND (1 <= pi1_3_5))))) : A (X (A (F (((pol1_4_5 <= pi2_4_3) AND (1 <= pol3_4_3)))))) : NOT(((A (X ((3 <= pol1_2_3))) OR (3 <= pol2_4_1)) OR A (G ((pi3_5_9 + 1 <= pb3_4_5))))) : A (G (((pol2_5_3 <= pb2_5_8) OR ((1 <= pb2_4_6) AND (pi2_4_1 <= pol1_3_1) AND (pol2_4_1 <= 1))))) : (E (F (((pil3_5_9 + 1 <= pol1_5_3) OR (pb3_5_3 <= 0)))) AND ((2 <= pil2_5_1) OR (A (F ((2 <= pol3_4_7))) OR (((1 <= pb3_5_6) AND (2 <= po1_2_3)) OR ((pil2_4_7 <= po3_5_1) AND (3 <= pil2_4_7)))))) : E (F ((((3 <= pbl_4_7) AND (pb2_5_5 <= pil3_2_1) AND (3 <= pi3_1_1) AND (pol2_5_9 <= pil3_3_3)) OR (2 <= pil2_4_5)))) : A (F (NOT(E (F ((3 <= pil2_5_9)))))) : (E (G (A (F ((1 <= pb3_2_1))))) AND NOT(NOT(E (F ((3 <= pi3_4_1)))))) : E (G (A (F ((po2_4_7 + 1 <= po1_2_1))))) : A ((A (G ((pol1_4_5 <= pb2_3_1))) U (pb2_4_7 + 1 <= po1_5_9))) : ((((3 <= pbl_4_5) AND ((pi1_3_5 + 1 <= po3_1_1) OR (pol2_4_3 <= 0))) OR (3 <= pol2_4_1)) OR E (G (E (F ((pil1_5_9 <= pb2_4_6)))))) : ((((pb2_3_3 + 1 <= pol3_2_3) OR (pb1_3_1 <= 2) OR (pil1_4_7 <= 1)) OR E (G (((1 <= po1_4_5) AND (pil3_4_7 <= pb2_5_5))))) AND E (G ((pb1_4_6 <= pb1_3_1)))) : A (F ((((pil3_5_7 <= po3_5_5) AND ((3 <= po3_5_3) OR (2 <= pol1_4_7))) OR E (X ((3 <= pol2_2_3)))))) : (E (F (A (F ((pb1_5_4 <= pi3_5_3))))) OR ((pol2_5_7 + 1 <= pbl_5_4) AND (po2_2_3 <= pbl_5_2))) : A (X (E (F ((2 <= pol3_5_1)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (A (G ((1 <= pb1_2_3))))) AND (((pb2_3_1 <= 0) OR (pi3_3_1 <= 1) OR (1 <= po3_3_3)) AND E (X ((pil2_5_3 <= pil2_5_9)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= pb1_2_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 656 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((po1_3_1 <= 2) U ((2 <= pol2_5_5) OR ((pb2_2_3 <= pb3_4_7) AND (1 <= pi1_3_5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((po1_3_1 <= 2) U ((2 <= pol2_5_5) OR ((pb2_2_3 <= pb3_4_7) AND (1 <= pi1_3_5)))))
lola: processed formula: A (((po1_3_1 <= 2) U ((2 <= pol2_5_5) OR ((pb2_2_3 <= pb3_4_7) AND (1 <= pi1_3_5)))))
lola: processed formula length: 86
lola: 0 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 660 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 634 markings, 634 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (((pol1_4_5 <= pi2_4_3) AND (1 <= pol3_4_3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U ((pol1_4_5 <= pi2_4_3) AND (1 <= pol3_4_3))))
lola: processed formula length: 57
lola: 2 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: 369 markings, 369 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((A (X ((3 <= pol1_2_3))) OR (3 <= pol2_4_1)) OR A (G ((pi3_5_9 + 1 <= pb3_4_5)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((pol1_2_3 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((pol1_2_3 <= 2))
lola: processed formula length: 19
lola: 11 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (pol2_4_1 <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pol2_4_1 <= 2)
lola: processed formula length: 15
lola: 10 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((pb3_4_5 <= pi3_5_9)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
state equation: write sara problem file to TriangularGrid-PT-5020-CTLCardinality-5.sara
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pol2_5_3 <= pb2_5_8) OR ((1 <= pb2_4_6) AND (pi2_4_1 <= pol1_3_1) AND (pol2_4_1 <= 1)))))
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 656 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 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to TriangularGrid-PT-5020-CTLCardinality-4.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 14 markings, 13 edges
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (((pil3_5_9 + 1 <= pol1_5_3) OR (pb3_5_3 <= 0)))) AND ((2 <= pil2_5_1) OR (A (F ((2 <= pol3_4_7))) OR (((1 <= pb3_5_6) AND (2 <= po1_2_3)) OR ((pil2_4_7 <= po3_5_1) AND (3 <= pil2_4_7))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pil3_5_9 + 1 <= pol1_5_3) OR (pb3_5_3 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola: state equation: write sara problem file to TriangularGrid-PT-5020-CTLCardinality-5.sara
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= pil2_5_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= pil2_5_1)
lola: processed formula length: 15
lola: 0 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= pol3_4_7)))
lola: ========================================
lola: sara: try reading problem file TriangularGrid-PT-5020-CTLCardinality-4.sara.
SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= pol3_4_7)))
lola: processed formula: A (F ((2 <= pol3_4_7)))
lola: processed formula length: 23
lola: 0 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 660 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: 505 markings, 505 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((1 <= pb3_5_6) AND (2 <= po1_2_3)) OR ((pil2_4_7 <= po3_5_1) AND (3 <= pil2_4_7)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= pb3_5_6) AND (2 <= po1_2_3)) OR ((pil2_4_7 <= po3_5_1) AND (3 <= pil2_4_7)))
lola: processed formula length: 85
lola: 0 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLCardinality.task
lola: processed formula with 4 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((3 <= pbl_4_7) AND (pb2_5_5 <= pil3_2_1) AND (3 <= pi3_1_1) AND (pol2_5_9 <= pil3_3_3)) OR (2 <= pil2_4_5))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to TriangularGrid-PT-5020-CTLCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file TriangularGrid-PT-5020-CTLCardinality-6.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (NOT(E (F ((3 <= pil2_5_9))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G ((pil2_5_9 <= 2)))))
lola: processed formula: A (F (A (G ((pil2_5_9 <= 2)))))
lola: processed formula length: 31
lola: 3 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 660 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 1159701 markings, 2055669 edges, 231940 markings/sec, 0 secs
lola: 2374981 markings, 4148395 edges, 243056 markings/sec, 5 secs
lola: 3630351 markings, 6340329 edges, 251074 markings/sec, 10 secs
lola: 4789905 markings, 8376293 edges, 231911 markings/sec, 15 secs
lola: 5967991 markings, 10426129 edges, 235617 markings/sec, 20 secs
lola: 7054568 markings, 12286575 edges, 217315 markings/sec, 25 secs
lola: 8085331 markings, 14105223 edges, 206153 markings/sec, 30 secs
lola: 9069245 markings, 15824672 edges, 196783 markings/sec, 35 secs
lola: 10107477 markings, 17602471 edges, 207646 markings/sec, 40 secs
lola: 11130138 markings, 19303333 edges, 204532 markings/sec, 45 secs
lola: 12059318 markings, 21012424 edges, 185836 markings/sec, 50 secs
lola: 13074349 markings, 22733013 edges, 203006 markings/sec, 55 secs
lola: 14097172 markings, 24386485 edges, 204565 markings/sec, 60 secs
lola: 15008575 markings, 26046993 edges, 182281 markings/sec, 65 secs
lola: 16040301 markings, 27815497 edges, 206345 markings/sec, 70 secs
lola: 17163663 markings, 29677265 edges, 224672 markings/sec, 75 secs
lola: 18251421 markings, 31326603 edges, 217552 markings/sec, 80 secs
lola: 19344900 markings, 33019926 edges, 218696 markings/sec, 85 secs
lola: 20373187 markings, 34744845 edges, 205657 markings/sec, 90 secs
lola: 21305779 markings, 36379610 edges, 186518 markings/sec, 95 secs
lola: 22383508 markings, 38260077 edges, 215546 markings/sec, 100 secs
lola: 23461661 markings, 40126006 edges, 215631 markings/sec, 105 secs
lola: 24450978 markings, 41806679 edges, 197863 markings/sec, 110 secs
lola: 25397462 markings, 43448139 edges, 189297 markings/sec, 115 secs
lola: 26365126 markings, 45041647 edges, 193533 markings/sec, 120 secs
lola: 27315112 markings, 46673994 edges, 189997 markings/sec, 125 secs
lola: 28199421 markings, 48231271 edges, 176862 markings/sec, 130 secs
lola: 29158648 markings, 49789968 edges, 191845 markings/sec, 135 secs
lola: 30154392 markings, 51437953 edges, 199149 markings/sec, 140 secs
lola: 30940233 markings, 52969147 edges, 157168 markings/sec, 145 secs
lola: 31881445 markings, 54524893 edges, 188242 markings/sec, 150 secs
lola: 32825973 markings, 56062400 edges, 188906 markings/sec, 155 secs
lola: 33807616 markings, 57664779 edges, 196329 markings/sec, 160 secs
lola: 34787991 markings, 59324786 edges, 196075 markings/sec, 165 secs
lola: 35554886 markings, 60820405 edges, 153379 markings/sec, 170 secs
lola: 36414986 markings, 62355396 edges, 172020 markings/sec, 175 secs
lola: 37488645 markings, 63993854 edges, 214732 markings/sec, 180 secs
lola: 38504257 markings, 65558389 edges, 203122 markings/sec, 185 secs
lola: 39521923 markings, 67133740 edges, 203533 markings/sec, 190 secs
lola: 40584291 markings, 68797448 edges, 212474 markings/sec, 195 secs
lola: 41615447 markings, 70487222 edges, 206231 markings/sec, 200 secs
lola: 42489139 markings, 72048089 edges, 174738 markings/sec, 205 secs
lola: 43359958 markings, 73598397 edges, 174164 markings/sec, 210 secs
lola: 44256582 markings, 75167188 edges, 179325 markings/sec, 215 secs
lola: 45413228 markings, 77182821 edges, 231329 markings/sec, 220 secs
lola: 46390632 markings, 78890558 edges, 195481 markings/sec, 225 secs
lola: 47393194 markings, 80523177 edges, 200512 markings/sec, 230 secs
lola: 48286267 markings, 82093593 edges, 178615 markings/sec, 235 secs
lola: 49256494 markings, 83663814 edges, 194045 markings/sec, 240 secs
lola: 50050928 markings, 85182482 edges, 158887 markings/sec, 245 secs
lola: 51005932 markings, 86725522 edges, 191001 markings/sec, 250 secs
lola: 51951669 markings, 88259426 edges, 189147 markings/sec, 255 secs
lola: 52909742 markings, 89863636 edges, 191615 markings/sec, 260 secs
lola: 53653274 markings, 91327395 edges, 148706 markings/sec, 265 secs
lola: 54543354 markings, 92810784 edges, 178016 markings/sec, 270 secs
lola: 55454329 markings, 94289371 edges, 182195 markings/sec, 275 secs
lola: 56379888 markings, 95795744 edges, 185112 markings/sec, 280 secs
lola: 57341845 markings, 97362181 edges, 192391 markings/sec, 285 secs
lola: 58242656 markings, 98935864 edges, 180162 markings/sec, 290 secs
lola: 58963392 markings, 100349394 edges, 144147 markings/sec, 295 secs
lola: 59747919 markings, 101793294 edges, 156905 markings/sec, 300 secs
lola: 60683998 markings, 103287279 edges, 187216 markings/sec, 305 secs
lola: 61584413 markings, 104751774 edges, 180083 markings/sec, 310 secs
lola: 62475246 markings, 106214392 edges, 178167 markings/sec, 315 secs
lola: 63401538 markings, 107721587 edges, 185258 markings/sec, 320 secs
lola: 64374513 markings, 109314529 edges, 194595 markings/sec, 325 secs
lola: 65320369 markings, 110907464 edges, 189171 markings/sec, 330 secs
lola: 66111888 markings, 112382045 edges, 158304 markings/sec, 335 secs
lola: 66803622 markings, 113753980 edges, 138347 markings/sec, 340 secs
lola: 67632543 markings, 115253079 edges, 165784 markings/sec, 345 secs
lola: 68483938 markings, 116679651 edges, 170279 markings/sec, 350 secs
lola: 69472979 markings, 118177556 edges, 197808 markings/sec, 355 secs
lola: 70418576 markings, 119631326 edges, 189119 markings/sec, 360 secs
lola: 71361677 markings, 121084468 edges, 188620 markings/sec, 365 secs
lola: 71690586 markings, 121594750 edges, 65782 markings/sec, 370 secs
lola: 71696874 markings, 121604406 edges, 1258 markings/sec, 375 secs
lola: 71699572 markings, 121608506 edges, 540 markings/sec, 380 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 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (A (F ((1 <= pb3_2_1))))) AND NOT(NOT(E (F ((3 <= pi3_4_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((1 <= pb3_2_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (1 <= pb3_2_1)))))
lola: processed formula length: 44
lola: 8 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: 2883 markings, 4262 edges
lola: ========================================
lola: subprocess 9 will run for 448 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= pi3_4_1)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: state equation: write sara problem file to TriangularGrid-PT-5020-CTLCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file TriangularGrid-PT-5020-CTLCardinality-9.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 448 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((po2_4_7 + 1 <= po1_2_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (po2_4_7 + 1 <= po1_2_1)))))
lola: processed formula length: 54
lola: 2 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 786 markings, 787 edges
lola: ========================================
lola: subprocess 10 will run for 523 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (G ((pol1_4_5 <= pb2_3_1))) U (pb2_4_7 + 1 <= po1_5_9)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((A (G ((pol1_4_5 <= pb2_3_1))) U (pb2_4_7 + 1 <= po1_5_9)))
lola: processed formula: A ((A (G ((pol1_4_5 <= pb2_3_1))) U (pb2_4_7 + 1 <= po1_5_9)))
lola: processed formula length: 62
lola: 0 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 660 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 1078218 markings, 1778137 edges, 215644 markings/sec, 0 secs
lola: 2046671 markings, 3434379 edges, 193691 markings/sec, 5 secs
lola: 2980315 markings, 5026202 edges, 186729 markings/sec, 10 secs
lola: 3963470 markings, 6637335 edges, 196631 markings/sec, 15 secs
lola: 4998521 markings, 8345639 edges, 207010 markings/sec, 20 secs
lola: 5925256 markings, 9919871 edges, 185347 markings/sec, 25 secs
lola: 6897577 markings, 11521775 edges, 194464 markings/sec, 30 secs
lola: 7738086 markings, 12953801 edges, 168102 markings/sec, 35 secs
lola: 8645502 markings, 14480314 edges, 181483 markings/sec, 40 secs
lola: 9533599 markings, 16005253 edges, 177619 markings/sec, 45 secs
lola: 10393594 markings, 17495427 edges, 171999 markings/sec, 50 secs
lola: 11241172 markings, 18940541 edges, 169516 markings/sec, 55 secs
lola: 12076195 markings, 20378038 edges, 167005 markings/sec, 60 secs
lola: 12975120 markings, 21928170 edges, 179785 markings/sec, 65 secs
lola: 13811302 markings, 23374652 edges, 167236 markings/sec, 70 secs
lola: 14635976 markings, 24781306 edges, 164935 markings/sec, 75 secs
lola: 15414788 markings, 26133259 edges, 155762 markings/sec, 80 secs
lola: 16326377 markings, 27635932 edges, 182318 markings/sec, 85 secs
lola: 17267364 markings, 29195468 edges, 188197 markings/sec, 90 secs
lola: 18197803 markings, 30747589 edges, 186088 markings/sec, 95 secs
lola: 19001075 markings, 32115446 edges, 160654 markings/sec, 100 secs
lola: 19798072 markings, 33472617 edges, 159399 markings/sec, 105 secs
lola: 20599546 markings, 34837715 edges, 160295 markings/sec, 110 secs
lola: 21404626 markings, 36222959 edges, 161016 markings/sec, 115 secs
lola: 22303336 markings, 37726511 edges, 179742 markings/sec, 120 secs
lola: 23307004 markings, 39420956 edges, 200734 markings/sec, 125 secs
lola: 24228221 markings, 40984688 edges, 184243 markings/sec, 130 secs
lola: 25133111 markings, 42512260 edges, 180978 markings/sec, 135 secs
lola: 26155825 markings, 44167429 edges, 204543 markings/sec, 140 secs
lola: 27122211 markings, 45796994 edges, 193277 markings/sec, 145 secs
lola: 28028035 markings, 47317083 edges, 181165 markings/sec, 150 secs
lola: 28943342 markings, 48852802 edges, 183061 markings/sec, 155 secs
lola: 29781790 markings, 50281112 edges, 167690 markings/sec, 160 secs
lola: 30699530 markings, 51815101 edges, 183548 markings/sec, 165 secs
lola: 31545194 markings, 53291308 edges, 169133 markings/sec, 170 secs
lola: 32387599 markings, 54743635 edges, 168481 markings/sec, 175 secs
lola: 33239220 markings, 56202782 edges, 170324 markings/sec, 180 secs
lola: 34081840 markings, 57629171 edges, 168524 markings/sec, 185 secs
lola: 34933727 markings, 59113528 edges, 170377 markings/sec, 190 secs
lola: 35776083 markings, 60543452 edges, 168471 markings/sec, 195 secs
lola: 36550937 markings, 61883252 edges, 154971 markings/sec, 200 secs
lola: 37326007 markings, 63222685 edges, 155014 markings/sec, 205 secs
lola: 38269810 markings, 64768881 edges, 188761 markings/sec, 210 secs
lola: 39206991 markings, 66324228 edges, 187436 markings/sec, 215 secs
lola: 40107070 markings, 67820428 edges, 180016 markings/sec, 220 secs
lola: 40872357 markings, 69127499 edges, 153057 markings/sec, 225 secs
lola: 41642889 markings, 70455298 edges, 154106 markings/sec, 230 secs
lola: 42451712 markings, 71829206 edges, 161765 markings/sec, 235 secs
lola: 43236364 markings, 73184853 edges, 156930 markings/sec, 240 secs
lola: 44125749 markings, 74650695 edges, 177877 markings/sec, 245 secs
lola: 45041441 markings, 76162094 edges, 183138 markings/sec, 250 secs
lola: 45890672 markings, 77578497 edges, 169846 markings/sec, 255 secs
lola: 46717222 markings, 78955962 edges, 165310 markings/sec, 260 secs
lola: 47534886 markings, 80320498 edges, 163533 markings/sec, 265 secs
lola: 48428719 markings, 81822450 edges, 178767 markings/sec, 270 secs
lola: 49330882 markings, 83375397 edges, 180433 markings/sec, 275 secs
lola: 50207601 markings, 84872772 edges, 175344 markings/sec, 280 secs
lola: 51035608 markings, 86290189 edges, 165601 markings/sec, 285 secs
lola: 51904927 markings, 87731742 edges, 173864 markings/sec, 290 secs
lola: 52671179 markings, 89070222 edges, 153250 markings/sec, 295 secs
lola: 53578260 markings, 90560722 edges, 181416 markings/sec, 300 secs
lola: 54456547 markings, 92055501 edges, 175657 markings/sec, 305 secs
lola: 55347570 markings, 93606896 edges, 178205 markings/sec, 310 secs
lola: 56290800 markings, 95174561 edges, 188646 markings/sec, 315 secs
lola: 57328614 markings, 96849675 edges, 207563 markings/sec, 320 secs
lola: 58400744 markings, 98584463 edges, 214426 markings/sec, 325 secs
lola: 59466888 markings, 100335495 edges, 213229 markings/sec, 330 secs
lola: 60462947 markings, 101981566 edges, 199212 markings/sec, 335 secs
lola: 61452078 markings, 103615725 edges, 197826 markings/sec, 340 secs
lola: 62367029 markings, 105153409 edges, 182990 markings/sec, 345 secs
lola: 63266776 markings, 106668881 edges, 179949 markings/sec, 350 secs
lola: 64153919 markings, 108185772 edges, 177429 markings/sec, 355 secs
lola: 64965403 markings, 109579773 edges, 162297 markings/sec, 360 secs
lola: 65929189 markings, 111199890 edges, 192757 markings/sec, 365 secs
lola: 66876007 markings, 112842903 edges, 189364 markings/sec, 370 secs
lola: 67830479 markings, 114495143 edges, 190894 markings/sec, 375 secs
lola: 68775526 markings, 116121294 edges, 189009 markings/sec, 380 secs
lola: 69709678 markings, 117733628 edges, 186830 markings/sec, 385 secs
lola: 70578986 markings, 119252369 edges, 173862 markings/sec, 390 secs
lola: 71494996 markings, 120818412 edges, 183202 markings/sec, 395 secs
lola: 72441416 markings, 122401460 edges, 189284 markings/sec, 400 secs
lola: 73247294 markings, 123781246 edges, 161176 markings/sec, 405 secs
lola: 73833575 markings, 124799249 edges, 117256 markings/sec, 410 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 544 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((3 <= pbl_4_5) AND ((pi1_3_5 + 1 <= po3_1_1) OR (pol2_4_3 <= 0))) OR (3 <= pol2_4_1)) OR E (G (E (F ((pil1_5_9 <= pb2_4_6))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 544 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((3 <= pbl_4_5) AND ((pi1_3_5 + 1 <= po3_1_1) OR (pol2_4_3 <= 0))) OR (3 <= pol2_4_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((3 <= pbl_4_5) AND ((pi1_3_5 + 1 <= po3_1_1) OR (pol2_4_3 <= 0))) OR (3 <= pol2_4_1))
lola: processed formula length: 89
lola: 0 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLCardinality.task
lola: processed formula with 4 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 12 will run for 681 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((pil1_5_9 <= pb2_4_6)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (pil1_5_9 <= pb2_4_6)))))
lola: processed formula length: 51
lola: 2 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: 692 markings, 1384 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 681 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((pb2_3_3 + 1 <= pol3_2_3) OR (pb1_3_1 <= 2) OR (pil1_4_7 <= 1)) OR E (G (((1 <= po1_4_5) AND (pil3_4_7 <= pb2_5_5))))) AND E (G ((pb1_4_6 <= pb1_3_1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 681 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((pb2_3_3 + 1 <= pol3_2_3) OR (pb1_3_1 <= 2) OR (pil1_4_7 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((pb2_3_3 + 1 <= pol3_2_3) OR (pb1_3_1 <= 2) OR (pil1_4_7 <= 1))
lola: processed formula length: 66
lola: 0 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLCardinality.task
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 908 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((pb1_4_6 <= pb1_3_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (pb1_3_1 + 1 <= pb1_4_6)))
lola: processed formula length: 39
lola: 2 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: 916 markings, 916 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 907 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((((pil3_5_7 <= po3_5_5) AND ((3 <= po3_5_3) OR (2 <= pol1_4_7))) OR E (X ((3 <= pol2_2_3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (((pil3_5_7 <= po3_5_5) AND ((3 <= po3_5_3) OR (2 <= pol1_4_7))) OR EX((3 <= pol2_2_3))))
lola: processed formula length: 99
lola: 2 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: 330 markings, 330 edges
lola: ========================================
lola: subprocess 14 will run for 1361 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (A (F ((pb1_5_4 <= pi3_5_3))))) OR ((pol2_5_7 + 1 <= pbl_5_4) AND (po2_2_3 <= pbl_5_2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1361 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (F ((pb1_5_4 <= pi3_5_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U (pb1_5_4 <= pi3_5_3)))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: 1181 markings, 3580 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 2723 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((2 <= pol3_5_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (2 <= pol3_5_1)))
lola: processed formula length: 29
lola: 2 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: 500751 markings, 2741095 edges, 3689330178019819520 markings/sec, 0 secs
lola: 921905 markings, 5148746 edges, 84231 markings/sec, 5 secs
lola: 1135603 markings, 7454499 edges, 42740 markings/sec, 10 secs
lola: 1391652 markings, 9727614 edges, 51210 markings/sec, 15 secs
lola: 1804003 markings, 11958288 edges, 82470 markings/sec, 20 secs
lola: 2014192 markings, 14187596 edges, 42038 markings/sec, 25 secs
lola: 2468214 markings, 16212773 edges, 90804 markings/sec, 30 secs
lola: 2539524 markings, 18145330 edges, 14262 markings/sec, 35 secs
lola: 2944099 markings, 20290828 edges, 80915 markings/sec, 40 secs
lola: 3220804 markings, 22267730 edges, 55341 markings/sec, 45 secs
lola: 3469736 markings, 24229936 edges, 49786 markings/sec, 50 secs
lola: 3706657 markings, 25999857 edges, 47384 markings/sec, 55 secs
lola: 4151676 markings, 27736849 edges, 89004 markings/sec, 60 secs
lola: 4264516 markings, 29566298 edges, 22568 markings/sec, 65 secs
lola: 4267079 markings, 31229285 edges, 513 markings/sec, 70 secs
lola: 4527760 markings, 33184905 edges, 52136 markings/sec, 75 secs
lola: 4695469 markings, 34961984 edges, 33542 markings/sec, 80 secs
lola: 5081969 markings, 36664631 edges, 77300 markings/sec, 85 secs
lola: 5156306 markings, 38428679 edges, 14867 markings/sec, 90 secs
lola: 5426443 markings, 40041933 edges, 54027 markings/sec, 95 secs
lola: 5766846 markings, 41621356 edges, 68081 markings/sec, 100 secs
lola: 5915654 markings, 43377719 edges, 29762 markings/sec, 105 secs
lola: 5917420 markings, 44917612 edges, 353 markings/sec, 110 secs
lola: 6178858 markings, 46519536 edges, 52288 markings/sec, 115 secs
lola: 6594865 markings, 48072221 edges, 83201 markings/sec, 120 secs
lola: 6974493 markings, 49735119 edges, 75926 markings/sec, 125 secs
lola: 7056915 markings, 51473294 edges, 16484 markings/sec, 130 secs
lola: 7061044 markings, 52982060 edges, 826 markings/sec, 135 secs
lola: 7062422 markings, 54470566 edges, 276 markings/sec, 140 secs
lola: 7338989 markings, 56442795 edges, 55313 markings/sec, 145 secs
lola: 7570864 markings, 58206657 edges, 46375 markings/sec, 150 secs
lola: 7976827 markings, 59952939 edges, 81193 markings/sec, 155 secs
lola: 8144492 markings, 61803948 edges, 33533 markings/sec, 160 secs
lola: 8297069 markings, 63464838 edges, 30515 markings/sec, 165 secs
lola: 8734847 markings, 65088593 edges, 87556 markings/sec, 170 secs
lola: 9091649 markings, 66863729 edges, 71360 markings/sec, 175 secs
lola: 9122213 markings, 68532183 edges, 6113 markings/sec, 180 secs
lola: 9123986 markings, 70082234 edges, 355 markings/sec, 185 secs
lola: 9369176 markings, 71665258 edges, 49038 markings/sec, 190 secs
lola: 9790062 markings, 73207932 edges, 84177 markings/sec, 195 secs
lola: 10183338 markings, 74758715 edges, 78655 markings/sec, 200 secs
lola: 10522295 markings, 76403461 edges, 67791 markings/sec, 205 secs
lola: 10642032 markings, 78078807 edges, 23947 markings/sec, 210 secs
lola: 10646441 markings, 79570283 edges, 882 markings/sec, 215 secs
lola: 10648315 markings, 81049802 edges, 375 markings/sec, 220 secs
lola: 10649893 markings, 82532440 edges, 316 markings/sec, 225 secs
lola: 10775267 markings, 84261166 edges, 25075 markings/sec, 230 secs
lola: 11026401 markings, 85972215 edges, 50227 markings/sec, 235 secs
lola: 11264913 markings, 87497342 edges, 47702 markings/sec, 240 secs
lola: 11533366 markings, 89196983 edges, 53691 markings/sec, 245 secs
lola: 11536501 markings, 90709696 edges, 627 markings/sec, 250 secs
lola: 11844937 markings, 92226386 edges, 61687 markings/sec, 255 secs
lola: 12166410 markings, 93729796 edges, 64295 markings/sec, 260 secs
lola: 12429887 markings, 95432269 edges, 52695 markings/sec, 265 secs
lola: 12436354 markings, 96970119 edges, 1293 markings/sec, 270 secs
lola: 12437860 markings, 98447524 edges, 301 markings/sec, 275 secs
lola: 12658987 markings, 99956560 edges, 44225 markings/sec, 280 secs
lola: 12975281 markings, 101338423 edges, 63259 markings/sec, 285 secs
lola: 13273629 markings, 102724032 edges, 59670 markings/sec, 290 secs
lola: 13560369 markings, 104139282 edges, 57348 markings/sec, 295 secs
lola: 13802550 markings, 105717228 edges, 48436 markings/sec, 300 secs
lola: 13866453 markings, 107268309 edges, 12781 markings/sec, 305 secs
lola: 13870708 markings, 108693470 edges, 851 markings/sec, 310 secs
lola: 13872242 markings, 110073721 edges, 307 markings/sec, 315 secs
lola: 13873340 markings, 111434516 edges, 220 markings/sec, 320 secs
lola: 14072054 markings, 112927324 edges, 39743 markings/sec, 325 secs
lola: 14603604 markings, 114816526 edges, 106310 markings/sec, 330 secs
lola: 15091166 markings, 116709433 edges, 97512 markings/sec, 335 secs
lola: 15554826 markings, 118640137 edges, 92732 markings/sec, 340 secs
lola: 15911783 markings, 120714453 edges, 71391 markings/sec, 345 secs
lola: 15961364 markings, 122778571 edges, 9916 markings/sec, 350 secs
lola: 15965603 markings, 124718119 edges, 848 markings/sec, 355 secs
lola: 15968576 markings, 126635577 edges, 595 markings/sec, 360 secs
lola: 15970120 markings, 128520651 edges, 309 markings/sec, 365 secs
lola: 16149637 markings, 130802095 edges, 35903 markings/sec, 370 secs
lola: 16517429 markings, 133149199 edges, 73558 markings/sec, 375 secs
lola: 16954624 markings, 135326749 edges, 87439 markings/sec, 380 secs
lola: 17020099 markings, 137405217 edges, 13095 markings/sec, 385 secs
lola: 17576076 markings, 139453738 edges, 111195 markings/sec, 390 secs
lola: 17993332 markings, 141742816 edges, 83451 markings/sec, 395 secs
lola: 17998811 markings, 143893611 edges, 1096 markings/sec, 400 secs
lola: 18088098 markings, 145951259 edges, 17857 markings/sec, 405 secs
lola: 18636181 markings, 147889391 edges, 109617 markings/sec, 410 secs
lola: 19121604 markings, 149842241 edges, 97085 markings/sec, 415 secs
lola: 19531515 markings, 151899635 edges, 81982 markings/sec, 420 secs
lola: 19699504 markings, 154085383 edges, 33598 markings/sec, 425 secs
lola: 19704895 markings, 156095109 edges, 1078 markings/sec, 430 secs
lola: 19706990 markings, 158044742 edges, 419 markings/sec, 435 secs
lola: 19719737 markings, 159970526 edges, 2549 markings/sec, 440 secs
lola: 20298581 markings, 161902890 edges, 115769 markings/sec, 445 secs
lola: 20782435 markings, 163733243 edges, 96771 markings/sec, 450 secs
lola: 21243071 markings, 165575929 edges, 92127 markings/sec, 455 secs
lola: 21674651 markings, 167449091 edges, 86316 markings/sec, 460 secs
lola: 22045862 markings, 169429040 edges, 74242 markings/sec, 465 secs
lola: 22264635 markings, 171566604 edges, 43755 markings/sec, 470 secs
lola: 22271030 markings, 173496701 edges, 1279 markings/sec, 475 secs
lola: 22276057 markings, 175375865 edges, 1005 markings/sec, 480 secs
lola: 22278444 markings, 177222538 edges, 477 markings/sec, 485 secs
lola: 22280107 markings, 179053734 edges, 333 markings/sec, 490 secs
lola: 22281232 markings, 180856380 edges, 225 markings/sec, 495 secs
lola: 22519664 markings, 183100429 edges, 47686 markings/sec, 500 secs
lola: 22852043 markings, 185130932 edges, 66476 markings/sec, 505 secs
lola: 22982221 markings, 187183000 edges, 26036 markings/sec, 510 secs
lola: 23324694 markings, 189062217 edges, 68495 markings/sec, 515 secs
lola: 23704539 markings, 190985132 edges, 75969 markings/sec, 520 secs
lola: 23881025 markings, 193152345 edges, 35297 markings/sec, 525 secs
lola: 23883710 markings, 195048193 edges, 537 markings/sec, 530 secs
lola: 24171919 markings, 196909104 edges, 57642 markings/sec, 535 secs
lola: 24568493 markings, 198694033 edges, 79315 markings/sec, 540 secs
lola: 24941663 markings, 200532308 edges, 74634 markings/sec, 545 secs
lola: 25264679 markings, 202489982 edges, 64603 markings/sec, 550 secs
lola: 25415713 markings, 204613842 edges, 30207 markings/sec, 555 secs
lola: 25420335 markings, 206543315 edges, 924 markings/sec, 560 secs
lola: 25422298 markings, 208394069 edges, 393 markings/sec, 565 secs
lola: 25478213 markings, 210240386 edges, 11183 markings/sec, 570 secs
lola: 25906285 markings, 211990949 edges, 85614 markings/sec, 575 secs
lola: 26282434 markings, 213675505 edges, 75230 markings/sec, 580 secs
lola: 26642538 markings, 215372146 edges, 72021 markings/sec, 585 secs
lola: 26991226 markings, 217090079 edges, 69738 markings/sec, 590 secs
lola: 27319695 markings, 218852144 edges, 65694 markings/sec, 595 secs
lola: 27608465 markings, 220741544 edges, 57754 markings/sec, 600 secs
lola: 27783742 markings, 222769583 edges, 35055 markings/sec, 605 secs
lola: 27790117 markings, 224612563 edges, 1275 markings/sec, 610 secs
lola: 27794655 markings, 226404489 edges, 908 markings/sec, 615 secs
lola: 27797048 markings, 228164357 edges, 479 markings/sec, 620 secs
lola: 27798549 markings, 229909888 edges, 300 markings/sec, 625 secs
lola: 27799413 markings, 231622943 edges, 173 markings/sec, 630 secs
lola: 28142532 markings, 233538046 edges, 68624 markings/sec, 635 secs
lola: 28622430 markings, 235251917 edges, 95980 markings/sec, 640 secs
lola: 29071939 markings, 236954655 edges, 89902 markings/sec, 645 secs
lola: 29508769 markings, 238679549 edges, 87366 markings/sec, 650 secs
lola: 29929712 markings, 240406866 edges, 84189 markings/sec, 655 secs
lola: 30332010 markings, 242156468 edges, 80460 markings/sec, 660 secs
lola: 30698664 markings, 243948093 edges, 73331 markings/sec, 665 secs
lola: 31018702 markings, 245880553 edges, 64008 markings/sec, 670 secs
lola: 31160858 markings, 247889971 edges, 28431 markings/sec, 675 secs
lola: 31169728 markings, 249699994 edges, 1774 markings/sec, 680 secs
lola: 31174287 markings, 251471573 edges, 912 markings/sec, 685 secs
lola: 31178496 markings, 253220455 edges, 842 markings/sec, 690 secs
lola: 31181449 markings, 254963740 edges, 591 markings/sec, 695 secs
lola: 31183334 markings, 256687643 edges, 377 markings/sec, 700 secs
lola: 31184568 markings, 258385611 edges, 247 markings/sec, 705 secs
lola: 31185489 markings, 260075992 edges, 184 markings/sec, 710 secs
lola: 31364324 markings, 262136914 edges, 35767 markings/sec, 715 secs
lola: 31795142 markings, 264464534 edges, 86164 markings/sec, 720 secs
lola: 31929946 markings, 266646728 edges, 26961 markings/sec, 725 secs
lola: 32405141 markings, 268584304 edges, 95039 markings/sec, 730 secs
lola: 32814801 markings, 270584955 edges, 81932 markings/sec, 735 secs
lola: 32907401 markings, 272702942 edges, 18520 markings/sec, 740 secs
lola: 32909084 markings, 274536406 edges, 337 markings/sec, 745 secs
lola: 33402391 markings, 276469504 edges, 98661 markings/sec, 750 secs
lola: 33884923 markings, 278402486 edges, 96506 markings/sec, 755 secs
lola: 34314627 markings, 280418110 edges, 85941 markings/sec, 760 secs
lola: 34607946 markings, 282702381 edges, 58664 markings/sec, 765 secs
lola: 34613203 markings, 284721413 edges, 1051 markings/sec, 770 secs
lola: 34615945 markings, 286653145 edges, 548 markings/sec, 775 secs
lola: 34617051 markings, 288527793 edges, 221 markings/sec, 780 secs
lola: 35052534 markings, 290447693 edges, 87097 markings/sec, 785 secs
lola: 35533509 markings, 292240831 edges, 96195 markings/sec, 790 secs
lola: 35988503 markings, 294057221 edges, 90999 markings/sec, 795 secs
lola: 36414583 markings, 295890093 edges, 85216 markings/sec, 800 secs
lola: 36808667 markings, 297775305 edges, 78817 markings/sec, 805 secs
lola: 37154992 markings, 299812975 edges, 69265 markings/sec, 810 secs
lola: 37306048 markings, 301941596 edges, 30211 markings/sec, 815 secs
lola: 37311449 markings, 303843181 edges, 1080 markings/sec, 820 secs
lola: 37315193 markings, 305700423 edges, 749 markings/sec, 825 secs
lola: 37317681 markings, 307534579 edges, 498 markings/sec, 830 secs
lola: 37319371 markings, 309352881 edges, 338 markings/sec, 835 secs
lola: 37320436 markings, 311129879 edges, 213 markings/sec, 840 secs
lola: 37640758 markings, 313067051 edges, 64064 markings/sec, 845 secs
lola: 38128593 markings, 314794923 edges, 97567 markings/sec, 850 secs
lola: 38574983 markings, 316481267 edges, 89278 markings/sec, 855 secs
lola: 39004796 markings, 318177721 edges, 85963 markings/sec, 860 secs
lola: 39425744 markings, 319888542 edges, 84190 markings/sec, 865 secs
lola: 39825624 markings, 321602402 edges, 79976 markings/sec, 870 secs
lola: 40208179 markings, 323329364 edges, 76511 markings/sec, 875 secs
lola: 40569980 markings, 325098263 edges, 72360 markings/sec, 880 secs
lola: 40904335 markings, 326948606 edges, 66871 markings/sec, 885 secs
lola: 41216409 markings, 328987854 edges, 62415 markings/sec, 890 secs
lola: 41254714 markings, 330890966 edges, 7661 markings/sec, 895 secs
lola: 41260464 markings, 332664821 edges, 1150 markings/sec, 900 secs
lola: 41265282 markings, 334395816 edges, 964 markings/sec, 905 secs
lola: 41268812 markings, 336111337 edges, 706 markings/sec, 910 secs
lola: 41271973 markings, 337826172 edges, 632 markings/sec, 915 secs
lola: 41274204 markings, 339527124 edges, 446 markings/sec, 920 secs
lola: 41276061 markings, 341224881 edges, 371 markings/sec, 925 secs
lola: 41277397 markings, 342898174 edges, 267 markings/sec, 930 secs
lola: 41278380 markings, 344566760 edges, 197 markings/sec, 935 secs
lola: 41281375 markings, 346318006 edges, 599 markings/sec, 940 secs
lola: 41687285 markings, 348681252 edges, 81182 markings/sec, 945 secs
lola: 41932193 markings, 350621659 edges, 48982 markings/sec, 950 secs
lola: 42272062 markings, 352388132 edges, 67974 markings/sec, 955 secs
lola: 42447476 markings, 354348697 edges, 35083 markings/sec, 960 secs
lola: 42449738 markings, 356090297 edges, 452 markings/sec, 965 secs
lola: 42811619 markings, 357844240 edges, 72376 markings/sec, 970 secs
lola: 43170202 markings, 359529050 edges, 71717 markings/sec, 975 secs
lola: 43499686 markings, 361260975 edges, 65897 markings/sec, 980 secs
lola: 43786893 markings, 363161058 edges, 57441 markings/sec, 985 secs
lola: 43879689 markings, 365107114 edges, 18559 markings/sec, 990 secs
lola: 43883328 markings, 366804189 edges, 728 markings/sec, 995 secs
lola: 43884925 markings, 368468201 edges, 319 markings/sec, 1000 secs
lola: 44049842 markings, 370201508 edges, 32983 markings/sec, 1005 secs
lola: 44424417 markings, 371793036 edges, 74915 markings/sec, 1010 secs
lola: 44773951 markings, 373391250 edges, 69907 markings/sec, 1015 secs
lola: 45108038 markings, 375000252 edges, 66817 markings/sec, 1020 secs
lola: 45422904 markings, 376617642 edges, 62973 markings/sec, 1025 secs
lola: 45720109 markings, 378275043 edges, 59441 markings/sec, 1030 secs
lola: 45993856 markings, 380012265 edges, 54749 markings/sec, 1035 secs
lola: 46247635 markings, 381987107 edges, 50756 markings/sec, 1040 secs
lola: 46251731 markings, 383675083 edges, 819 markings/sec, 1045 secs
lola: 46255591 markings, 385301315 edges, 772 markings/sec, 1050 secs
lola: 46258221 markings, 386911048 edges, 526 markings/sec, 1055 secs
lola: 46260089 markings, 388513610 edges, 374 markings/sec, 1060 secs
lola: 46261262 markings, 390101653 edges, 235 markings/sec, 1065 secs
lola: 46261913 markings, 391682300 edges, 130 markings/sec, 1070 secs
lola: 46611198 markings, 393366045 edges, 69857 markings/sec, 1075 secs
lola: 46959141 markings, 394860654 edges, 69589 markings/sec, 1080 secs
lola: 47105530 markings, 395512409 edges, 29278 markings/sec, 1085 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no yes no no no unknown no no unknown yes yes no yes unknown
FORMULA TriangularGrid-PT-5020-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLCardinality-15 CANNOT_COMPUTE 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="TriangularGrid-PT-5020"
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/TriangularGrid-PT-5020.tgz
mv TriangularGrid-PT-5020 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 TriangularGrid-PT-5020, 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 r178-smll-152708748600402"
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 ;