About the Execution of LoLA for NeighborGrid-PT-d5n4m1t35
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15918.770 | 2070227.00 | 12458882.00 | 2132.00 | F?FT?TT?FTTF???F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2019-input.r104-oct2-155272225400112.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is NeighborGrid-PT-d5n4m1t35, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r104-oct2-155272225400112
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 59M
-rw-r--r-- 1 mcc users 3.6K Feb 12 02:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 12 02:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Feb 8 01:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 8 01:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 112 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 350 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 3.0K Feb 5 00:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K Feb 5 00:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Feb 4 06:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 4 06:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Feb 1 00:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 1 00:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 4 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 10 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rwxr-xr-x 1 mcc users 59M Mar 10 17:31 model.pnml
--------------------
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 NeighborGrid-PT-d5n4m1t35-CTLCardinality-00
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-01
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-02
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-03
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-04
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-05
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-06
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-07
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-08
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-09
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-10
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-11
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-12
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-13
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-14
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1552775243868
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ NeighborGrid-PT-d5n4m1t35 @ 3570 seconds
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-07 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
Makefile:16: recipe for target 'verify' failed
vrfy: finished
info: timeLeft: 1500
rslt: Output for CTLCardinality @ NeighborGrid-PT-d5n4m1t35
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 398
},
"exit":
{
"localtimelimitreached": true,
"memory": 3956600,
"runtime": 1581.000000,
"signal": "User defined signal 2"
},
"files":
{
"JSON": "CTLCardinality.json"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (G (((p_3_2_1_3_1 <= 0) OR (p_3_3_3_2_1 + 1 <= p_0_3_0_3_3) OR (p_1_3_1_0_1 <= p_3_2_0_3_0))))",
"processed_size": 98,
"rewrites": 19
},
"result":
{
"preliminary_value": "no unknown no unknown unknown unknown yes unknown unknown yes yes no unknown unknown unknown no "
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 1916
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 197632/268435456 symbol table entries, 5872 collisions
lola: preprocessing...
lola: Size of bit vector: 32768
lola: finding significant places
lola: 1024 places, 196608 transitions, 1023 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLCardinality.xml
lola: NOT(NOT(NOT(E (F ((2 <= p_3_0_0_2_2)))))) : E (G ((E (F ((2 <= p_0_0_3_1_0))) OR A (X ((p_1_2_3_3_0 <= p_3_0_1_2_1)))))) : (((((p_3_0_2_3_1 + 1 <= p_0_2_3_1_3) AND (p_3_3_1_0_1 + 1 <= p_1_1_1_1_1)) OR (p_3_0_1_2_3 + 1 <= p_2_0_1_3_1)) OR A (X (((p_0_2_1_1_3 <= p_2_1_3_3_3) OR (p_1_0_2_0_0 <= p_2_3_1_0_1))))) AND A (F ((p_3_1_3_2_0 <= p_0_3_1_2_2)))) : A (F (E (((p_3_0_3_2_3 <= p_2_0_1_2_0) U (3 <= p_3_3_0_0_3))))) : E (G (((p_3_2_1_3_1 <= 0) OR (p_3_3_3_2_1 + 1 <= p_0_3_0_3_3) OR (p_1_3_1_0_1 <= p_3_2_0_3_0)))) : (E (F ((((3 <= p_3_1_0_1_0) OR (p_3_0_0_3_1 <= p_3_1_0_3_2)) AND (3 <= p_1_1_3_1_2)))) OR ((p_3_0_0_3_1 + 1 <= p_0_0_3_1_3) AND (p_1_2_3_3_1 + 1 <= p_0_1_2_2_1))) : A (F (E (F (((1 <= p_0_1_0_0_2) AND (2 <= p_3_0_2_2_1)))))) : (E (((3 <= p_1_0_1_2_3) U ((3 <= p_3_2_3_0_2) OR (2 <= p_2_2_3_2_0)))) OR A (G (A (F ((p_2_0_0_0_2 <= p_3_1_0_1_2)))))) : ((p_2_0_2_0_2 + 1 <= p_1_3_2_3_2) OR A (F ((3 <= p_3_3_0_1_2)))) : NOT(A (G (((p_0_3_1_1_3 <= 2) OR (p_2_0_0_3_3 + 1 <= p_3_0_3_3_3))))) : E (X ((p_2_1_2_2_3 <= 0))) : A (X (((3 <= p_3_0_2_1_2) OR A (F ((p_2_2_1_2_3 <= p_1_1_1_3_3)))))) : E (G (E (F (((2 <= p_0_3_3_0_1) AND (3 <= p_1_3_2_0_1)))))) : A (F ((A (X ((p_0_2_1_0_0 <= p_1_3_0_1_3))) AND (p_2_1_1_3_1 + 1 <= p_1_2_1_3_2)))) : ((1 <= p_0_0_0_3_1) AND E (F (A (X ((2 <= p_1_3_3_2_1)))))) : NOT(E (F (E (G ((p_2_3_0_2_2 <= p_2_0_2_3_0))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:449
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 198 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((E (F ((2 <= p_0_0_3_1_0))) OR A (X ((p_1_2_3_3_0 <= p_3_0_1_2_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((EF((2 <= p_0_0_3_1_0)) OR AX((p_1_2_3_3_0 <= p_3_0_1_2_1))))
lola: processed formula length: 64
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 9912 markings, 9956 edges, 1982 markings/sec, 0 secs
lola: 31027 markings, 31637 edges, 4223 markings/sec, 5 secs
lola: 57905 markings, 59445 edges, 5376 markings/sec, 10 secs
lola: 90964 markings, 94792 edges, 6612 markings/sec, 15 secs
lola: 124305 markings, 130844 edges, 6668 markings/sec, 20 secs
lola: 157145 markings, 166354 edges, 6568 markings/sec, 25 secs
lola: 189807 markings, 201673 edges, 6532 markings/sec, 30 secs
lola: 223682 markings, 237515 edges, 6775 markings/sec, 35 secs
lola: 256834 markings, 271888 edges, 6630 markings/sec, 40 secs
lola: 289853 markings, 306463 edges, 6604 markings/sec, 45 secs
lola: 322314 markings, 342872 edges, 6492 markings/sec, 50 secs
lola: 354789 markings, 379318 edges, 6495 markings/sec, 55 secs
lola: 387205 markings, 415681 edges, 6483 markings/sec, 60 secs
lola: 419669 markings, 452112 edges, 6493 markings/sec, 65 secs
lola: 452164 markings, 488582 edges, 6499 markings/sec, 70 secs
lola: 484656 markings, 525023 edges, 6498 markings/sec, 75 secs
lola: 517139 markings, 561475 edges, 6497 markings/sec, 80 secs
lola: 549633 markings, 597942 edges, 6499 markings/sec, 85 secs
lola: 582145 markings, 634416 edges, 6502 markings/sec, 90 secs
lola: 614649 markings, 670878 edges, 6501 markings/sec, 95 secs
lola: 648162 markings, 706685 edges, 6703 markings/sec, 100 secs
lola: 681376 markings, 741206 edges, 6643 markings/sec, 105 secs
lola: 714432 markings, 775448 edges, 6611 markings/sec, 110 secs
lola: 746925 markings, 811910 edges, 6499 markings/sec, 115 secs
lola: 779417 markings, 848372 edges, 6498 markings/sec, 120 secs
lola: 811903 markings, 884822 edges, 6497 markings/sec, 125 secs
lola: 844282 markings, 921151 edges, 6476 markings/sec, 130 secs
lola: 876753 markings, 957587 edges, 6494 markings/sec, 135 secs
lola: 909212 markings, 993999 edges, 6492 markings/sec, 140 secs
lola: 941883 markings, 1030653 edges, 6534 markings/sec, 145 secs
lola: 974535 markings, 1067304 edges, 6530 markings/sec, 150 secs
lola: 1007320 markings, 1104079 edges, 6557 markings/sec, 155 secs
lola: 1039872 markings, 1140604 edges, 6510 markings/sec, 160 secs
lola: 1073243 markings, 1176444 edges, 6674 markings/sec, 165 secs
lola: 1106592 markings, 1211162 edges, 6670 markings/sec, 170 secs
lola: 1139719 markings, 1245432 edges, 6625 markings/sec, 175 secs
lola: 1172379 markings, 1281904 edges, 6532 markings/sec, 180 secs
lola: 1204488 markings, 1317944 edges, 6422 markings/sec, 185 secs
lola: 1236631 markings, 1353994 edges, 6429 markings/sec, 190 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 198 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((((p_3_0_2_3_1 + 1 <= p_0_2_3_1_3) AND (p_3_3_1_0_1 + 1 <= p_1_1_1_1_1)) OR (p_3_0_1_2_3 + 1 <= p_2_0_1_3_1)) OR A (X (((p_0_2_1_1_3 <= p_2_1_3_3_3) OR (p_1_0_2_0_0 <= p_2_3_1_0_1))))) AND A (F ((p_3_1_3_2_0 <= p_0_3_1_2_2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 198 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p_3_0_2_3_1 + 1 <= p_0_2_3_1_3) AND (p_3_3_1_0_1 + 1 <= p_1_1_1_1_1)) OR (p_3_0_1_2_3 + 1 <= p_2_0_1_3_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p_3_0_2_3_1 + 1 <= p_0_2_3_1_3) AND (p_3_3_1_0_1 + 1 <= p_1_1_1_1_1)) OR (p_3_0_1_2_3 + 1 <= p_2_0_1_3_1))
lola: processed formula length: 110
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 212 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p_3_1_3_2_0 <= p_0_3_1_2_2)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p_0_3_1_2_2 + 1 <= p_3_1_3_2_0)
lola: processed formula length: 32
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p_3_1_3_2_0 <= p_0_3_1_2_2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 228 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((p_0_2_1_1_3 <= p_2_1_3_3_3) OR (p_1_0_2_0_0 <= p_2_3_1_0_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((p_0_2_1_1_3 <= p_2_1_3_3_3) OR (p_1_0_2_0_0 <= p_2_3_1_0_1)))
lola: processed formula length: 67
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 2 will run for 212 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((p_2_1_2_2_3 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((p_2_1_2_2_3 <= 0))
lola: processed formula length: 22
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
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 3 will run for 228 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((3 <= p_3_0_2_1_2) OR A (F ((p_2_2_1_2_3 <= p_1_1_1_3_3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((3 <= p_3_0_2_1_2) OR AF((p_2_2_1_2_3 <= p_1_1_1_3_3))))
lola: processed formula length: 60
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 8073 markings, 8073 edges
lola: ========================================
lola: subprocess 4 will run for 247 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((A (X ((p_0_2_1_0_0 <= p_1_3_0_1_3))) AND (p_2_1_1_3_1 + 1 <= p_1_2_1_3_2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((AX((p_0_2_1_0_0 <= p_1_3_0_1_3)) AND (p_2_1_1_3_1 + 1 <= p_1_2_1_3_2)))
lola: processed formula length: 75
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 581 markings, 580 edges, 116 markings/sec, 0 secs
lola: 809 markings, 808 edges, 46 markings/sec, 5 secs
lola: 820 markings, 819 edges, 2 markings/sec, 10 secs
lola: 831 markings, 830 edges, 2 markings/sec, 15 secs
lola: 841 markings, 840 edges, 2 markings/sec, 20 secs
lola: 852 markings, 851 edges, 2 markings/sec, 25 secs
lola: 861 markings, 860 edges, 2 markings/sec, 30 secs
lola: 868 markings, 867 edges, 1 markings/sec, 35 secs
lola: 876 markings, 875 edges, 2 markings/sec, 40 secs
lola: 883 markings, 882 edges, 1 markings/sec, 45 secs
lola: 891 markings, 890 edges, 2 markings/sec, 50 secs
lola: 899 markings, 898 edges, 2 markings/sec, 55 secs
lola: 907 markings, 906 edges, 2 markings/sec, 60 secs
lola: 915 markings, 914 edges, 2 markings/sec, 65 secs
lola: 922 markings, 921 edges, 1 markings/sec, 70 secs
lola: 930 markings, 929 edges, 2 markings/sec, 75 secs
lola: 938 markings, 937 edges, 2 markings/sec, 80 secs
lola: 946 markings, 945 edges, 2 markings/sec, 85 secs
lola: 955 markings, 954 edges, 2 markings/sec, 90 secs
lola: 963 markings, 962 edges, 2 markings/sec, 95 secs
lola: 971 markings, 970 edges, 2 markings/sec, 100 secs
lola: 979 markings, 978 edges, 2 markings/sec, 105 secs
lola: 988 markings, 987 edges, 2 markings/sec, 110 secs
lola: 996 markings, 995 edges, 2 markings/sec, 115 secs
lola: 1004 markings, 1003 edges, 2 markings/sec, 120 secs
lola: 1013 markings, 1012 edges, 2 markings/sec, 125 secs
lola: 1021 markings, 1020 edges, 2 markings/sec, 130 secs
lola: 1030 markings, 1029 edges, 2 markings/sec, 135 secs
lola: 1038 markings, 1037 edges, 2 markings/sec, 140 secs
lola: 1047 markings, 1046 edges, 2 markings/sec, 145 secs
lola: 1055 markings, 1054 edges, 2 markings/sec, 150 secs
lola: 1064 markings, 1063 edges, 2 markings/sec, 155 secs
lola: 1072 markings, 1071 edges, 2 markings/sec, 160 secs
lola: 1081 markings, 1080 edges, 2 markings/sec, 165 secs
lola: 1089 markings, 1088 edges, 2 markings/sec, 170 secs
lola: 1098 markings, 1097 edges, 2 markings/sec, 175 secs
lola: 1107 markings, 1106 edges, 2 markings/sec, 180 secs
lola: 1115 markings, 1114 edges, 2 markings/sec, 185 secs
lola: 1124 markings, 1123 edges, 2 markings/sec, 190 secs
lola: 1133 markings, 1132 edges, 2 markings/sec, 195 secs
lola: 1142 markings, 1141 edges, 2 markings/sec, 200 secs
lola: 1150 markings, 1149 edges, 2 markings/sec, 205 secs
lola: 1159 markings, 1158 edges, 2 markings/sec, 210 secs
lola: 1168 markings, 1167 edges, 2 markings/sec, 215 secs
lola: 1178 markings, 1177 edges, 2 markings/sec, 220 secs
lola: 1187 markings, 1186 edges, 2 markings/sec, 225 secs
lola: 1196 markings, 1195 edges, 2 markings/sec, 230 secs
lola: 1205 markings, 1204 edges, 2 markings/sec, 235 secs
lola: 1215 markings, 1214 edges, 2 markings/sec, 240 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown no unknown unknown unknown unknown unknown unknown unknown yes no unknown unknown unknown unknown
lola: memory consumption: 5117724 KB
lola: time consumption: 849 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: unknown unknown no unknown unknown unknown unknown unknown unknown unknown yes no unknown unknown unknown unknown
lola: memory consumption: 5121912 KB
lola: time consumption: 853 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 245 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p_0_0_0_3_1) AND E (F (A (X ((2 <= p_1_3_3_2_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 245 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p_0_0_0_3_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p_0_0_0_3_1)
lola: processed formula length: 18
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
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 6 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((2 <= p_1_3_3_2_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX((2 <= p_1_3_3_2_1)))
lola: processed formula length: 26
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 3373 markings, 3385 edges, 675 markings/sec, 0 secs
lola: 9180 markings, 9197 edges, 1161 markings/sec, 5 secs
lola: 17808 markings, 18078 edges, 1726 markings/sec, 10 secs
lola: 29781 markings, 30355 edges, 2395 markings/sec, 15 secs
lola: 42040 markings, 42964 edges, 2452 markings/sec, 20 secs
lola: 55546 markings, 56977 edges, 2701 markings/sec, 25 secs
lola: 71525 markings, 73772 edges, 3196 markings/sec, 30 secs
lola: 88147 markings, 91745 edges, 3324 markings/sec, 35 secs
lola: 104724 markings, 109670 edges, 3315 markings/sec, 40 secs
lola: 121326 markings, 127622 edges, 3320 markings/sec, 45 secs
lola: 137887 markings, 145530 edges, 3312 markings/sec, 50 secs
lola: 154702 markings, 163712 edges, 3363 markings/sec, 55 secs
lola: 171317 markings, 181679 edges, 3323 markings/sec, 60 secs
lola: 187846 markings, 199552 edges, 3306 markings/sec, 65 secs
lola: 204529 markings, 217325 edges, 3337 markings/sec, 70 secs
lola: 221287 markings, 234989 edges, 3352 markings/sec, 75 secs
lola: 237714 markings, 252109 edges, 3285 markings/sec, 80 secs
lola: 254014 markings, 268971 edges, 3260 markings/sec, 85 secs
lola: 270436 markings, 285959 edges, 3284 markings/sec, 90 secs
lola: 286659 markings, 302869 edges, 3245 markings/sec, 95 secs
lola: 303234 markings, 321463 edges, 3315 markings/sec, 100 secs
lola: 319613 markings, 339842 edges, 3276 markings/sec, 105 secs
lola: 335985 markings, 358218 edges, 3274 markings/sec, 110 secs
lola: 352436 markings, 376677 edges, 3290 markings/sec, 115 secs
lola: 369090 markings, 395355 edges, 3331 markings/sec, 120 secs
lola: 385956 markings, 414293 edges, 3373 markings/sec, 125 secs
lola: 402815 markings, 433206 edges, 3372 markings/sec, 130 secs
lola: 419670 markings, 452112 edges, 3371 markings/sec, 135 secs
lola: 436534 markings, 471031 edges, 3373 markings/sec, 140 secs
lola: 453401 markings, 489952 edges, 3373 markings/sec, 145 secs
lola: 470160 markings, 508758 edges, 3352 markings/sec, 150 secs
lola: 486839 markings, 527480 edges, 3336 markings/sec, 155 secs
lola: 503527 markings, 546203 edges, 3338 markings/sec, 160 secs
lola: 520192 markings, 564898 edges, 3333 markings/sec, 165 secs
lola: 536877 markings, 583627 edges, 3337 markings/sec, 170 secs
lola: 553542 markings, 602313 edges, 3333 markings/sec, 175 secs
lola: 562598 markings, 612475 edges, 1811 markings/sec, 180 secs
lola: 563332 markings, 613306 edges, 147 markings/sec, 185 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 6 will run for 250 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p_3_0_0_2_2 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((p_3_0_0_2_2 <= 1)))
lola: processed formula length: 26
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (2 <= p_3_0_0_2_2)
lola: state equation task get result unparse finished id 0
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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 7 will run for 277 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p_0_1_0_0_2) AND (2 <= p_3_0_2_2_1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p_0_1_0_0_2) AND (2 <= p_3_0_2_2_1))))
lola: processed formula length: 51
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p_0_1_0_0_2) AND (2 <= p_3_0_2_2_1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 8 will run for 312 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p_0_3_1_1_3) AND (p_3_0_3_3_3 <= p_2_0_0_3_3))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((3 <= p_0_3_1_1_3) AND (p_3_0_3_3_3 <= p_2_0_0_3_3))))
lola: processed formula length: 61
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((3 <= p_0_3_1_1_3) AND (p_3_0_3_3_3 <= p_2_0_0_3_3))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 9 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((p_2_0_2_3_0 + 1 <= p_2_3_0_2_2)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (p_2_3_0_2_2 <= p_2_0_2_3_0)
lola: processed formula length: 28
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p_2_3_0_2_2 <= p_2_0_2_3_0)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p_2_0_2_3_0 + 1 <= p_2_3_0_2_2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-9-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLCardinality-9-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-9-0.sara.
sara: try reading problem file CTLCardinality-9-1.sara.
lola: sara is running 0 secs || sara is running 0 secs || 1429 markings, 1428 edges, 286 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 1973 markings, 1972 edges, 109 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 2586 markings, 2585 edges, 123 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 2958 markings, 2957 edges, 74 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 3259 markings, 3258 edges, 60 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 3464 markings, 3463 edges, 41 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 3626 markings, 3625 edges, 32 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 3767 markings, 3766 edges, 28 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 3963 markings, 3962 edges, 39 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 4071 markings, 4070 edges, 22 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 4128 markings, 4127 edges, 11 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 4202 markings, 4201 edges, 15 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 4249 markings, 4248 edges, 9 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 4431 markings, 4430 edges, 36 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 4609 markings, 4608 edges, 36 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 4742 markings, 4741 edges, 27 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 4880 markings, 4879 edges, 28 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 4980 markings, 4979 edges, 20 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 5031 markings, 5030 edges, 10 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 5077 markings, 5076 edges, 9 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 5176 markings, 5175 edges, 20 markings/sec, 100 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 5258 markings, 5258 edges
lola: ========================================
lola: subprocess 10 will run for 398 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p_3_2_1_3_1 <= 0) OR (p_3_3_3_2_1 + 1 <= p_0_3_0_3_3) OR (p_1_3_1_0_1 <= p_3_2_0_3_0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p_3_2_1_3_1 <= 0) OR (p_3_3_3_2_1 + 1 <= p_0_3_0_3_3) OR (p_1_3_1_0_1 <= p_3_2_0_3_0))))
lola: processed formula length: 98
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p_3_2_1_3_1) AND (p_0_3_0_3_3 <= p_3_3_3_2_1) AND (p_3_2_0_3_0 + 1 <= p_1_3_1_0_1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-10-0.sara.
lola: 248 markings, 247 edges, 50 markings/sec, 0 secs || sara is running 0 secs
lola: 370 markings, 369 edges, 24 markings/sec, 5 secs || sara is running 5 secs
lola: 449 markings, 448 edges, 16 markings/sec, 10 secs || sara is running 10 secs
lola: 502 markings, 501 edges, 11 markings/sec, 15 secs || sara is running 15 secs
lola: 520 markings, 519 edges, 4 markings/sec, 20 secs || sara is running 20 secs
lola: 523 markings, 522 edges, 1 markings/sec, 25 secs || sara is running 25 secs
lola: 529 markings, 528 edges, 1 markings/sec, 30 secs || sara is running 30 secs
lola: 534 markings, 533 edges, 1 markings/sec, 35 secs || sara is running 35 secs
lola: 538 markings, 537 edges, 1 markings/sec, 40 secs || sara is running 40 secs
lola: 548 markings, 547 edges, 2 markings/sec, 45 secs || sara is running 45 secs
lola: 556 markings, 555 edges, 2 markings/sec, 50 secs || sara is running 50 secs
lola: 563 markings, 562 edges, 1 markings/sec, 55 secs || sara is running 55 secs
lola: 573 markings, 572 edges, 2 markings/sec, 60 secs || sara is running 60 secs
lola: 587 markings, 586 edges, 3 markings/sec, 65 secs || sara is running 65 secs
lola: 605 markings, 604 edges, 4 markings/sec, 70 secs || sara is running 70 secs
lola: 608 markings, 607 edges, 1 markings/sec, 75 secs || sara is running 75 secs
lola: 612 markings, 611 edges, 1 markings/sec, 80 secs || sara is running 80 secs
lola: 617 markings, 616 edges, 1 markings/sec, 85 secs || sara is running 85 secs
lola: 621 markings, 620 edges, 1 markings/sec, 90 secs || sara is running 90 secs
lola: 625 markings, 624 edges, 1 markings/sec, 95 secs || sara is running 95 secs
lola: 629 markings, 628 edges, 1 markings/sec, 100 secs || sara is running 100 secs
lola: 633 markings, 632 edges, 1 markings/sec, 105 secs || sara is running 105 secs
lola: 638 markings, 637 edges, 1 markings/sec, 110 secs || sara is running 110 secs
lola: 644 markings, 643 edges, 1 markings/sec, 115 secs || sara is running 115 secs
lola: 650 markings, 649 edges, 1 markings/sec, 120 secs || sara is running 120 secs
lola: 657 markings, 656 edges, 1 markings/sec, 125 secs || sara is running 125 secs
lola: 665 markings, 664 edges, 2 markings/sec, 130 secs || sara is running 130 secs
lola: 673 markings, 672 edges, 2 markings/sec, 135 secs || sara is running 135 secs
lola: 681 markings, 680 edges, 2 markings/sec, 140 secs || sara is running 140 secs
lola: 686 markings, 685 edges, 1 markings/sec, 145 secs || sara is running 145 secs
lola: 692 markings, 691 edges, 1 markings/sec, 150 secs || sara is running 150 secs
lola: 698 markings, 697 edges, 1 markings/sec, 155 secs || sara is running 155 secs
lola: 718 markings, 717 edges, 4 markings/sec, 160 secs || sara is running 160 secs
lola: 723 markings, 722 edges, 1 markings/sec, 165 secs || sara is running 165 secs
lola: 727 markings, 726 edges, 1 markings/sec, 170 secs || sara is running 170 secs
lola: 733 markings, 732 edges, 1 markings/sec, 175 secs || sara is running 175 secs
lola: 739 markings, 738 edges, 1 markings/sec, 180 secs || sara is running 180 secs
lola: 745 markings, 744 edges, 1 markings/sec, 185 secs || sara is running 185 secs
lola: 753 markings, 752 edges, 2 markings/sec, 190 secs || sara is running 190 secs
lola: 758 markings, 757 edges, 1 markings/sec, 195 secs || sara is running 195 secs
lola: 763 markings, 762 edges, 1 markings/sec, 200 secs || sara is running 200 secs
lola: 770 markings, 769 edges, 1 markings/sec, 205 secs || sara is running 205 secs
lola: 774 markings, 773 edges, 1 markings/sec, 210 secs || sara is running 210 secs
lola: 791 markings, 790 edges, 3 markings/sec, 215 secs || sara is running 215 secs
lola: 797 markings, 796 edges, 1 markings/sec, 220 secs || sara is running 220 secs
lola: 807 markings, 806 edges, 2 markings/sec, 225 secs || sara is running 225 secs
lola: 816 markings, 815 edges, 2 markings/sec, 230 secs || sara is running 230 secs
lola: 820 markings, 819 edges, 1 markings/sec, 235 secs || sara is running 235 secs
lola: 827 markings, 826 edges, 1 markings/sec, 240 secs || sara is running 240 secs
lola: 833 markings, 832 edges, 1 markings/sec, 245 secs || sara is running 245 secs
lola: 841 markings, 840 edges, 2 markings/sec, 250 secs || sara is running 250 secs
lola: 847 markings, 846 edges, 1 markings/sec, 255 secs || sara is running 255 secs
lola: 853 markings, 852 edges, 1 markings/sec, 260 secs || sara is running 260 secs
lola: 861 markings, 860 edges, 2 markings/sec, 265 secs || sara is running 265 secs
lola: 871 markings, 870 edges, 2 markings/sec, 270 secs || sara is running 270 secs
lola: 879 markings, 878 edges, 2 markings/sec, 275 secs || sara is running 275 secs
lola: 888 markings, 887 edges, 2 markings/sec, 280 secs || sara is running 280 secs
lola: 893 markings, 892 edges, 1 markings/sec, 285 secs || sara is running 285 secs
lola: 903 markings, 902 edges, 2 markings/sec, 290 secs || sara is running 290 secs
lola: 913 markings, 912 edges, 2 markings/sec, 295 secs || sara is running 295 secs
lola: 932 markings, 931 edges, 4 markings/sec, 300 secs || sara is running 300 secs
lola: 951 markings, 950 edges, 4 markings/sec, 305 secs || sara is running 305 secs
lola: 961 markings, 960 edges, 2 markings/sec, 310 secs || sara is running 310 secs
lola: 976 markings, 975 edges, 3 markings/sec, 315 secs || sara is running 315 secs
lola: 995 markings, 994 edges, 4 markings/sec, 320 secs || sara is running 320 secs
lola: 1000 markings, 999 edges, 1 markings/sec, 325 secs || sara is running 325 secs
lola: 1006 markings, 1005 edges, 1 markings/sec, 330 secs || sara is running 330 secs
lola: 1011 markings, 1010 edges, 1 markings/sec, 335 secs || sara is running 335 secs
lola: 1022 markings, 1021 edges, 2 markings/sec, 340 secs || sara is running 340 secs
lola: 1047 markings, 1046 edges, 5 markings/sec, 345 secs || sara is running 345 secs
lola: 1076 markings, 1075 edges, 6 markings/sec, 350 secs || sara is running 350 secs
lola: 1093 markings, 1092 edges, 3 markings/sec, 355 secs || sara is running 355 secs
lola: 1102 markings, 1101 edges, 2 markings/sec, 360 secs || sara is running 360 secs
lola: 1112 markings, 1111 edges, 2 markings/sec, 365 secs || sara is running 365 secs
lola: 1119 markings, 1118 edges, 1 markings/sec, 370 secs || sara is running 370 secs
lola: 1129 markings, 1128 edges, 2 markings/sec, 375 secs || sara is running 375 secs
lola: 1142 markings, 1141 edges, 3 markings/sec, 380 secs || sara is running 380 secs
lola: 1148 markings, 1147 edges, 1 markings/sec, 385 secs || sara is running 385 secs
lola: 1153 markings, 1152 edges, 1 markings/sec, 390 secs || sara is running 390 secs
lola: local time limit reached - aborting
lola:
preliminary result: no unknown no unknown unknown unknown yes unknown unknown yes yes no unknown unknown unknown no
lola: memory consumption: 3954908 KB
lola: time consumption: 1579 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: no unknown no unknown unknown unknown yes unknown unknown yes yes no unknown unknown unknown no
lola: memory consumption: 3956600 KB
lola: time consumption: 1581 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (((p_3_0_3_2_3 <= p_2_0_1_2_0) U (3 <= p_3_3_0_0_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(E((p_3_0_3_2_3 <= p_2_0_1_2_0) U (3 <= p_3_3_0_0_3)))
lola: processed formula length: 56
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 104 markings, 104 edges
lola: ========================================
lola: subprocess 12 will run for 491 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p_2_0_2_0_2 + 1 <= p_1_3_2_3_2) OR A (F ((3 <= p_3_3_0_1_2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 491 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p_2_0_2_0_2 + 1 <= p_1_3_2_3_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p_2_0_2_0_2 + 1 <= p_1_3_2_3_2)
lola: processed formula length: 32
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
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 13 will run for 655 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= p_3_3_0_1_2)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p_3_3_0_1_2 <= 2)
lola: processed formula length: 18
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p_3_3_0_1_2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-13-0.sara.
lola: 793 markings, 792 edges, 159 markings/sec, 0 secs || sara is running 0 secs
lola: 1618 markings, 1617 edges, 165 markings/sec, 5 secs || sara is running 5 secs
lola: 1980 markings, 1979 edges, 72 markings/sec, 10 secs || sara is running 10 secs
lola: 2412 markings, 2411 edges, 86 markings/sec, 15 secs || sara is running 15 secs
lola: 2686 markings, 2685 edges, 55 markings/sec, 20 secs || sara is running 20 secs
lola: 2984 markings, 2983 edges, 60 markings/sec, 25 secs || sara is running 25 secs
lola: 3238 markings, 3237 edges, 51 markings/sec, 30 secs || sara is running 30 secs
lola: 3426 markings, 3425 edges, 38 markings/sec, 35 secs || sara is running 35 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 3571 markings, 3571 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 640 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((((3 <= p_3_1_0_1_0) OR (p_3_0_0_3_1 <= p_3_1_0_3_2)) AND (3 <= p_1_1_3_1_2)))) OR ((p_3_0_0_3_1 + 1 <= p_0_0_3_1_3) AND (p_1_2_3_3_1 + 1 <= p_0_1_2_2_1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 640 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p_3_0_0_3_1 + 1 <= p_0_0_3_1_3) AND (p_1_2_3_3_1 + 1 <= p_0_1_2_2_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p_3_0_0_3_1 + 1 <= p_0_0_3_1_3) AND (p_1_2_3_3_1 + 1 <= p_0_1_2_2_1))
lola: processed formula length: 71
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 961 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((3 <= p_3_1_0_1_0) OR (p_3_0_0_3_1 <= p_3_1_0_3_2)) AND (3 <= p_1_1_3_1_2))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((3 <= p_3_1_0_1_0) OR (p_3_0_0_3_1 <= p_3_1_0_3_2)) AND (3 <= p_1_1_3_1_2))))
lola: processed formula length: 86
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((3 <= p_3_1_0_1_0) OR (p_3_0_0_3_1 <= p_3_1_0_3_2)) AND (3 <= p_1_1_3_1_2))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 961 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((2 <= p_0_3_3_0_1) AND (3 <= p_1_3_2_0_1))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:593
lola: rewrite Frontend/Parser/formula_rewrite.k:628
lola: rewrite Frontend/Parser/formula_rewrite.k:731
lola: processed formula: ((2 <= p_0_3_3_0_1) AND (3 <= p_1_3_2_0_1))
lola: processed formula length: 43
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((2 <= p_0_3_3_0_1) AND (3 <= p_1_3_2_0_1))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p_0_3_3_0_1 <= 1) OR (p_1_3_2_0_1 <= 2))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: sara not yet started (preprocessing) || sara not yet started (preprocessing) || 2105 markings, 2104 edges, 421 markings/sec, 0 secs
lola: state equation: write sara problem file to CTLCardinality-14-1.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLCardinality-14-0.sara
sara: try reading problem file CTLCardinality-14-1.sara.
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-14-0.sara.
lola: sara is running 5 secs || sara is running 5 secs || 5177 markings, 5194 edges, 614 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 11698 markings, 11765 edges, 1304 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 23554 markings, 23950 edges, 2371 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 36716 markings, 37488 edges, 2632 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 49440 markings, 50604 edges, 2545 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 64200 markings, 66025 edges, 2952 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 75629 markings, 78211 edges, 2286 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 86333 markings, 89785 edges, 2141 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 97140 markings, 101470 edges, 2161 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 107850 markings, 113052 edges, 2142 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 125680 markings, 132331 edges, 3566 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 144205 markings, 152361 edges, 3705 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 160868 markings, 170380 edges, 3333 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 178027 markings, 188934 edges, 3432 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 191668 markings, 203770 edges, 2728 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 205108 markings, 217936 edges, 2688 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 221121 markings, 234815 edges, 3203 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 231893 markings, 246086 edges, 2154 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 263520 markings, 278805 edges, 6325 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 289924 markings, 306539 edges, 5281 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 320286 markings, 340597 edges, 6072 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 340100 markings, 362830 edges, 3963 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 362601 markings, 388077 edges, 4500 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 392122 markings, 421202 edges, 5904 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 410198 markings, 441491 edges, 3615 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 426544 markings, 459818 edges, 3269 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 442637 markings, 477876 edges, 3219 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 465555 markings, 503598 edges, 4584 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 483167 markings, 523358 edges, 3522 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 502478 markings, 545018 edges, 3862 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 518628 markings, 563142 edges, 3230 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 541949 markings, 589315 edges, 4664 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 557956 markings, 607274 edges, 3201 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 573935 markings, 625200 edges, 3196 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 590333 markings, 643603 edges, 3280 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 601850 markings, 656519 edges, 2303 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 617818 markings, 674448 edges, 3194 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 634178 markings, 691944 edges, 3272 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 650730 markings, 709390 edges, 3310 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 666852 markings, 726181 edges, 3224 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 682730 markings, 742607 edges, 3176 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 698737 markings, 759166 edges, 3201 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 714717 markings, 775766 edges, 3196 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 730683 markings, 793692 edges, 3193 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 746816 markings, 811793 edges, 3227 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 763856 markings, 830911 edges, 3408 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 780859 markings, 849983 edges, 3401 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 796892 markings, 867978 edges, 3207 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 812843 markings, 885866 edges, 3190 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 829917 markings, 905027 edges, 3415 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 850432 markings, 928043 edges, 4103 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 871021 markings, 951148 edges, 4118 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 892883 markings, 975685 edges, 4372 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 918339 markings, 1004235 edges, 5091 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 934279 markings, 1022134 edges, 3188 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 950500 markings, 1040326 edges, 3244 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 966500 markings, 1058290 edges, 3200 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 983882 markings, 1077776 edges, 3476 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 998865 markings, 1094594 edges, 2997 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 1014066 markings, 1111644 edges, 3040 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 1029954 markings, 1129479 edges, 3178 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 1045876 markings, 1147344 edges, 3184 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 1061364 markings, 1163922 edges, 3098 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 1076052 markings, 1179404 edges, 2938 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 1092454 markings, 1196535 edges, 3280 markings/sec, 325 secs
lola: sara is running 330 secs || sara is running 330 secs || 1108663 markings, 1213303 edges, 3242 markings/sec, 330 secs
lola: sara is running 335 secs || sara is running 335 secs || 1121789 markings, 1226882 edges, 2625 markings/sec, 335 secs
lola: sara is running 340 secs || sara is running 340 secs || 1142783 markings, 1248698 edges, 4199 markings/sec, 340 secs
lola: sara is running 345 secs || sara is running 345 secs || 1175802 markings, 1285742 edges, 6604 markings/sec, 345 secs
lola: sara is running 350 secs || sara is running 350 secs || 1199766 markings, 1312646 edges, 4793 markings/sec, 350 secs
lola: sara is running 355 secs || sara is running 355 secs || 1232648 markings, 1349535 edges, 6576 markings/sec, 355 secs
lola: sara is running 360 secs || sara is running 360 secs || 1252861 markings, 1372218 edges, 4043 markings/sec, 360 secs
lola: sara is running 365 secs || sara is running 365 secs || 1268406 markings, 1389652 edges, 3109 markings/sec, 365 secs
lola: sara is running 370 secs || sara is running 370 secs || 1284359 markings, 1407545 edges, 3191 markings/sec, 370 secs
lola: sara is running 375 secs || sara is running 375 secs || 1299286 markings, 1424303 edges, 2985 markings/sec, 375 secs
lola: sara is running 380 secs || sara is running 380 secs || 1315213 markings, 1442163 edges, 3185 markings/sec, 380 secs
lola: sara is running 385 secs || sara is running 385 secs || 1331209 markings, 1460121 edges, 3199 markings/sec, 385 secs
lola: sara is running 390 secs || sara is running 390 secs || 1351541 markings, 1482925 edges, 4066 markings/sec, 390 secs
lola: sara is running 395 secs || sara is running 395 secs || 1384112 markings, 1519471 edges, 6514 markings/sec, 395 secs
lola: sara is running 400 secs || sara is running 400 secs || 1402743 markings, 1540387 edges, 3726 markings/sec, 400 secs
lola: sara is running 405 secs || sara is running 405 secs || 1420306 markings, 1560087 edges, 3513 markings/sec, 405 secs
lola: sara is running 410 secs || sara is running 410 secs || 1444699 markings, 1587467 edges, 4879 markings/sec, 410 secs
lola: Child process aborted or communication problem between parent and child process
lola: Cannot launch process for handling subproblem
lola: Cannot launch process for handling subproblem
lola: Cannot launch process for handling subproblem
lola: Cannot launch process for handling subproblem
lola: Cannot launch process for handling subproblem
lola: Cannot launch process for handling subproblem
lola: RESULT
lola:
SUMMARY: no unknown no yes unknown yes yes no yes yes no unknown unknown unknown no
lola:
preliminary result: no unknown no yes unknown yes yes no yes yes no unknown unknown unknown no
Segmentation fault
rslt: finished
BK_STOP 1552777314095
--------------------
content from stderr:
make: [verify] Error 139 (ignored)
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="NeighborGrid-PT-d5n4m1t35"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
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
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool lola"
echo " Input is NeighborGrid-PT-d5n4m1t35, 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 r104-oct2-155272225400112"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NeighborGrid-PT-d5n4m1t35.tgz
mv NeighborGrid-PT-d5n4m1t35 execution
cd execution
if [ "CTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "CTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
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 '
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 ;