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 300K
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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.9K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K 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.8K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K 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.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 24K 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 121K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is TriangularGrid-PT-4022, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-smll-152708745200395
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527188774048


BK_STOP 1527189607865

--------------------
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-4022 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': 969160, 'Memory': 10342.19, 'Tool': 'lola'}, {'Time': 969513, 'Memory': 9604.09, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola TriangularGrid-PT-4022...

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


checking for too many tokens
===========================================================================================
TriangularGrid-PT-4022: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ TriangularGrid-PT-4022 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 340/65536 symbol table entries, 1 collisions
lola: preprocessing...
lola: finding significant places
lola: 184 places, 156 transitions, 107 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 232 transition conflict sets
lola: TASK
lola: reading formula from TriangularGrid-PT-4022-CTLCardinality.task
lola: E (G (E (F (((3 <= pol1_3_3) OR (1 <= pi1_4_3)))))) : E (((pbl_2_2 <= pbl_4_4) U (pb2_4_4 + 1 <= po2_2_3))) : (E (X (A (F ((3 <= pol2_4_1))))) OR E ((((pb3_3_4 <= pol1_4_3) OR (1 <= po1_4_5)) U ((3 <= po1_4_3) OR (pb3_4_7 <= po2_4_3))))) : (NOT(E (F (((2 <= pil3_4_5) AND (1 <= pil3_4_7))))) AND ((pb2_4_4 + 1 <= pol2_3_3) OR (pol3_4_3 <= 2) OR (3 <= pil1_1_1) OR (po3_4_5 <= pol3_4_3))) : ((A (G (((pol2_3_5 <= pb2_3_3) OR (1 <= pol1_4_1)))) OR ((2 <= pil2_2_1) AND ((pol3_3_1 <= 2) OR (pol3_2_1 <= 2)))) AND ((pb1_3_4 + 1 <= pi2_4_1) OR ((pb1_4_7 <= pbl_3_1) AND (pi3_2_1 <= pil2_4_7)))) : A (F (NOT(E (F ((pil2_3_5 <= po1_3_1)))))) : E (G (((po2_4_1 <= 1) AND (pil2_4_3 <= 1) AND (pi3_2_3 <= pb3_4_5)))) : E (G (((1 <= pb2_4_7) OR (3 <= pol3_3_1) OR ((pi1_2_1 <= pol2_4_1) AND (pol2_2_3 <= pil2_4_1)) OR (((pol2_4_5 <= pi2_2_1) OR (po1_1_1 <= pb1_3_1)) AND (pb3_4_6 <= 0))))) : (((pi1_2_1 <= 1) OR ((pi2_1_1 <= 2) AND (pi1_4_7 <= 2) AND ((pb2_4_7 <= 1) OR (pol2_1_1 <= 0)))) AND NOT((E (F ((2 <= pil3_1_1))) OR A (X ((2 <= pil1_4_7)))))) : E (G ((E (F ((po1_2_1 <= pb1_1_1))) OR (2 <= po3_3_5)))) : NOT(E ((((pi2_3_3 <= pb2_3_5) AND (2 <= pb1_4_3)) U ((3 <= pi3_4_7) AND (3 <= po3_1_1))))) : E (G (((pol2_4_3 <= pi1_4_1) OR (po1_2_1 <= pil3_4_7) OR (pb1_4_2 <= 2) OR (pbl_2_3 + 1 <= pb3_4_7)))) : A (G (((pi2_4_7 <= pol2_4_3) AND ((pb2_1_1 <= pil3_4_5) OR (pol3_3_3 <= pb3_3_2) OR ((pil2_2_1 <= pb3_4_7) AND (2 <= pol1_1_1)))))) : E (F ((pb1_3_5 + 1 <= po2_3_5))) : (A (F (((pb2_4_3 <= 1) AND (pil3_2_3 <= 1)))) OR (3 <= pb3_1_1)) : NOT(NOT(A (G ((pi1_2_3 <= 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: E (G (E (F (((3 <= pol1_3_3) OR (1 <= pi1_4_3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U ((3 <= pol1_3_3) OR (1 <= pi1_4_3))))))
lola: processed formula length: 66
lola: 2 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 428 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: 505 markings, 1427 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((pbl_2_2 <= pbl_4_4) U (pb2_4_4 + 1 <= po2_2_3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((pbl_2_2 <= pbl_4_4) U (pb2_4_4 + 1 <= po2_2_3))
lola: processed formula length: 50
lola: 1 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 428 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: 1468234 markings, 2684222 edges, 3689330178019819520 markings/sec, 0 secs
lola: 2817013 markings, 5285892 edges, 269756 markings/sec, 5 secs
lola: 4093285 markings, 7776691 edges, 255254 markings/sec, 10 secs
lola: 5252645 markings, 10089894 edges, 231872 markings/sec, 15 secs
lola: 6277637 markings, 12229064 edges, 204998 markings/sec, 20 secs
lola: 7201443 markings, 14222534 edges, 184761 markings/sec, 25 secs
lola: 7995583 markings, 16127723 edges, 158828 markings/sec, 30 secs
lola: 8866379 markings, 18074228 edges, 174159 markings/sec, 35 secs
lola: 9923835 markings, 20206546 edges, 211491 markings/sec, 40 secs
lola: 11165512 markings, 22531164 edges, 248335 markings/sec, 45 secs
lola: 12308764 markings, 24758253 edges, 228650 markings/sec, 50 secs
lola: 13306746 markings, 26756660 edges, 199596 markings/sec, 55 secs
lola: 14166850 markings, 28563034 edges, 172021 markings/sec, 60 secs
lola: 14931775 markings, 30347014 edges, 152985 markings/sec, 65 secs
lola: 15682746 markings, 32056883 edges, 150194 markings/sec, 70 secs
lola: 16497208 markings, 33857532 edges, 162892 markings/sec, 75 secs
lola: 17530842 markings, 35868109 edges, 206727 markings/sec, 80 secs
lola: 18508200 markings, 37898822 edges, 195472 markings/sec, 85 secs
lola: 19381378 markings, 39836509 edges, 174636 markings/sec, 90 secs
lola: 20203288 markings, 41658321 edges, 164382 markings/sec, 95 secs
lola: 21007339 markings, 43449026 edges, 160810 markings/sec, 100 secs
lola: 22135313 markings, 45650805 edges, 225595 markings/sec, 105 secs
lola: 23106433 markings, 47562578 edges, 194224 markings/sec, 110 secs
lola: 24038435 markings, 49473189 edges, 186400 markings/sec, 115 secs
lola: 24895136 markings, 51240763 edges, 171340 markings/sec, 120 secs
lola: 25886894 markings, 53297966 edges, 198352 markings/sec, 125 secs
lola: 26672732 markings, 55049070 edges, 157168 markings/sec, 130 secs
lola: 27376754 markings, 56727380 edges, 140804 markings/sec, 135 secs
lola: 28119456 markings, 58494639 edges, 148540 markings/sec, 140 secs
lola: 28769859 markings, 60079348 edges, 130081 markings/sec, 145 secs
lola: 29593715 markings, 61843096 edges, 164771 markings/sec, 150 secs
lola: 30328371 markings, 63468291 edges, 146931 markings/sec, 155 secs
lola: 30962361 markings, 64976121 edges, 126798 markings/sec, 160 secs
lola: 31619200 markings, 66546248 edges, 131368 markings/sec, 165 secs
lola: 32269307 markings, 68104695 edges, 130021 markings/sec, 170 secs
lola: 32937701 markings, 69595963 edges, 133679 markings/sec, 175 secs
lola: 33926303 markings, 71532844 edges, 197720 markings/sec, 180 secs
lola: 34866223 markings, 73376400 edges, 187984 markings/sec, 185 secs
lola: 35613337 markings, 74972058 edges, 149423 markings/sec, 190 secs
lola: 36299912 markings, 76580707 edges, 137315 markings/sec, 195 secs
lola: 36979545 markings, 78141475 edges, 135927 markings/sec, 200 secs
lola: 37664709 markings, 79746858 edges, 137033 markings/sec, 205 secs
lola: 38408148 markings, 81301407 edges, 148688 markings/sec, 210 secs
lola: 39135671 markings, 82804208 edges, 145505 markings/sec, 215 secs
lola: 39851367 markings, 84380960 edges, 143139 markings/sec, 220 secs
lola: 40432036 markings, 85726153 edges, 116134 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X (A (F ((3 <= pol2_4_1))))) OR E ((((pb3_3_4 <= pol1_4_3) OR (1 <= po1_4_5)) U ((3 <= po1_4_3) OR (pb3_4_7 <= po2_4_3)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (F ((3 <= pol2_4_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U (3 <= pol2_4_1)))
lola: processed formula length: 29
lola: 2 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 428 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: 6224 markings, 6271 edges
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((pb3_3_4 <= pol1_4_3) OR (1 <= po1_4_5)) U ((3 <= po1_4_3) OR (pb3_4_7 <= po2_4_3))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((pb3_3_4 <= pol1_4_3) OR (1 <= po1_4_5)) U ((3 <= po1_4_3) OR (pb3_4_7 <= po2_4_3)))
lola: processed formula length: 89
lola: 1 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 428 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: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (F (((2 <= pil3_4_5) AND (1 <= pil3_4_7))))) AND ((pb2_4_4 + 1 <= pol2_3_3) OR (pol3_4_3 <= 2) OR (3 <= pil1_1_1) OR (po3_4_5 <= pol3_4_3)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pil3_4_5 <= 1) OR (pil3_4_7 <= 0))))
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 428 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 1 conjunctive subformulas
lola: state equation: write sara problem file to TriangularGrid-PT-4022-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file TriangularGrid-PT-4022-CTLCardinality-3.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((pb2_4_4 + 1 <= pol2_3_3) OR (pol3_4_3 <= 2) OR (3 <= pil1_1_1) OR (po3_4_5 <= pol3_4_3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((pb2_4_4 + 1 <= pol2_3_3) OR (pol3_4_3 <= 2) OR (3 <= pil1_1_1) OR (po3_4_5 <= pol3_4_3))
lola: processed formula length: 93
lola: 3 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: processed formula with 4 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G (((pol2_3_5 <= pb2_3_3) OR (1 <= pol1_4_1)))) OR ((2 <= pil2_2_1) AND ((pol3_3_1 <= 2) OR (pol3_2_1 <= 2)))) AND ((pb1_3_4 + 1 <= pi2_4_1) OR ((pb1_4_7 <= pbl_3_1) AND (pi3_2_1 <= pil2_4_7))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pol2_3_5 <= pb2_3_3) OR (1 <= pol1_4_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 428 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 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: state equation: write sara problem file to TriangularGrid-PT-4022-CTLCardinality-4.sara
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= pil2_2_1) AND ((pol3_3_1 <= 2) OR (pol3_2_1 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= pil2_2_1) AND ((pol3_3_1 <= 2) OR (pol3_2_1 <= 2)))
lola: processed formula length: 59
lola: 0 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (NOT(E (F ((pil2_3_5 <= po1_3_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G ((po1_3_1 + 1 <= pil2_3_5)))))
lola: processed formula: A (F (A (G ((po1_3_1 + 1 <= pil2_3_5)))))
lola: processed formula length: 41
lola: 3 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 432 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: 434 markings, 435 edges
lola: ========================================
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((po2_4_1 <= 1) AND (pil2_4_3 <= 1) AND (pi3_2_3 <= pb3_4_5))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((2 <= po2_4_1) OR (2 <= pil2_4_3) OR (pb3_4_5 + 1 <= pi3_2_3))))
lola: processed formula length: 80
lola: 2 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 428 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: 649 markings, 649 edges
lola: ========================================
lola: subprocess 7 will run for 367 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= pb2_4_7) OR (3 <= pol3_3_1) OR ((pi1_2_1 <= pol2_4_1) AND (pol2_2_3 <= pil2_4_1)) OR (((pol2_4_5 <= pi2_2_1) OR (po1_1_1 <= pb1_3_1)) AND (pb3_4_6 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((pb2_4_7 <= 0) AND (pol3_3_1 <= 2) AND ((pol2_4_1 + 1 <= pi1_2_1) OR (pil2_4_1 + 1 <= pol2_2_3)) AND (((pi2_2_1 + 1 <= pol2_4_5) AND (pb1_3_1 + 1 <= po1_1_1)) OR (1 <= pb3_4_6)))))
lola: processed formula length: 196
lola: 2 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 428 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: 460 markings, 460 edges
lola: ========================================
lola: subprocess 8 will run for 413 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((pi1_2_1 <= 1) OR ((pi2_1_1 <= 2) AND (pi1_4_7 <= 2) AND ((pb2_4_7 <= 1) OR (pol2_1_1 <= 0)))) AND NOT((E (F ((2 <= pil3_1_1))) OR A (X ((2 <= pil1_4_7))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 413 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((pi1_2_1 <= 1) OR ((pi2_1_1 <= 2) AND (pi1_4_7 <= 2) AND ((pb2_4_7 <= 1) OR (pol2_1_1 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((pi1_2_1 <= 1) OR ((pi2_1_1 <= 2) AND (pi1_4_7 <= 2) AND ((pb2_4_7 <= 1) OR (pol2_1_1 <= 0))))
lola: processed formula length: 97
lola: 7 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: processed formula with 5 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 9 will run for 472 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((pil3_1_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 428 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-4022-CTLCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file TriangularGrid-PT-4022-CTLCardinality-9.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 10 will run for 550 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((pil1_4_7 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((pil1_4_7 <= 1))
lola: processed formula length: 19
lola: 8 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 428 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 9 will run for 472 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((E (F ((po1_2_1 <= pb1_1_1))) OR (2 <= po3_3_5))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(E(TRUE U (po1_2_1 <= pb1_1_1))) AND (po3_3_5 <= 1))))
lola: processed formula length: 71
lola: 4 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 428 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: 529 markings, 1058 edges
lola: ========================================
lola: subprocess 10 will run for 550 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E ((((pi2_3_3 <= pb2_3_5) AND (2 <= pb1_4_3)) U ((3 <= pi3_4_7) AND (3 <= po3_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((pb2_3_5 + 1 <= pi2_3_3) OR (pb1_4_3 <= 1)) R ((pi3_4_7 <= 2) OR (po3_1_1 <= 2))))
lola: processed formula: A ((((pb2_3_5 + 1 <= pi2_3_3) OR (pb1_4_3 <= 1)) R ((pi3_4_7 <= 2) OR (po3_1_1 <= 2))))
lola: processed formula length: 89
lola: 4 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 432 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: 1180176 markings, 2222927 edges, 236035 markings/sec, 0 secs
lola: 2292609 markings, 4334457 edges, 222487 markings/sec, 5 secs
lola: 3365913 markings, 6394953 edges, 214661 markings/sec, 10 secs
lola: 4435831 markings, 8407076 edges, 213984 markings/sec, 15 secs
lola: 5484411 markings, 10370124 edges, 209716 markings/sec, 20 secs
lola: 6562988 markings, 12391964 edges, 215715 markings/sec, 25 secs
lola: 7603712 markings, 14334519 edges, 208145 markings/sec, 30 secs
lola: 8579146 markings, 16226985 edges, 195087 markings/sec, 35 secs
lola: 9573609 markings, 18087354 edges, 198893 markings/sec, 40 secs
lola: 10504824 markings, 19897731 edges, 186243 markings/sec, 45 secs
lola: 11497984 markings, 21710074 edges, 198632 markings/sec, 50 secs
lola: 12518956 markings, 23703508 edges, 204194 markings/sec, 55 secs
lola: 13455631 markings, 25583759 edges, 187335 markings/sec, 60 secs
lola: 14343092 markings, 27394686 edges, 177492 markings/sec, 65 secs
lola: 15190384 markings, 29139309 edges, 169458 markings/sec, 70 secs
lola: 15988871 markings, 30692478 edges, 159697 markings/sec, 75 secs
lola: 16772192 markings, 32256851 edges, 156664 markings/sec, 80 secs
lola: 17600507 markings, 34025056 edges, 165663 markings/sec, 85 secs
lola: 18532173 markings, 35876278 edges, 186333 markings/sec, 90 secs
lola: 19398767 markings, 37593050 edges, 173319 markings/sec, 95 secs
lola: 20195116 markings, 39172889 edges, 159270 markings/sec, 100 secs
lola: 20975405 markings, 40665722 edges, 156058 markings/sec, 105 secs
lola: 21730862 markings, 42301122 edges, 151091 markings/sec, 110 secs
lola: 22596668 markings, 44043087 edges, 173161 markings/sec, 115 secs
lola: 23385032 markings, 45672942 edges, 157673 markings/sec, 120 secs
lola: 24141670 markings, 47144403 edges, 151328 markings/sec, 125 secs
lola: 24847518 markings, 48704501 edges, 141170 markings/sec, 130 secs
lola: 25656758 markings, 50285934 edges, 161848 markings/sec, 135 secs
lola: 26412736 markings, 51739580 edges, 151196 markings/sec, 140 secs
lola: 27120756 markings, 53196942 edges, 141604 markings/sec, 145 secs
lola: 27815515 markings, 54644541 edges, 138952 markings/sec, 150 secs
lola: 28536008 markings, 56003433 edges, 144099 markings/sec, 155 secs
lola: 29153784 markings, 57361610 edges, 123555 markings/sec, 160 secs
lola: 29844890 markings, 58609172 edges, 138221 markings/sec, 165 secs
lola: 30552145 markings, 59921538 edges, 141451 markings/sec, 170 secs
lola: 31243609 markings, 61249460 edges, 138293 markings/sec, 175 secs
lola: 31947629 markings, 62619242 edges, 140804 markings/sec, 180 secs
lola: 32748668 markings, 64184611 edges, 160208 markings/sec, 185 secs
lola: 33251704 markings, 65440093 edges, 100607 markings/sec, 190 secs
lola: 33755898 markings, 66728050 edges, 100839 markings/sec, 195 secs
lola: 34728888 markings, 68631877 edges, 194598 markings/sec, 200 secs
lola: 35685714 markings, 70558313 edges, 191365 markings/sec, 205 secs
lola: 36611058 markings, 72435530 edges, 185069 markings/sec, 210 secs
lola: 37496158 markings, 74256690 edges, 177020 markings/sec, 215 secs
lola: 38281411 markings, 75778982 edges, 157051 markings/sec, 220 secs
lola: 39046782 markings, 77309983 edges, 153074 markings/sec, 225 secs
lola: 39805353 markings, 78944578 edges, 151714 markings/sec, 230 secs
lola: 40640381 markings, 80601228 edges, 167006 markings/sec, 235 secs
lola: 41400980 markings, 82133427 edges, 152120 markings/sec, 240 secs
lola: 42110514 markings, 83517314 edges, 141907 markings/sec, 245 secs
lola: 42773610 markings, 84789023 edges, 132619 markings/sec, 250 secs
lola: 43468577 markings, 86152017 edges, 138993 markings/sec, 255 secs
lola: 44144636 markings, 87635329 edges, 135212 markings/sec, 260 secs
lola: 44976336 markings, 89308795 edges, 166340 markings/sec, 265 secs
lola: 45716178 markings, 90831904 edges, 147968 markings/sec, 270 secs
lola: 46458208 markings, 92280880 edges, 148406 markings/sec, 275 secs
lola: 47149403 markings, 93809515 edges, 138239 markings/sec, 280 secs
lola: 47928773 markings, 95334924 edges, 155874 markings/sec, 285 secs
lola: 48617935 markings, 96659837 edges, 137832 markings/sec, 290 secs
lola: 49342446 markings, 98115639 edges, 144902 markings/sec, 295 secs
lola: 50001673 markings, 99528778 edges, 131845 markings/sec, 300 secs
lola: 50705380 markings, 100851309 edges, 140741 markings/sec, 305 secs
lola: 51359503 markings, 102237137 edges, 130825 markings/sec, 310 secs
lola: 52007882 markings, 103460814 edges, 129676 markings/sec, 315 secs
lola: 52684757 markings, 104707874 edges, 135375 markings/sec, 320 secs
lola: 53343985 markings, 105966270 edges, 131846 markings/sec, 325 secs
lola: 53998648 markings, 107238044 edges, 130933 markings/sec, 330 secs
lola: 54738997 markings, 108670217 edges, 148070 markings/sec, 335 secs
lola: 55339101 markings, 110021099 edges, 120021 markings/sec, 340 secs
lola: 55823363 markings, 111245788 edges, 96852 markings/sec, 345 secs
lola: 56500995 markings, 112689183 edges, 135526 markings/sec, 350 secs
lola: 57315819 markings, 114281024 edges, 162965 markings/sec, 355 secs
lola: 58119205 markings, 115891267 edges, 160677 markings/sec, 360 secs
lola: 58898957 markings, 117414231 edges, 155950 markings/sec, 365 secs
lola: 59621981 markings, 118791402 edges, 144605 markings/sec, 370 secs
lola: 60316169 markings, 120109119 edges, 138838 markings/sec, 375 secs
lola: 60958300 markings, 121513203 edges, 128426 markings/sec, 380 secs
lola: 61765836 markings, 123115136 edges, 161507 markings/sec, 385 secs
lola: 62500616 markings, 124607763 edges, 146956 markings/sec, 390 secs
lola: 63193793 markings, 125980903 edges, 138635 markings/sec, 395 secs
lola: 63860456 markings, 127284963 edges, 133333 markings/sec, 400 secs
lola: 64481485 markings, 128671513 edges, 124206 markings/sec, 405 secs
lola: 65197834 markings, 130069391 edges, 143270 markings/sec, 410 secs
lola: 65887088 markings, 131408453 edges, 137851 markings/sec, 415 secs
lola: 66559151 markings, 132666891 edges, 134413 markings/sec, 420 secs
lola: 67196931 markings, 133984830 edges, 127556 markings/sec, 425 secs
lola: 67825555 markings, 135279320 edges, 125725 markings/sec, 430 secs
lola: 68467977 markings, 136479269 edges, 128484 markings/sec, 435 secs
lola: 69127092 markings, 137743082 edges, 131823 markings/sec, 440 secs
lola: 69661319 markings, 138902466 edges, 106845 markings/sec, 445 secs
lola: 70286023 markings, 140023742 edges, 124941 markings/sec, 450 secs
lola: 70908976 markings, 141184776 edges, 124591 markings/sec, 455 secs
lola: 71522567 markings, 142349007 edges, 122718 markings/sec, 460 secs
lola: 72126600 markings, 143491835 edges, 120807 markings/sec, 465 secs
lola: 72770374 markings, 144729680 edges, 128755 markings/sec, 470 secs
lola: 73475845 markings, 146112958 edges, 141094 markings/sec, 475 secs
lola: 73928739 markings, 147212818 edges, 90579 markings/sec, 480 secs
lola: 74377201 markings, 148336332 edges, 89692 markings/sec, 485 secs
lola: 75058181 markings, 149754480 edges, 136196 markings/sec, 490 secs
lola: 75828836 markings, 151299455 edges, 154131 markings/sec, 495 secs
lola: 76541007 markings, 152731850 edges, 142434 markings/sec, 500 secs
lola: 77208708 markings, 154052789 edges, 133540 markings/sec, 505 secs
lola: 77877750 markings, 155402004 edges, 133808 markings/sec, 510 secs
lola: 78500118 markings, 156751435 edges, 124474 markings/sec, 515 secs
lola: 79122452 markings, 158010496 edges, 124467 markings/sec, 520 secs
lola: 79139261 markings, 158043337 edges, 3362 markings/sec, 525 secs
lola: 79145936 markings, 158056156 edges, 1335 markings/sec, 530 secs
lola: 79147796 markings, 158059339 edges, 372 markings/sec, 535 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 550 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((pol2_4_3 <= pi1_4_1) OR (po1_2_1 <= pil3_4_7) OR (pb1_4_2 <= 2) OR (pbl_2_3 + 1 <= pb3_4_7))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((pi1_4_1 + 1 <= pol2_4_3) AND (pil3_4_7 + 1 <= po1_2_1) AND (3 <= pb1_4_2) AND (pb3_4_7 <= pbl_2_3))))
lola: processed formula length: 116
lola: 2 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 428 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: 496 markings, 496 edges
lola: ========================================
lola: subprocess 12 will run for 688 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pi2_4_7 <= pol2_4_3) AND ((pb2_1_1 <= pil3_4_5) OR (pol3_3_3 <= pb3_3_2) OR ((pil2_2_1 <= pb3_4_7) AND (2 <= pol1_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 428 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 7 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 13 will run for 917 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((pb1_3_5 + 1 <= po2_3_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 428 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: 5 markings, 4 edges
lola: ========================================
lola: subprocess 14 will run for 1376 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (((pb2_4_3 <= 1) AND (pil3_2_3 <= 1)))) OR (3 <= pb3_1_1))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1376 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((pb2_4_3 <= 1) AND (pil3_2_3 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((pb2_4_3 <= 1) AND (pil3_2_3 <= 1))))
lola: processed formula: A (F (((pb2_4_3 <= 1) AND (pil3_2_3 <= 1))))
lola: processed formula length: 44
lola: 0 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 432 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: 568 markings, 568 edges
lola: ========================================
lola: subprocess 15 will run for 2752 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= pb3_1_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= pb3_1_1)
lola: processed formula length: 14
lola: 0 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 2752 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(A (G ((pi1_2_3 <= 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 428 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-4022-CTLCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file TriangularGrid-PT-4022-CTLCardinality-15.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: RESULT
lola:
SUMMARY: yes unknown no yes no no yes yes yes yes unknown yes no yes no yes
lola: ========================================
FORMULA TriangularGrid-PT-4022-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/TriangularGrid-PT-4022.tgz
mv TriangularGrid-PT-4022 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is TriangularGrid-PT-4022, 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 r174-smll-152708745200395"
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 ;