About the Execution of ITS-LoLa for AirplaneLD-PT-0100
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15742.200 | 3600000.00 | 2305163.00 | 5842.30 | TFTFFTFTFTFTTFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2020-input.r166-smll-158987787500268.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is AirplaneLD-PT-0100, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r166-smll-158987787500268
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 18K Mar 24 10:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Mar 24 10:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 21K Mar 24 09:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 90K Mar 24 09:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 49K Apr 8 14:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 29 06:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Apr 8 14:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 29 06:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 52K Mar 24 07:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Mar 24 07:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 22K Mar 24 06:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Mar 24 06:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 24 08:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 24 08:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 796K Mar 24 05:37 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 AirplaneLD-PT-0100-CTLFireability-00
FORMULA_NAME AirplaneLD-PT-0100-CTLFireability-01
FORMULA_NAME AirplaneLD-PT-0100-CTLFireability-02
FORMULA_NAME AirplaneLD-PT-0100-CTLFireability-03
FORMULA_NAME AirplaneLD-PT-0100-CTLFireability-04
FORMULA_NAME AirplaneLD-PT-0100-CTLFireability-05
FORMULA_NAME AirplaneLD-PT-0100-CTLFireability-06
FORMULA_NAME AirplaneLD-PT-0100-CTLFireability-07
FORMULA_NAME AirplaneLD-PT-0100-CTLFireability-08
FORMULA_NAME AirplaneLD-PT-0100-CTLFireability-09
FORMULA_NAME AirplaneLD-PT-0100-CTLFireability-10
FORMULA_NAME AirplaneLD-PT-0100-CTLFireability-11
FORMULA_NAME AirplaneLD-PT-0100-CTLFireability-12
FORMULA_NAME AirplaneLD-PT-0100-CTLFireability-13
FORMULA_NAME AirplaneLD-PT-0100-CTLFireability-14
FORMULA_NAME AirplaneLD-PT-0100-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1591377641222
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 17:20:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-05 17:20:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 17:20:44] [INFO ] Load time of PNML (sax parser for PT used): 295 ms
[2020-06-05 17:20:44] [INFO ] Transformed 719 places.
[2020-06-05 17:20:44] [INFO ] Transformed 808 transitions.
[2020-06-05 17:20:44] [INFO ] Found NUPN structural information;
[2020-06-05 17:20:44] [INFO ] Parsed PT model containing 719 places and 808 transitions in 396 ms.
Reduce places removed 302 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 103 ms.
Incomplete random walk after 100000 steps, including 12580 resets, run finished after 3416 ms. (steps per millisecond=29 ) properties seen :[0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1]
// Phase 1: matrix 808 rows 417 cols
[2020-06-05 17:20:48] [INFO ] Computed 3 place invariants in 87 ms
[2020-06-05 17:20:48] [INFO ] [Real]Absence check using 2 positive place invariants in 27 ms returned unsat
[2020-06-05 17:20:48] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned unsat
[2020-06-05 17:20:49] [INFO ] [Real]Absence check using 2 positive place invariants in 21 ms returned sat
[2020-06-05 17:20:49] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 17 ms returned sat
[2020-06-05 17:20:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 17:20:50] [INFO ] [Real]Absence check using state equation in 1010 ms returned sat
[2020-06-05 17:20:50] [INFO ] Computed and/alt/rep : 404/15806/404 causal constraints in 168 ms.
[2020-06-05 17:20:50] [INFO ] Added : 2 causal constraints over 1 iterations in 357 ms. Result :sat
[2020-06-05 17:20:51] [INFO ] [Real]Absence check using 2 positive place invariants in 20 ms returned unsat
[2020-06-05 17:20:51] [INFO ] [Real]Absence check using 2 positive place invariants in 16 ms returned sat
[2020-06-05 17:20:51] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 14 ms returned sat
[2020-06-05 17:20:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 17:20:52] [INFO ] [Real]Absence check using state equation in 871 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 4 simplifications.
[2020-06-05 17:20:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-05 17:20:52] [INFO ] Flatten gal took : 219 ms
[2020-06-05 17:20:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-05 17:20:52] [INFO ] Flatten gal took : 139 ms
FORMULA AirplaneLD-PT-0100-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 17:20:52] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 18 ms.
[2020-06-05 17:20:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 12 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ AirplaneLD-PT-0100 @ 3570 seconds
FORMULA AirplaneLD-PT-0100-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0100-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0100-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0100-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0100-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0100-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0100-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0100-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0100-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0100-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0100-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0100-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0100-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0100-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0100-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1299
rslt: Output for CTLFireability @ AirplaneLD-PT-0100
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri Jun 5 17:20:53 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 235
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 28
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 252
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 2,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "EX((EG((((p413 <= 0)))) AND ((p413 <= 0))))",
"processed_size": 43,
"rewrites": 30
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 301,
"markings": 302,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 271
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 271
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p210) AND (1 <= p248))",
"processed_size": 29,
"rewrites": 28
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 294
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "AG(EX(((p415 <= 0))))",
"processed_size": 21,
"rewrites": 30
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 294
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 294
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= p415))",
"processed_size": 13,
"rewrites": 28
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 321
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "EG(((((1 <= p210) AND (1 <= p285)) OR ((1 <= p415)) OR (p416 <= 0)) OR EX(((1 <= p311) AND (1 <= p358)))))",
"processed_size": 108,
"rewrites": 30
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 378,
"markings": 379,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 321
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 5,
"adisj": 2,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A(EX((((1 <= p416)) OR ((1 <= p415)))) U (AF(((1 <= p311) AND (1 <= p375))) AND (((1 <= p415)) OR ((1 <= p9) AND (1 <= p58) AND (1 <= p46)))))",
"processed_size": 144,
"rewrites": 31
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 21,
"markings": 11,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 361
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 50,
"adisj": 1,
"aneg": 1,
"comp": 100,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 100,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 52,
"visible_transitions": 0
},
"processed": "A (G ((((p6 <= 0) OR (p7 <= 0)) AND ((p311 <= 0) OR (p385 <= 0)) AND ((p311 <= 0) OR (p387 <= 0)) AND ((p311 <= 0) OR (p389 <= 0)) AND ((p311 <= 0) OR (p391 <= 0)) AND ((p311 <= 0) OR (p377 <= 0)) AND ((p311 <= 0) OR (p379 <= 0)) AND ((p311 <= 0) OR (p381 <= 0)) AND ((p311 <= 0) OR (p383 <= 0)) AND ((p311 <= 0) OR (p369 <= 0)) AND ((p311 <= 0) OR (p371 <= 0)) AND ((p311 <= 0) OR (p373 <= 0)) AND ((p311 <= 0) OR (p375 <= 0)) AND ((p311 <= 0) OR (p363 <= 0)) AND ((p311 <= 0) OR (p365 <= 0)) AND ((p311 <= 0) OR (p367 <= 0)) AND ((p311 <= 0) OR (p409 <= 0)) AND ((p311 <= 0) OR (p401 <= 0)) AND ((p311 <= 0) OR (p403 <= 0)) AND ((p311 <= 0) OR (p405 <= 0)) AND ((p311 <= 0) OR (p407 <= 0)) AND ((p311 <= 0) OR (p393 <= 0)) AND ((p311 <= 0) OR (p395 <= 0)) AND ((p311 <= 0) OR (p397 <= 0)) AND ((p311 <= 0) OR (p399 <= 0)) AND ((p311 <= 0) OR (p386 <= 0)) AND ((p311 <= 0) OR (p388 <= 0)) AND ((p311 <= 0) OR (p390 <= 0)) AND ((p311 <= 0) OR (p392 <= 0)) AND ((p311 <= 0) OR (p378 <= 0)) AND ((p311 <= 0) OR (p380 <= 0)) AND ((p311 <= 0) OR (p382 <= 0)) AND ((p311 <= 0) OR (p384 <= 0)) AND ((p311 <= 0) OR (p370 <= 0)) AND ((p311 <= 0) OR (p372 <= 0)) AND ((p311 <= 0) OR (p374 <= 0)) AND ((p311 <= 0) OR (p376 <= 0)) AND ((p311 <= 0) OR (p362 <= 0)) AND ((p311 <= 0) OR (p364 <= 0)) AND ((p311 <= 0) OR (p366 <= 0)) AND ((p311 <= 0) OR (p368 <= 0)) AND ((p311 <= 0) OR (p410 <= 0)) AND ((p311 <= 0) OR (p402 <= 0)) AND ((p311 <= 0) OR (p404 <= 0)) AND ((p311 <= 0) OR (p406 <= 0)) AND ((p311 <= 0) OR (p408 <= 0)) AND ((p311 <= 0) OR (p394 <= 0)) AND ((p311 <= 0) OR (p396 <= 0)) AND ((p311 <= 0) OR (p398 <= 0)) AND ((p311 <= 0) OR (p400 <= 0)))))",
"processed_size": 1701,
"rewrites": 30
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 100,
"problems": 50
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 412
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 51,
"adisj": 1,
"aneg": 0,
"comp": 102,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 102,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 52,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p210) AND (1 <= p213)) OR ((1 <= p210) AND (1 <= p211)) OR ((1 <= p210) AND (1 <= p221)) OR ((1 <= p210) AND (1 <= p219)) OR ((1 <= p210) AND (1 <= p217)) OR ((1 <= p210) AND (1 <= p215)) OR ((1 <= p210) AND (1 <= p229)) OR ((1 <= p210) AND (1 <= p227)) OR ((1 <= p210) AND (1 <= p233)) OR ((1 <= p210) AND (1 <= p225)) OR ((1 <= p210) AND (1 <= p235)) OR ((1 <= p210) AND (1 <= p223)) OR ((1 <= p210) AND (1 <= p237)) OR ((1 <= p210) AND (1 <= p231)) OR ((1 <= p210) AND (1 <= p247)) OR ((1 <= p210) AND (1 <= p310)) OR ((1 <= p210) AND (1 <= p249)) OR ((1 <= p210) AND (1 <= p251)) OR ((1 <= p210) AND (1 <= p253)) OR ((1 <= p210) AND (1 <= p239)) OR ((1 <= p210) AND (1 <= p241)) OR ((1 <= p210) AND (1 <= p243)) OR ((1 <= p210) AND (1 <= p245)) OR ((1 <= p210) AND (1 <= p255)) OR ((1 <= p210) AND (1 <= p257)) OR ((1 <= p210) AND (1 <= p259)) OR ((1 <= p210) AND (1 <= p212)) OR ((1 <= p210) AND (1 <= p220)) OR ((1 <= p210) AND (1 <= p218)) OR ((1 <= p210) AND (1 <= p216)) OR ((1 <= p210) AND (1 <= p214)) OR ((1 <= p210) AND (1 <= p228)) OR ((1 <= p210) AND (1 <= p226)) OR ((1 <= p210) AND (1 <= p234)) OR ((1 <= p210) AND (1 <= p224)) OR ((1 <= p210) AND (1 <= p236)) OR ((1 <= p210) AND (1 <= p222)) OR ((1 <= p210) AND (1 <= p232)) OR ((1 <= p210) AND (1 <= p230)) OR ((1 <= p210) AND (1 <= p246)) OR ((1 <= p210) AND (1 <= p248)) OR ((1 <= p210) AND (1 <= p250)) OR ((1 <= p210) AND (1 <= p252)) OR ((1 <= p210) AND (1 <= p238)) OR ((1 <= p210) AND (1 <= p240)) OR ((1 <= p210) AND (1 <= p242)) OR ((1 <= p210) AND (1 <= p244)) OR ((1 <= p210) AND (1 <= p254)) OR ((1 <= p210) AND (1 <= p256)) OR ((1 <= p210) AND (1 <= p258)) OR ((1 <= p210) AND (1 <= p260)))))",
"processed_size": 1739,
"rewrites": 29
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 102,
"problems": 51
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 481
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (G ((((1 <= p413)) OR ((1 <= p1) AND (1 <= p2)))))",
"processed_size": 53,
"rewrites": 29
},
"result":
{
"edges": 14010100,
"markings": 14010101,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 542
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((p414 <= 0))",
"processed_size": 13,
"rewrites": 32
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space /EGEF",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 0
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_invariance",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 678
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 678
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (G (((1 <= p414))))",
"processed_size": 21,
"rewrites": 29
},
"result":
{
"edges": 40412,
"markings": 40413,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 200
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 898
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 898
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p1) AND (1 <= p2))",
"processed_size": 25,
"rewrites": 28
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1347
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 101,
"aneg": 0,
"comp": 202,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 202,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 102,
"visible_transitions": 0
},
"processed": "E (G ((((p9 <= 0) OR (p139 <= 0)) AND ((p9 <= 0) OR (p204 <= 0)) AND ((p9 <= 0) OR (p135 <= 0)) AND ((p9 <= 0) OR (p200 <= 0)) AND ((p9 <= 0) OR (p147 <= 0)) AND ((p9 <= 0) OR (p143 <= 0)) AND ((p9 <= 0) OR (p208 <= 0)) AND ((p9 <= 0) OR (p123 <= 0)) AND ((p9 <= 0) OR (p188 <= 0)) AND ((p9 <= 0) OR (p119 <= 0)) AND ((p9 <= 0) OR (p184 <= 0)) AND ((p9 <= 0) OR (p131 <= 0)) AND ((p9 <= 0) OR (p196 <= 0)) AND ((p9 <= 0) OR (p127 <= 0)) AND ((p9 <= 0) OR (p192 <= 0)) AND ((p9 <= 0) OR (p172 <= 0)) AND ((p9 <= 0) OR (p168 <= 0)) AND ((p9 <= 0) OR (p115 <= 0)) AND ((p9 <= 0) OR (p180 <= 0)) AND ((p9 <= 0) OR (p111 <= 0)) AND ((p9 <= 0) OR (p176 <= 0)) AND ((p9 <= 0) OR (p156 <= 0)) AND ((p9 <= 0) OR (p152 <= 0)) AND ((p9 <= 0) OR (p164 <= 0)) AND ((p9 <= 0) OR (p160 <= 0)) AND ((p9 <= 0) OR (p142 <= 0)) AND ((p9 <= 0) OR (p203 <= 0)) AND ((p9 <= 0) OR (p138 <= 0)) AND ((p9 <= 0) OR (p199 <= 0)) AND ((p9 <= 0) OR (p150 <= 0)) AND ((p9 <= 0) OR (p146 <= 0)) AND ((p9 <= 0) OR (p207 <= 0)) AND ((p9 <= 0) OR (p126 <= 0)) AND ((p9 <= 0) OR (p187 <= 0)) AND ((p9 <= 0) OR (p122 <= 0)) AND ((p9 <= 0) OR (p183 <= 0)) AND ((p9 <= 0) OR (p134 <= 0)) AND ((p9 <= 0) OR (p195 <= 0)) AND ((p9 <= 0) OR (p130 <= 0)) AND ((p9 <= 0) OR (p191 <= 0)) AND ((p9 <= 0) OR (p110 <= 0)) AND ((p9 <= 0) OR (p171 <= 0)) AND ((p9 <= 0) OR (p167 <= 0)) AND ((p9 <= 0) OR (p118 <= 0)) AND ((p9 <= 0) OR (p179 <= 0)) AND ((p9 <= 0) OR (p114 <= 0)) AND ((p9 <= 0) OR (p175 <= 0)) AND ((p9 <= 0) OR (p155 <= 0)) AND ((p9 <= 0) OR (p151 <= 0)) AND ((p9 <= 0) OR (p163 <= 0)) AND ((p9 <= 0) OR (p159 <= 0)) AND ((p9 <= 0) OR (p141 <= 0)) AND ((p9 <= 0) OR (p206 <= 0)) AND ((p9 <= 0) OR (p137 <= 0)) AND ((p9 <= 0) OR (p202 <= 0)) AND ((p9 <= 0) OR (p149 <= 0)) AND ((p9 <= 0) OR (p145 <= 0)) AND ((p9 <= 0) OR (p190 <= 0)) AND ((p9 <= 0) OR (p125 <= 0)) AND ((p9 <= 0) OR (p186 <= 0)) AND ((p9 <= 0) OR (p121 <= 0)) AND ((p9 <= 0) OR (p133 <= 0)) AND ((p9 <= 0) OR (p198 <= 0)) AND ((p9 <= 0) OR (p129 <= 0)) AND ((p9 <= 0) OR (p194 <= 0)) AND ((p9 <= 0) OR (p174 <= 0)) AND ((p9 <= 0) OR (p109 <= 0)) AND ((p9 <= 0) OR (p170 <= 0)) AND ((p9 <= 0) OR (p182 <= 0)) AND ((p9 <= 0) OR (p117 <= 0)) AND ((p9 <= 0) OR (p178 <= 0)) AND ((p9 <= 0) OR (p113 <= 0)) AND ((p9 <= 0) OR (p158 <= 0)) AND ((p9 <= 0) OR (p154 <= 0)) AND ((p9 <= 0) OR (p166 <= 0)) AND ((p9 <= 0) OR (p162 <= 0)) AND ((p9 <= 0) OR (p205 <= 0)) AND ((p9 <= 0) OR (p140 <= 0)) AND ((p9 <= 0) OR (p201 <= 0)) AND ((p9 <= 0) OR (p136 <= 0)) AND ((p9 <= 0) OR (p148 <= 0)) AND ((p9 <= 0) OR (p209 <= 0)) AND ((p9 <= 0) OR (p144 <= 0)) AND ((p9 <= 0) OR (p124 <= 0)) AND ((p9 <= 0) OR (p189 <= 0)) AND ((p9 <= 0) OR (p120 <= 0)) AND ((p9 <= 0) OR (p185 <= 0)) AND ((p9 <= 0) OR (p197 <= 0)) AND ((p9 <= 0) OR (p132 <= 0)) AND ((p9 <= 0) OR (p193 <= 0)) AND ((p9 <= 0) OR (p128 <= 0)) AND ((p9 <= 0) OR (p173 <= 0)) AND ((p9 <= 0) OR (p169 <= 0)) AND ((p9 <= 0) OR (p116 <= 0)) AND ((p9 <= 0) OR (p181 <= 0)) AND ((p9 <= 0) OR (p112 <= 0)) AND ((p9 <= 0) OR (p177 <= 0)) AND ((p9 <= 0) OR (p157 <= 0)) AND ((p9 <= 0) OR (p153 <= 0)) AND ((p9 <= 0) OR (p165 <= 0)) AND ((p9 <= 0) OR (p161 <= 0)))))",
"processed_size": 3237,
"rewrites": 29
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 302
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 202,
"problems": 101
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1347
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1347
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p210) AND (1 <= p224))))",
"processed_size": 37,
"rewrites": 29
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2695
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2695
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 51,
"aneg": 0,
"comp": 101,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 101,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 52,
"visible_transitions": 0
},
"processed": "(((p415 <= 0) OR (p413 <= 0)) AND ((p415 <= 0) OR (((p311 <= 0) OR (p385 <= 0)) AND ((p311 <= 0) OR (p387 <= 0)) AND ((p311 <= 0) OR (p389 <= 0)) AND ((p311 <= 0) OR (p391 <= 0)) AND ((p311 <= 0) OR (p377 <= 0)) AND ((p311 <= 0) OR (p379 <= 0)) AND ((p311 <= 0) OR (p381 <= 0)) AND ((p311 <= 0) OR (p383 <= 0)) AND ((p311 <= 0) OR (p369 <= 0)) AND ((p311 <= 0) OR (p371 <= 0)) AND ((p311 <= 0) OR (p373 <= 0)) AND ((p311 <= 0) OR (p375 <= 0)) AND ((p311 <= 0) OR (p363 <= 0)) AND ((p311 <= 0) OR (p365 <= 0)) AND ((p311 <= 0) OR (p367 <= 0)) AND ((p311 <= 0) OR (p409 <= 0)) AND ((p311 <= 0) OR (p401 <= 0)) AND ((p311 <= 0) OR (p403 <= 0)) AND ((p311 <= 0) OR (p405 <= 0)) AND ((p311 <= 0) OR (p407 <= 0)) AND ((p311 <= 0) OR (p393 <= 0)) AND ((p311 <= 0) OR (p395 <= 0)) AND ((p311 <= 0) OR (p397 <= 0)) AND ((p311 <= 0) OR (p399 <= 0)) AND ((p311 <= 0) OR (p386 <= 0)) AND ((p311 <= 0) OR (p388 <= 0)) AND ((p311 <= 0) OR (p390 <= 0)) AND ((p311 <= 0) OR (p392 <= 0)) AND ((p311 <= 0) OR (p378 <= 0)) AND ((p311 <= 0) OR (p380 <= 0)) AND ((p311 <= 0) OR (p382 <= 0)) AND ((p311 <= 0) OR (p384 <= 0)) AND ((p311 <= 0) OR (p370 <= 0)) AND ((p311 <= 0) OR (p372 <= 0)) AND ((p311 <= 0) OR (p374 <= 0)) AND ((p311 <= 0) OR (p376 <= 0)) AND ((p311 <= 0) OR (p362 <= 0)) AND ((p311 <= 0) OR (p364 <= 0)) AND ((p311 <= 0) OR (p366 <= 0)) AND ((p311 <= 0) OR (p368 <= 0)) AND ((p311 <= 0) OR (p410 <= 0)) AND ((p311 <= 0) OR (p402 <= 0)) AND ((p311 <= 0) OR (p404 <= 0)) AND ((p311 <= 0) OR (p406 <= 0)) AND ((p311 <= 0) OR (p408 <= 0)) AND ((p311 <= 0) OR (p394 <= 0)) AND ((p311 <= 0) OR (p396 <= 0)) AND ((p311 <= 0) OR (p398 <= 0)) AND ((p311 <= 0) OR (p400 <= 0)))))",
"processed_size": 1717,
"rewrites": 28
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},
{
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "AF((AX(((p311 <= 0) OR (p365 <= 0))) AND ((p414 <= 0))))",
"processed_size": 57,
"rewrites": 30
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 35271624,
"markings": 34856817,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AF(AX(((1 <= p6) AND (1 <= p7))))",
"processed_size": 33,
"rewrites": 30
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 153007424,
"markings": 34877423,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 51,
"aneg": 0,
"comp": 101,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 101,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 52,
"visible_transitions": 0
},
"processed": "(((p415 <= 0) OR (p413 <= 0)) AND ((p415 <= 0) OR (((p311 <= 0) OR (p385 <= 0)) AND ((p311 <= 0) OR (p387 <= 0)) AND ((p311 <= 0) OR (p389 <= 0)) AND ((p311 <= 0) OR (p391 <= 0)) AND ((p311 <= 0) OR (p377 <= 0)) AND ((p311 <= 0) OR (p379 <= 0)) AND ((p311 <= 0) OR (p381 <= 0)) AND ((p311 <= 0) OR (p383 <= 0)) AND ((p311 <= 0) OR (p369 <= 0)) AND ((p311 <= 0) OR (p371 <= 0)) AND ((p311 <= 0) OR (p373 <= 0)) AND ((p311 <= 0) OR (p375 <= 0)) AND ((p311 <= 0) OR (p363 <= 0)) AND ((p311 <= 0) OR (p365 <= 0)) AND ((p311 <= 0) OR (p367 <= 0)) AND ((p311 <= 0) OR (p409 <= 0)) AND ((p311 <= 0) OR (p401 <= 0)) AND ((p311 <= 0) OR (p403 <= 0)) AND ((p311 <= 0) OR (p405 <= 0)) AND ((p311 <= 0) OR (p407 <= 0)) AND ((p311 <= 0) OR (p393 <= 0)) AND ((p311 <= 0) OR (p395 <= 0)) AND ((p311 <= 0) OR (p397 <= 0)) AND ((p311 <= 0) OR (p399 <= 0)) AND ((p311 <= 0) OR (p386 <= 0)) AND ((p311 <= 0) OR (p388 <= 0)) AND ((p311 <= 0) OR (p390 <= 0)) AND ((p311 <= 0) OR (p392 <= 0)) AND ((p311 <= 0) OR (p378 <= 0)) AND ((p311 <= 0) OR (p380 <= 0)) AND ((p311 <= 0) OR (p382 <= 0)) AND ((p311 <= 0) OR (p384 <= 0)) AND ((p311 <= 0) OR (p370 <= 0)) AND ((p311 <= 0) OR (p372 <= 0)) AND ((p311 <= 0) OR (p374 <= 0)) AND ((p311 <= 0) OR (p376 <= 0)) AND ((p311 <= 0) OR (p362 <= 0)) AND ((p311 <= 0) OR (p364 <= 0)) AND ((p311 <= 0) OR (p366 <= 0)) AND ((p311 <= 0) OR (p368 <= 0)) AND ((p311 <= 0) OR (p410 <= 0)) AND ((p311 <= 0) OR (p402 <= 0)) AND ((p311 <= 0) OR (p404 <= 0)) AND ((p311 <= 0) OR (p406 <= 0)) AND ((p311 <= 0) OR (p408 <= 0)) AND ((p311 <= 0) OR (p394 <= 0)) AND ((p311 <= 0) OR (p396 <= 0)) AND ((p311 <= 0) OR (p398 <= 0)) AND ((p311 <= 0) OR (p400 <= 0)))))",
"processed_size": 1717,
"rewrites": 28
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 17,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 99,
"adisj": 1,
"aneg": 1,
"comp": 198,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 198,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 100,
"visible_transitions": 0
},
"processed": "A (G ((((p9 <= 0) OR (p13 <= 0)) AND ((p9 <= 0) OR (p78 <= 0)) AND ((p9 <= 0) OR (p74 <= 0)) AND ((p9 <= 0) OR (p21 <= 0)) AND ((p9 <= 0) OR (p86 <= 0)) AND ((p9 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p82 <= 0)) AND ((p9 <= 0) OR (p62 <= 0)) AND ((p9 <= 0) OR (p58 <= 0)) AND ((p9 <= 0) OR (p70 <= 0)) AND ((p9 <= 0) OR (p66 <= 0)) AND ((p9 <= 0) OR (p107 <= 0)) AND ((p9 <= 0) OR (p46 <= 0)) AND ((p9 <= 0) OR (p103 <= 0)) AND ((p9 <= 0) OR (p42 <= 0)) AND ((p9 <= 0) OR (p54 <= 0)) AND ((p9 <= 0) OR (p50 <= 0)) AND ((p9 <= 0) OR (p91 <= 0)) AND ((p9 <= 0) OR (p30 <= 0)) AND ((p9 <= 0) OR (p87 <= 0)) AND ((p9 <= 0) OR (p26 <= 0)) AND ((p9 <= 0) OR (p99 <= 0)) AND ((p9 <= 0) OR (p38 <= 0)) AND ((p9 <= 0) OR (p95 <= 0)) AND ((p9 <= 0) OR (p34 <= 0)) AND ((p9 <= 0) OR (p12 <= 0)) AND ((p9 <= 0) OR (p77 <= 0)) AND ((p9 <= 0) OR (p73 <= 0)) AND ((p9 <= 0) OR (p20 <= 0)) AND ((p9 <= 0) OR (p85 <= 0)) AND ((p9 <= 0) OR (p16 <= 0)) AND ((p9 <= 0) OR (p81 <= 0)) AND ((p9 <= 0) OR (p61 <= 0)) AND ((p9 <= 0) OR (p57 <= 0)) AND ((p9 <= 0) OR (p69 <= 0)) AND ((p9 <= 0) OR (p65 <= 0)) AND ((p9 <= 0) OR (p45 <= 0)) AND ((p9 <= 0) OR (p41 <= 0)) AND ((p9 <= 0) OR (p106 <= 0)) AND ((p9 <= 0) OR (p53 <= 0)) AND ((p9 <= 0) OR (p49 <= 0)) AND ((p9 <= 0) OR (p29 <= 0)) AND ((p9 <= 0) OR (p94 <= 0)) AND ((p9 <= 0) OR (p25 <= 0)) AND ((p9 <= 0) OR (p90 <= 0)) AND ((p9 <= 0) OR (p37 <= 0)) AND ((p9 <= 0) OR (p102 <= 0)) AND ((p9 <= 0) OR (p33 <= 0)) AND ((p9 <= 0) OR (p98 <= 0)) AND ((p9 <= 0) OR (p11 <= 0)) AND ((p9 <= 0) OR (p76 <= 0)) AND ((p9 <= 0) OR (p72 <= 0)) AND ((p9 <= 0) OR (p19 <= 0)) AND ((p9 <= 0) OR (p84 <= 0)) AND ((p9 <= 0) OR (p15 <= 0)) AND ((p9 <= 0) OR (p80 <= 0)) AND ((p9 <= 0) OR (p60 <= 0)) AND ((p9 <= 0) OR (p56 <= 0)) AND ((p9 <= 0) OR (p68 <= 0)) AND ((p9 <= 0) OR (p64 <= 0)) AND ((p9 <= 0) OR (p44 <= 0)) AND ((p9 <= 0) OR (p40 <= 0)) AND ((p9 <= 0) OR (p105 <= 0)) AND ((p9 <= 0) OR (p52 <= 0)) AND ((p9 <= 0) OR (p48 <= 0)) AND ((p9 <= 0) OR (p28 <= 0)) AND ((p9 <= 0) OR (p93 <= 0)) AND ((p9 <= 0) OR (p24 <= 0)) AND ((p9 <= 0) OR (p89 <= 0)) AND ((p9 <= 0) OR (p36 <= 0)) AND ((p9 <= 0) OR (p101 <= 0)) AND ((p9 <= 0) OR (p32 <= 0)) AND ((p9 <= 0) OR (p97 <= 0)) AND ((p9 <= 0) OR (p75 <= 0)) AND ((p9 <= 0) OR (p14 <= 0)) AND ((p9 <= 0) OR (p71 <= 0)) AND ((p9 <= 0) OR (p10 <= 0)) AND ((p9 <= 0) OR (p83 <= 0)) AND ((p9 <= 0) OR (p22 <= 0)) AND ((p9 <= 0) OR (p79 <= 0)) AND ((p9 <= 0) OR (p18 <= 0)) AND ((p9 <= 0) OR (p59 <= 0)) AND ((p9 <= 0) OR (p55 <= 0)) AND ((p9 <= 0) OR (p67 <= 0)) AND ((p9 <= 0) OR (p63 <= 0)) AND ((p9 <= 0) OR (p43 <= 0)) AND ((p9 <= 0) OR (p108 <= 0)) AND ((p9 <= 0) OR (p39 <= 0)) AND ((p9 <= 0) OR (p104 <= 0)) AND ((p9 <= 0) OR (p51 <= 0)) AND ((p9 <= 0) OR (p47 <= 0)) AND ((p9 <= 0) OR (p27 <= 0)) AND ((p9 <= 0) OR (p92 <= 0)) AND ((p9 <= 0) OR (p23 <= 0)) AND ((p9 <= 0) OR (p88 <= 0)) AND ((p9 <= 0) OR (p35 <= 0)) AND ((p9 <= 0) OR (p100 <= 0)) AND ((p9 <= 0) OR (p31 <= 0)) AND ((p9 <= 0) OR (p96 <= 0)))))",
"processed_size": 3083,
"rewrites": 30
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 357852,
"runtime": 2271.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(*)) : (E(G(**)) OR **) : (A(G(*)) OR **) : E(X((E(G(*)) AND **))) : E(G(**)) : TRUE : (A(G(E(X(**)))) OR **) : (E(F(**)) OR E(F((A(G(**)) AND A(G(**)))))) : (E(G(**)) AND E(F(E(G(*))))) : (E(G((** OR E(X(**))))) AND **) : A(F((A(X(*)) AND **))) : A(F(A(G(*)))) : A(F(A(X(**)))) : A((E(X(**)) U (A(F(**)) AND **)))"
},
"net":
{
"arcs": 2270,
"conflict_clusters": 13,
"places": 417,
"places_significant": 414,
"singleton_clusters": 0,
"transitions": 808
},
"result":
{
"preliminary_value": "yes no yes no yes no yes no yes no yes yes no yes no ",
"value": "yes no yes no yes no yes no yes no yes yes no yes no "
},
"task":
{
"type": "compound"
}
}
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: 1225/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 13344
lola: finding significant places
lola: 417 places, 808 transitions, 414 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 CTLFireability.xml
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p211 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p221 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p219 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p215 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p229 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p227 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p233 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p225 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p235 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p223 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p237 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p231 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p247 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p310 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p249 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p251 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p253 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p239 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p241 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p243 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p245 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p255 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p257 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p259 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p212 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p220 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p218 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p216 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p228 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p226 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p234 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p224 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p236 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p222 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p232 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p230 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p246 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p248 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p250 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p252 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p238 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p240 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p242 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p244 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p254 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p256 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p258 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p260 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p385 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p387 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p389 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p391 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p377 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p379 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p381 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p383 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p369 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p371 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p373 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p375 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p363 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p365 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p367 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p409 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p401 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p403 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p405 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p407 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p393 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p395 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p397 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p399 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p386 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p388 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p390 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p392 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p378 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p380 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p382 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p384 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p370 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p372 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p374 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p376 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p362 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p364 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p366 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p368 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p410 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p402 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p404 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p406 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p408 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p394 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p396 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p398 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p400 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p135 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p200 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p147 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p143 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p208 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p123 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p188 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p119 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p184 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p131 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p196 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p127 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p192 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p172 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p168 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p180 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p176 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p156 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p152 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p164 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p160 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p142 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p203 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p138 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p199 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p150 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p146 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p207 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p126 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p187 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p183 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p134 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p195 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p191 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p171 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p118 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p179 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p175 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p155 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p151 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p163 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p159 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p141 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p206 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p137 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p202 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p149 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p145 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p190 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p186 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p133 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p198 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p129 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p194 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p174 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p170 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p182 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p117 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p178 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p158 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p154 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p166 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p162 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p205 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p140 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p201 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p136 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p148 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p209 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p144 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p189 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p185 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p197 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p132 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p193 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p128 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p173 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p169 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p181 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p177 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p157 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p153 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p165 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p161 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p82 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p415 <= 1)
lola: LP says that atomic proposition is always true: (p413 <= 1)
lola: LP says that atomic proposition is always true: (p415 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p385 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p387 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p389 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p391 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p377 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p379 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p381 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p383 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p369 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p371 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p373 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p375 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p363 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p365 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p367 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p409 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p401 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p403 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p405 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p407 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p393 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p395 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p397 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p399 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p386 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p388 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p390 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p392 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p378 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p380 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p382 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p384 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p370 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p372 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p374 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p376 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p362 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p364 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p366 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p368 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p410 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p402 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p404 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p406 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p408 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p394 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p396 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p398 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p400 <= 1)
lola: LP says that atomic proposition is always true: (p413 <= 1)
lola: LP says that atomic proposition is always true: (p413 <= 1)
lola: LP says that atomic proposition is always true: (p413 <= 1)
lola: LP says that atomic proposition is always true: (p413 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p415 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p248 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p224 <= 1)
lola: LP says that atomic proposition is always true: (p416 <= 1)
lola: LP says that atomic proposition is always true: (p415 <= 1)
lola: LP says that atomic proposition is always true: (p414 <= 1)
lola: LP says that atomic proposition is always true: (p414 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p285 <= 1)
lola: LP says that atomic proposition is always true: (p415 <= 1)
lola: LP says that atomic proposition is always true: (p416 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p358 <= 1)
lola: LP says that atomic proposition is always true: (p415 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p365 <= 1)
lola: LP says that atomic proposition is always true: (p414 <= 1)
lola: LP says that atomic proposition is always true: (p414 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p416 <= 1)
lola: LP says that atomic proposition is always true: (p415 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p375 <= 1)
lola: LP says that atomic proposition is always true: (p415 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: E (((0 <= 0) U (((1 <= p210) AND (1 <= p213)) OR ((1 <= p210) AND (1 <= p211)) OR ((1 <= p210) AND (1 <= p221)) OR ((1 <= p210) AND (1 <= p219)) OR ((1 <= p210) AND (1 <= p217)) OR ((1 <= p210) AND (1 <= p215)) OR ((1 <= p210) AND (1 <= p229)) OR ((1 <= p210) AND (1 <= p227)) OR ((1 <= p210) AND (1 <= p233)) OR ((1 <= p210) AND (1 <= p225)) OR ((1 <= p210) AND (1 <= p235)) OR ((1 <= p210) AND (1 <= p223)) OR ((1 <= p210) AND (1 <= p237)) OR ((1 <= p210) AND (1 <= p231)) OR ((1 <= p210) AND (1 <= p247)) OR ((1 <= p210) AND (1 <= p310)) OR ((1 <= p210) AND (1 <= p249)) OR ((1 <= p210) AND (1 <= p251)) OR ((1 <= p210) AND (1 <= p253)) OR ((1 <= p210) AND (1 <= p239)) OR ((1 <= p210) AND (1 <= p241)) OR ((1 <= p210) AND (1 <= p243)) OR ((1 <= p210) AND (1 <= p245)) OR ((1 <= p210) AND (1 <= p255)) OR ((1 <= p210) AND (1 <= p257)) OR ((1 <= p210) AND (1 <= p259)) OR ((1 <= p210) AND (1 <= p212)) OR ((1 <= p210) AND (1 <= p220)) OR ((1 <= p210) AND (1 <= p218)) OR ((1 <= p210) AND (1 <= p216)) OR ((1 <= p210) AND (1 <= p214)) OR ((1 <= p210) AND (1 <= p228)) OR ((1 <= p210) AND (1 <= p226)) OR ((1 <= p210) AND (1 <= p234)) OR ((1 <= p210) AND (1 <= p224)) OR ((1 <= p210) AND (1 <= p236)) OR ((1 <= p210) AND (1 <= p222)) OR ((1 <= p210) AND (1 <= p232)) OR ((1 <= p210) AND (1 <= p230)) OR ((1 <= p210) AND (1 <= p246)) OR ((1 <= p210) AND (1 <= p248)) OR ((1 <= p210) AND (1 <= p250)) OR ((1 <= p210) AND (1 <= p252)) OR ((1 <= p210) AND (1 <= p238)) OR ((1 <= p210) AND (1 <= p240)) OR ((1 <= p210) AND (1 <= p242)) OR ((1 <= p210) AND (1 <= p244)) OR ((1 <= p210) AND (1 <= p254)) OR ((1 <= p210) AND (1 <= p256)) OR ((1 <= p210) AND (1 <= p258)) OR ((1 <= p210) AND (1 <= p260))))) : NOT(E (F (E (F ((((1 <= p6) AND (1 <= p7)) OR ((1 <= p311) AND (1 <= p385)) OR ((1 <= p311) AND (1 <= p387)) OR ((1 <= p311) AND (1 <= p389)) OR ((1 <= p311) AND (1 <= p391)) OR ((1 <= p311) AND (1 <= p377)) OR ((1 <= p311) AND (1 <= p379)) OR ((1 <= p311) AND (1 <= p381)) OR ((1 <= p311) AND (1 <= p383)) OR ((1 <= p311) AND (1 <= p369)) OR ((1 <= p311) AND (1 <= p371)) OR ((1 <= p311) AND (1 <= p373)) OR ((1 <= p311) AND (1 <= p375)) OR ((1 <= p311) AND (1 <= p363)) OR ((1 <= p311) AND (1 <= p365)) OR ((1 <= p311) AND (1 <= p367)) OR ((1 <= p311) AND (1 <= p409)) OR ((1 <= p311) AND (1 <= p401)) OR ((1 <= p311) AND (1 <= p403)) OR ((1 <= p311) AND (1 <= p405)) OR ((1 <= p311) AND (1 <= p407)) OR ((1 <= p311) AND (1 <= p393)) OR ((1 <= p311) AND (1 <= p395)) OR ((1 <= p311) AND (1 <= p397)) OR ((1 <= p311) AND (1 <= p399)) OR ((1 <= p311) AND (1 <= p386)) OR ((1 <= p311) AND (1 <= p388)) OR ((1 <= p311) AND (1 <= p390)) OR ((1 <= p311) AND (1 <= p392)) OR ((1 <= p311) AND (1 <= p378)) OR ((1 <= p311) AND (1 <= p380)) OR ((1 <= p311) AND (1 <= p382)) OR ((1 <= p311) AND (1 <= p384)) OR ((1 <= p311) AND (1 <= p370)) OR ((1 <= p311) AND (1 <= p372)) OR ((1 <= p311) AND (1 <= p374)) OR ((1 <= p311) AND (1 <= p376)) OR ((1 <= p311) AND (1 <= p362)) OR ((1 <= p311) AND (1 <= p364)) OR ((1 <= p311) AND (1 <= p366)) OR ((1 <= p311) AND (1 <= p368)) OR ((1 <= p311) AND (1 <= p410)) OR ((1 <= p311) AND (1 <= p402)) OR ((1 <= p311) AND (1 <= p404)) OR ((1 <= p311) AND (1 <= p406)) OR ((1 <= p311) AND (1 <= p408)) OR ((1 <= p311) AND (1 <= p394)) OR ((1 <= p311) AND (1 <= p396)) OR ((1 <= p311) AND (1 <= p398)) OR ((1 <= p311) AND (1 <= p400)))))))) : (E (G ((((p9 <= 0) OR (p139 <= 0)) AND ((p9 <= 0) OR (p204 <= 0)) AND ((p9 <= 0) OR (p135 <= 0)) AND ((p9 <= 0) OR (p200 <= 0)) AND ((p9 <= 0) OR (p147 <= 0)) AND ((p9 <= 0) OR (p143 <= 0)) AND ((p9 <= 0) OR (p208 <= 0)) AND ((p9 <= 0) OR (p123 <= 0)) AND ((p9 <= 0) OR (p188 <= 0)) AND ((p9 <= 0) OR (p119 <= 0)) AND ((p9 <= 0) OR (p184 <= 0)) AND ((p9 <= 0) OR (p131 <= 0)) AND ((p9 <= 0) OR (p196 <= 0)) AND ((p9 <= 0) OR (p127 <= 0)) AND ((p9 <= 0) OR (p192 <= 0)) AND ((p9 <= 0) OR (p172 <= 0)) AND ((p9 <= 0) OR (p168 <= 0)) AND ((p9 <= 0) OR (p115 <= 0)) AND ((p9 <= 0) OR (p180 <= 0)) AND ((p9 <= 0) OR (p111 <= 0)) AND ((p9 <= 0) OR (p176 <= 0)) AND ((p9 <= 0) OR (p156 <= 0)) AND ((p9 <= 0) OR (p152 <= 0)) AND ((p9 <= 0) OR (p164 <= 0)) AND ((p9 <= 0) OR (p160 <= 0)) AND ((p9 <= 0) OR (p142 <= 0)) AND ((p9 <= 0) OR (p203 <= 0)) AND ((p9 <= 0) OR (p138 <= 0)) AND ((p9 <= 0) OR (p199 <= 0)) AND ((p9 <= 0) OR (p150 <= 0)) AND ((p9 <= 0) OR (p146 <= 0)) AND ((p9 <= 0) OR (p207 <= 0)) AND ((p9 <= 0) OR (p126 <= 0)) AND ((p9 <= 0) OR (p187 <= 0)) AND ((p9 <= 0) OR (p122 <= 0)) AND ((p9 <= 0) OR (p183 <= 0)) AND ((p9 <= 0) OR (p134 <= 0)) AND ((p9 <= 0) OR (p195 <= 0)) AND ((p9 <= 0) OR (p130 <= 0)) AND ((p9 <= 0) OR (p191 <= 0)) AND ((p9 <= 0) OR (p110 <= 0)) AND ((p9 <= 0) OR (p171 <= 0)) AND ((p9 <= 0) OR (p167 <= 0)) AND ((p9 <= 0) OR (p118 <= 0)) AND ((p9 <= 0) OR (p179 <= 0)) AND ((p9 <= 0) OR (p114 <= 0)) AND ((p9 <= 0) OR (p175 <= 0)) AND ((p9 <= 0) OR (p155 <= 0)) AND ((p9 <= 0) OR (p151 <= 0)) AND ((p9 <= 0) OR (p163 <= 0)) AND ((p9 <= 0) OR (p159 <= 0)) AND ((p9 <= 0) OR (p141 <= 0)) AND ((p9 <= 0) OR (p206 <= 0)) AND ((p9 <= 0) OR (p137 <= 0)) AND ((p9 <= 0) OR (p202 <= 0)) AND ((p9 <= 0) OR (p149 <= 0)) AND ((p9 <= 0) OR (p145 <= 0)) AND ((p9 <= 0) OR (p190 <= 0)) AND ((p9 <= 0) OR (p125 <= 0)) AND ((p9 <= 0) OR (p186 <= 0)) AND ((p9 <= 0) OR (p121 <= 0)) AND ((p9 <= 0) OR (p133 <= 0)) AND ((p9 <= 0) OR (p198 <= 0)) AND ((p9 <= 0) OR (p129 <= 0)) AND ((p9 <= 0) OR (p194 <= 0)) AND ((p9 <= 0) OR (p174 <= 0)) AND ((p9 <= 0) OR (p109 <= 0)) AND ((p9 <= 0) OR (p170 <= 0)) AND ((p9 <= 0) OR (p182 <= 0)) AND ((p9 <= 0) OR (p117 <= 0)) AND ((p9 <= 0) OR (p178 <= 0)) AND ((p9 <= 0) OR (p113 <= 0)) AND ((p9 <= 0) OR (p158 <= 0)) AND ((p9 <= 0) OR (p154 <= 0)) AND ((p9 <= 0) OR (p166 <= 0)) AND ((p9 <= 0) OR (p162 <= 0)) AND ((p9 <= 0) OR (p205 <= 0)) AND ((p9 <= 0) OR (p140 <= 0)) AND ((p9 <= 0) OR (p201 <= 0)) AND ((p9 <= 0) OR (p136 <= 0)) AND ((p9 <= 0) OR (p148 <= 0)) AND ((p9 <= 0) OR (p209 <= 0)) AND ((p9 <= 0) OR (p144 <= 0)) AND ((p9 <= 0) OR (p124 <= 0)) AND ((p9 <= 0) OR (p189 <= 0)) AND ((p9 <= 0) OR (p120 <= 0)) AND ((p9 <= 0) OR (p185 <= 0)) AND ((p9 <= 0) OR (p197 <= 0)) AND ((p9 <= 0) OR (p132 <= 0)) AND ((p9 <= 0) OR (p193 <= 0)) AND ((p9 <= 0) OR (p128 <= 0)) AND ((p9 <= 0) OR (p173 <= 0)) AND ((p9 <= 0) OR (p169 <= 0)) AND ((p9 <= 0) OR (p116 <= 0)) AND ((p9 <= 0) OR (p181 <= 0)) AND ((p9 <= 0) OR (p112 <= 0)) AND ((p9 <= 0) OR (p177 <= 0)) AND ((p9 <= 0) OR (p157 <= 0)) AND ((p9 <= 0) OR (p153 <= 0)) AND ((p9 <= 0) OR (p165 <= 0)) AND ((p9 <= 0) OR (p161 <= 0))))) OR ((1 <= p1) AND (1 <= p2))) : (NOT(E (F ((((1 <= p9) AND (1 <= p13)) OR ((1 <= p9) AND (1 <= p78)) OR ((1 <= p9) AND (1 <= p74)) OR ((1 <= p9) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p86)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p82)) OR ((1 <= p9) AND (1 <= p62)) OR ((1 <= p9) AND (1 <= p58)) OR ((1 <= p9) AND (1 <= p70)) OR ((1 <= p9) AND (1 <= p66)) OR ((1 <= p9) AND (1 <= p107)) OR ((1 <= p9) AND (1 <= p46)) OR ((1 <= p9) AND (1 <= p103)) OR ((1 <= p9) AND (1 <= p42)) OR ((1 <= p9) AND (1 <= p54)) OR ((1 <= p9) AND (1 <= p50)) OR ((1 <= p9) AND (1 <= p91)) OR ((1 <= p9) AND (1 <= p30)) OR ((1 <= p9) AND (1 <= p87)) OR ((1 <= p9) AND (1 <= p26)) OR ((1 <= p9) AND (1 <= p99)) OR ((1 <= p9) AND (1 <= p38)) OR ((1 <= p9) AND (1 <= p95)) OR ((1 <= p9) AND (1 <= p34)) OR ((1 <= p9) AND (1 <= p12)) OR ((1 <= p9) AND (1 <= p77)) OR ((1 <= p9) AND (1 <= p73)) OR ((1 <= p9) AND (1 <= p20)) OR ((1 <= p9) AND (1 <= p85)) OR ((1 <= p9) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p81)) OR ((1 <= p9) AND (1 <= p61)) OR ((1 <= p9) AND (1 <= p57)) OR ((1 <= p9) AND (1 <= p69)) OR ((1 <= p9) AND (1 <= p65)) OR ((1 <= p9) AND (1 <= p45)) OR ((1 <= p9) AND (1 <= p41)) OR ((1 <= p9) AND (1 <= p106)) OR ((1 <= p9) AND (1 <= p53)) OR ((1 <= p9) AND (1 <= p49)) OR ((1 <= p9) AND (1 <= p29)) OR ((1 <= p9) AND (1 <= p94)) OR ((1 <= p9) AND (1 <= p25)) OR ((1 <= p9) AND (1 <= p90)) OR ((1 <= p9) AND (1 <= p37)) OR ((1 <= p9) AND (1 <= p102)) OR ((1 <= p9) AND (1 <= p33)) OR ((1 <= p9) AND (1 <= p98)) OR ((1 <= p9) AND (1 <= p11)) OR ((1 <= p9) AND (1 <= p76)) OR ((1 <= p9) AND (1 <= p72)) OR ((1 <= p9) AND (1 <= p19)) OR ((1 <= p9) AND (1 <= p84)) OR ((1 <= p9) AND (1 <= p15)) OR ((1 <= p9) AND (1 <= p80)) OR ((1 <= p9) AND (1 <= p60)) OR ((1 <= p9) AND (1 <= p56)) OR ((1 <= p9) AND (1 <= p68)) OR ((1 <= p9) AND (1 <= p64)) OR ((1 <= p9) AND (1 <= p44)) OR ((1 <= p9) AND (1 <= p40)) OR ((1 <= p9) AND (1 <= p105)) OR ((1 <= p9) AND (1 <= p52)) OR ((1 <= p9) AND (1 <= p48)) OR ((1 <= p9) AND (1 <= p28)) OR ((1 <= p9) AND (1 <= p93)) OR ((1 <= p9) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p89)) OR ((1 <= p9) AND (1 <= p36)) OR ((1 <= p9) AND (1 <= p101)) OR ((1 <= p9) AND (1 <= p32)) OR ((1 <= p9) AND (1 <= p97)) OR ((1 <= p9) AND (1 <= p75)) OR ((1 <= p9) AND (1 <= p14)) OR ((1 <= p9) AND (1 <= p71)) OR ((1 <= p9) AND (1 <= p10)) OR ((1 <= p9) AND (1 <= p83)) OR ((1 <= p9) AND (1 <= p22)) OR ((1 <= p9) AND (1 <= p79)) OR ((1 <= p9) AND (1 <= p18)) OR ((1 <= p9) AND (1 <= p59)) OR ((1 <= p9) AND (1 <= p55)) OR ((1 <= p9) AND (1 <= p67)) OR ((1 <= p9) AND (1 <= p63)) OR ((1 <= p9) AND (1 <= p43)) OR ((1 <= p9) AND (1 <= p108)) OR ((1 <= p9) AND (1 <= p39)) OR ((1 <= p9) AND (1 <= p104)) OR ((1 <= p9) AND (1 <= p51)) OR ((1 <= p9) AND (1 <= p47)) OR ((1 <= p9) AND (1 <= p27)) OR ((1 <= p9) AND (1 <= p92)) OR ((1 <= p9) AND (1 <= p23)) OR ((1 <= p9) AND (1 <= p88)) OR ((1 <= p9) AND (1 <= p35)) OR ((1 <= p9) AND (1 <= p100)) OR ((1 <= p9) AND (1 <= p31)) OR ((1 <= p9) AND (1 <= p96)))))) OR (((p415 <= 0) OR (p413 <= 0)) AND ((p415 <= 0) OR (((p311 <= 0) OR (p385 <= 0)) AND ((p311 <= 0) OR (p387 <= 0)) AND ((p311 <= 0) OR (p389 <= 0)) AND ((p311 <= 0) OR (p391 <= 0)) AND ((p311 <= 0) OR (p377 <= 0)) AND ((p311 <= 0) OR (p379 <= 0)) AND ((p311 <= 0) OR (p381 <= 0)) AND ((p311 <= 0) OR (p383 <= 0)) AND ((p311 <= 0) OR (p369 <= 0)) AND ((p311 <= 0) OR (p371 <= 0)) AND ((p311 <= 0) OR (p373 <= 0)) AND ((p311 <= 0) OR (p375 <= 0)) AND ((p311 <= 0) OR (p363 <= 0)) AND ((p311 <= 0) OR (p365 <= 0)) AND ((p311 <= 0) OR (p367 <= 0)) AND ((p311 <= 0) OR (p409 <= 0)) AND ((p311 <= 0) OR (p401 <= 0)) AND ((p311 <= 0) OR (p403 <= 0)) AND ((p311 <= 0) OR (p405 <= 0)) AND ((p311 <= 0) OR (p407 <= 0)) AND ((p311 <= 0) OR (p393 <= 0)) AND ((p311 <= 0) OR (p395 <= 0)) AND ((p311 <= 0) OR (p397 <= 0)) AND ((p311 <= 0) OR (p399 <= 0)) AND ((p311 <= 0) OR (p386 <= 0)) AND ((p311 <= 0) OR (p388 <= 0)) AND ((p311 <= 0) OR (p390 <= 0)) AND ((p311 <= 0) OR (p392 <= 0)) AND ((p311 <= 0) OR (p378 <= 0)) AND ((p311 <= 0) OR (p380 <= 0)) AND ((p311 <= 0) OR (p382 <= 0)) AND ((p311 <= 0) OR (p384 <= 0)) AND ((p311 <= 0) OR (p370 <= 0)) AND ((p311 <= 0) OR (p372 <= 0)) AND ((p311 <= 0) OR (p374 <= 0)) AND ((p311 <= 0) OR (p376 <= 0)) AND ((p311 <= 0) OR (p362 <= 0)) AND ((p311 <= 0) OR (p364 <= 0)) AND ((p311 <= 0) OR (p366 <= 0)) AND ((p311 <= 0) OR (p368 <= 0)) AND ((p311 <= 0) OR (p410 <= 0)) AND ((p311 <= 0) OR (p402 <= 0)) AND ((p311 <= 0) OR (p404 <= 0)) AND ((p311 <= 0) OR (p406 <= 0)) AND ((p311 <= 0) OR (p408 <= 0)) AND ((p311 <= 0) OR (p394 <= 0)) AND ((p311 <= 0) OR (p396 <= 0)) AND ((p311 <= 0) OR (p398 <= 0)) AND ((p311 <= 0) OR (p400 <= 0)))))) : E (X ((NOT(A (F ((((1 <= p413)))))) AND ((p413 <= 0))))) : E (G ((((1 <= p413)) OR ((1 <= p1) AND (1 <= p2))))) : E (G ((0 <= 0))) : (A (G (E (X (((p415 <= 0)))))) OR ((1 <= p210) AND (1 <= p248))) : E (F ((E ((((1 <= p9) AND (1 <= p130)) U ((1 <= p210) AND (1 <= p224)))) OR (A (G (((1 <= p416)))) AND A (G (((1 <= p415)))))))) : (E (G (((1 <= p414)))) AND NOT(A (G (A (F (((1 <= p414)))))))) : (E (G (((((1 <= p210) AND (1 <= p285)) OR ((1 <= p415)) OR (p416 <= 0)) OR E (X (((1 <= p311) AND (1 <= p358))))))) AND ((1 <= p415))) : A (F ((NOT(E (X (((1 <= p311) AND (1 <= p365))))) AND ((p414 <= 0))))) : A (F (NOT(E (F (((p414 <= 0))))))) : A (F (A (X (((1 <= p6) AND (1 <= p7)))))) : A ((E (X ((((1 <= p416)) OR ((1 <= p415))))) U (A (F (((1 <= p311) AND (1 <= p375)))) AND (((1 <= p415)) OR ((1 <= p9) AND (1 <= p58) AND (1 <= p46))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:401
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: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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:446
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 28 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 0 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 1 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((E (G ((((p413 <= 0))))) AND ((p413 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((EG((((p413 <= 0)))) AND ((p413 <= 0))))
lola: processed formula length: 43
lola: 30 rewrites
lola: closed formula file CTLFireability.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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 302 markings, 301 edges
lola: ========================================
lola: subprocess 2 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (E (X (((p415 <= 0)))))) OR ((1 <= p210) AND (1 <= p248)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p210) AND (1 <= p248))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p210) AND (1 <= p248))
lola: processed formula length: 29
lola: 28 rewrites
lola: closed formula file CTLFireability.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 3 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (((p415 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX(((p415 <= 0))))
lola: processed formula length: 21
lola: 30 rewrites
lola: closed formula file CTLFireability.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: 11 markings, 10 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (((((1 <= p210) AND (1 <= p285)) OR ((1 <= p415)) OR (p416 <= 0)) OR E (X (((1 <= p311) AND (1 <= p358))))))) AND ((1 <= p415)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p415))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p415))
lola: processed formula length: 13
lola: 28 rewrites
lola: closed formula file CTLFireability.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 4 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((((1 <= p210) AND (1 <= p285)) OR ((1 <= p415)) OR (p416 <= 0)) OR E (X (((1 <= p311) AND (1 <= p358)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(((((1 <= p210) AND (1 <= p285)) OR ((1 <= p415)) OR (p416 <= 0)) OR EX(((1 <= p311) AND (1 <= p358)))))
lola: processed formula length: 108
lola: 30 rewrites
lola: closed formula file CTLFireability.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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 379 markings, 378 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((A (X (((p311 <= 0) OR (p365 <= 0)))) AND ((p414 <= 0)))))
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(((p311 <= 0) OR (p365 <= 0))) AND ((p414 <= 0))))
lola: processed formula length: 57
lola: 30 rewrites
lola: closed formula file CTLFireability.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: 412253 markings, 414868 edges, 82451 markings/sec, 0 secs
lola: 836690 markings, 842022 edges, 84887 markings/sec, 5 secs
lola: 1225454 markings, 1233386 edges, 77753 markings/sec, 10 secs
lola: 1654472 markings, 1665451 edges, 85804 markings/sec, 15 secs
lola: 2058948 markings, 2073160 edges, 80895 markings/sec, 20 secs
lola: 2456337 markings, 2473288 edges, 79478 markings/sec, 25 secs
lola: 2883047 markings, 2902811 edges, 85342 markings/sec, 30 secs
lola: 3301383 markings, 3323763 edges, 83667 markings/sec, 35 secs
lola: 3695107 markings, 3720186 edges, 78745 markings/sec, 40 secs
lola: 4114672 markings, 4143069 edges, 83913 markings/sec, 45 secs
lola: 4496840 markings, 4528159 edges, 76434 markings/sec, 50 secs
lola: 4900955 markings, 4934875 edges, 80823 markings/sec, 55 secs
lola: 5320804 markings, 5357440 edges, 83970 markings/sec, 60 secs
lola: 5705518 markings, 5744746 edges, 76943 markings/sec, 65 secs
lola: 6124970 markings, 6167054 edges, 83890 markings/sec, 70 secs
lola: 6544389 markings, 6589885 edges, 83884 markings/sec, 75 secs
lola: 6939226 markings, 6987463 edges, 78967 markings/sec, 80 secs
lola: 7363509 markings, 7414517 edges, 84857 markings/sec, 85 secs
lola: 7778796 markings, 7832472 edges, 83057 markings/sec, 90 secs
lola: 8200802 markings, 8257385 edges, 84401 markings/sec, 95 secs
lola: 8621298 markings, 8681365 edges, 84099 markings/sec, 100 secs
lola: 9014627 markings, 9077336 edges, 78666 markings/sec, 105 secs
lola: 9437957 markings, 9503450 edges, 84666 markings/sec, 110 secs
lola: 9853200 markings, 9921332 edges, 83049 markings/sec, 115 secs
lola: 10277050 markings, 10348148 edges, 84770 markings/sec, 120 secs
lola: 10698693 markings, 10773340 edges, 84329 markings/sec, 125 secs
lola: 11091371 markings, 11168557 edges, 78536 markings/sec, 130 secs
lola: 11511603 markings, 11591566 edges, 84046 markings/sec, 135 secs
lola: 11931162 markings, 12013742 edges, 83912 markings/sec, 140 secs
lola: 12354707 markings, 12440359 edges, 84709 markings/sec, 145 secs
lola: 12770410 markings, 12859505 edges, 83141 markings/sec, 150 secs
lola: 13169677 markings, 13261350 edges, 79853 markings/sec, 155 secs
lola: 13587002 markings, 13681421 edges, 83465 markings/sec, 160 secs
lola: 14010004 markings, 14107032 edges, 84600 markings/sec, 165 secs
lola: 14433209 markings, 14533425 edges, 84641 markings/sec, 170 secs
lola: 14845289 markings, 14948832 edges, 82416 markings/sec, 175 secs
lola: 15246467 markings, 15352618 edges, 80236 markings/sec, 180 secs
lola: 15661138 markings, 15770014 edges, 82934 markings/sec, 185 secs
lola: 16085682 markings, 16197183 edges, 84909 markings/sec, 190 secs
lola: 16506926 markings, 16621625 edges, 84249 markings/sec, 195 secs
lola: 16917388 markings, 17035396 edges, 82092 markings/sec, 200 secs
lola: 17320677 markings, 17441276 edges, 80658 markings/sec, 205 secs
lola: 17738958 markings, 17862282 edges, 83656 markings/sec, 210 secs
lola: 18163370 markings, 18289353 edges, 84882 markings/sec, 215 secs
lola: 18581655 markings, 18710851 edges, 83657 markings/sec, 220 secs
lola: 18991884 markings, 19124339 edges, 82046 markings/sec, 225 secs
lola: 19396751 markings, 19531807 edges, 80973 markings/sec, 230 secs
lola: 19816560 markings, 19954332 edges, 83962 markings/sec, 235 secs
lola: 20240541 markings, 20381004 edges, 84796 markings/sec, 240 secs
lola: 20657777 markings, 20801474 edges, 83447 markings/sec, 245 secs
lola: 21065425 markings, 21212328 edges, 81530 markings/sec, 250 secs
lola: 21472030 markings, 21621534 edges, 81321 markings/sec, 255 secs
lola: 21891579 markings, 22043814 edges, 83910 markings/sec, 260 secs
lola: 22315557 markings, 22470511 edges, 84796 markings/sec, 265 secs
lola: 22733303 markings, 22891496 edges, 83549 markings/sec, 270 secs
lola: 23139269 markings, 23300621 edges, 81193 markings/sec, 275 secs
lola: 23548072 markings, 23712024 edges, 81761 markings/sec, 280 secs
lola: 23967158 markings, 24133864 edges, 83817 markings/sec, 285 secs
lola: 24391223 markings, 24560675 edges, 84813 markings/sec, 290 secs
lola: 24809689 markings, 24982387 edges, 83693 markings/sec, 295 secs
lola: 25213119 markings, 25388919 edges, 80686 markings/sec, 300 secs
lola: 25624126 markings, 25802536 edges, 82201 markings/sec, 305 secs
lola: 26042269 markings, 26223445 edges, 83629 markings/sec, 310 secs
lola: 26466275 markings, 26650218 edges, 84801 markings/sec, 315 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown yes unknown yes no unknown unknown yes unknown unknown unknown unknown
lola: memory consumption: 3901304 KB
lola: time consumption: 360 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (X (((1 <= p6) AND (1 <= p7))))))
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(((1 <= p6) AND (1 <= p7))))
lola: processed formula length: 33
lola: 30 rewrites
lola: closed formula file CTLFireability.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: 344000 markings, 904642 edges, 68800 markings/sec, 0 secs
lola: 628318 markings, 1851972 edges, 56864 markings/sec, 5 secs
lola: 885606 markings, 2813545 edges, 51458 markings/sec, 10 secs
lola: 1135152 markings, 3756080 edges, 49909 markings/sec, 15 secs
lola: 1389093 markings, 4709547 edges, 50788 markings/sec, 20 secs
lola: 1725386 markings, 5616534 edges, 67259 markings/sec, 25 secs
lola: 2013671 markings, 6553710 edges, 57657 markings/sec, 30 secs
lola: 2271577 markings, 7516414 edges, 51581 markings/sec, 35 secs
lola: 2521716 markings, 8460177 edges, 50028 markings/sec, 40 secs
lola: 2776317 markings, 9415349 edges, 50920 markings/sec, 45 secs
lola: 3106776 markings, 10329400 edges, 66092 markings/sec, 50 secs
lola: 3402885 markings, 11263401 edges, 59222 markings/sec, 55 secs
lola: 3660874 markings, 12226606 edges, 51598 markings/sec, 60 secs
lola: 3911745 markings, 13172669 edges, 50174 markings/sec, 65 secs
lola: 4165669 markings, 14125528 edges, 50785 markings/sec, 70 secs
lola: 4488175 markings, 15043833 edges, 64501 markings/sec, 75 secs
lola: 4790310 markings, 15969895 edges, 60427 markings/sec, 80 secs
lola: 5047826 markings, 16931919 edges, 51503 markings/sec, 85 secs
lola: 5298519 markings, 17877531 edges, 50139 markings/sec, 90 secs
lola: 5552578 markings, 18830788 edges, 50812 markings/sec, 95 secs
lola: 5869521 markings, 19747571 edges, 63389 markings/sec, 100 secs
lola: 6177429 markings, 20674763 edges, 61582 markings/sec, 105 secs
lola: 6434993 markings, 21636831 edges, 51513 markings/sec, 110 secs
lola: 6686168 markings, 22583582 edges, 50235 markings/sec, 115 secs
lola: 6939728 markings, 23536240 edges, 50712 markings/sec, 120 secs
lola: 7250886 markings, 24455157 edges, 62232 markings/sec, 125 secs
lola: 7565325 markings, 25382164 edges, 62888 markings/sec, 130 secs
lola: 7822747 markings, 26344021 edges, 51484 markings/sec, 135 secs
lola: 8075467 markings, 27294321 edges, 50544 markings/sec, 140 secs
lola: 8328088 markings, 28244380 edges, 50524 markings/sec, 145 secs
lola: 8632284 markings, 29169425 edges, 60839 markings/sec, 150 secs
lola: 8954290 markings, 30092409 edges, 64401 markings/sec, 155 secs
lola: 9212895 markings, 31056446 edges, 51721 markings/sec, 160 secs
lola: 9465924 markings, 32007522 edges, 50606 markings/sec, 165 secs
lola: 9718768 markings, 32958409 edges, 50569 markings/sec, 170 secs
lola: 10013687 markings, 33884831 edges, 58984 markings/sec, 175 secs
lola: 10341979 markings, 34798477 edges, 65658 markings/sec, 180 secs
lola: 10599055 markings, 35759649 edges, 51415 markings/sec, 185 secs
lola: 10852173 markings, 36710605 edges, 50624 markings/sec, 190 secs
lola: 11103488 markings, 37657970 edges, 50263 markings/sec, 195 secs
lola: 11395039 markings, 38589984 edges, 58310 markings/sec, 200 secs
lola: 11727234 markings, 39499981 edges, 66439 markings/sec, 205 secs
lola: 11984814 markings, 40461693 edges, 51516 markings/sec, 210 secs
lola: 12238373 markings, 41413845 edges, 50712 markings/sec, 215 secs
lola: 12490020 markings, 42362122 edges, 50329 markings/sec, 220 secs
lola: 12776393 markings, 43295503 edges, 57275 markings/sec, 225 secs
lola: 13113610 markings, 44203526 edges, 67443 markings/sec, 230 secs
lola: 13371475 markings, 45166167 edges, 51573 markings/sec, 235 secs
lola: 13625648 markings, 46120122 edges, 50835 markings/sec, 240 secs
lola: 13876386 markings, 47065460 edges, 50148 markings/sec, 245 secs
lola: 14157777 markings, 48007065 edges, 56278 markings/sec, 250 secs
lola: 14501385 markings, 48909837 edges, 68722 markings/sec, 255 secs
lola: 14759347 markings, 49872963 edges, 51592 markings/sec, 260 secs
lola: 15014512 markings, 50829237 edges, 51033 markings/sec, 265 secs
lola: 15265659 markings, 51775462 edges, 50229 markings/sec, 270 secs
lola: 15539152 markings, 52716623 edges, 54699 markings/sec, 275 secs
lola: 15883124 markings, 53616939 edges, 68794 markings/sec, 280 secs
lola: 16145269 markings, 54575068 edges, 52429 markings/sec, 285 secs
lola: 16399916 markings, 55530424 edges, 50929 markings/sec, 290 secs
lola: 16649742 markings, 56473973 edges, 49965 markings/sec, 295 secs
lola: 16920493 markings, 57419570 edges, 54150 markings/sec, 300 secs
lola: 17264468 markings, 58320305 edges, 68795 markings/sec, 305 secs
lola: 17530263 markings, 59275375 edges, 53159 markings/sec, 310 secs
lola: 17785458 markings, 60231972 edges, 51039 markings/sec, 315 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown yes unknown yes no unknown unknown yes unknown unknown unknown unknown
lola: memory consumption: 2703620 KB
lola: time consumption: 681 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E (X ((((1 <= p416)) OR ((1 <= p415))))) U (A (F (((1 <= p311) AND (1 <= p375)))) AND (((1 <= p415)) OR ((1 <= p9) AND (1 <= p58) AND (1 <= p46))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(EX((((1 <= p416)) OR ((1 <= p415)))) U (AF(((1 <= p311) AND (1 <= p375))) AND (((1 <= p415)) OR ((1 <= p9) AND (1 <= p58) AND (1 <= p46)))))
lola: processed formula length: 144
lola: 31 rewrites
lola: closed formula file CTLFireability.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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 11 markings, 21 edges
lola: ========================================
lola: subprocess 7 will run for 361 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p6 <= 0) OR (p7 <= 0)) AND ((p311 <= 0) OR (p385 <= 0)) AND ((p311 <= 0) OR (p387 <= 0)) AND ((p311 <= 0) OR (p389 <= 0)) AND ((p311 <= 0) OR (p391 <= 0)) AND ((p311 <= 0) OR (p377 <= 0)) AND ((p311 <= 0) OR (p379 <= 0)) AND ((p311 <= 0) OR (p381 <= 0)) AND ((p311 <= 0) OR (p383 <= 0)) AND ((p311 <= 0) OR (p369 <= 0)) AND ((p311 <= 0) OR (p371 <= 0)) AND ((p311 <= 0) OR (p373 ... (shortened)
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 ((((p6 <= 0) OR (p7 <= 0)) AND ((p311 <= 0) OR (p385 <= 0)) AND ((p311 <= 0) OR (p387 <= 0)) AND ((p311 <= 0) OR (p389 <= 0)) AND ((p311 <= 0) OR (p391 <= 0)) AND ((p311 <= 0) OR (p377 <= 0)) AND ((p311 <= 0) OR (p379 <= 0)) AND ((p311 <= 0) OR (p381 <= 0)) AND ((p311 <= 0) OR (p383 <= 0)) AND ((p311 <= 0) OR (p369 <= 0)) AND ((p311 <= 0) OR (p371 <= 0)) AND ((p311 <= 0) OR (p373 ... (shortened)
lola: processed formula length: 1701
lola: 30 rewrites
lola: closed formula file CTLFireability.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: SUBRESULT
lola: formula 0: (((1 <= p6) AND (1 <= p7)) OR ((1 <= p311) AND (1 <= p385)) OR ((1 <= p311) AND (1 <= p387)) OR ((1 <= p311) AND (1 <= p389)) OR ((1 <= p311) AND (1 <= p391)) OR ((1 <= p311) AND (1 <= p377)) OR ((1 <= p311) AND (1 <= p379)) OR ((1 <= p311) AND (1 <= p381)) OR ((1 <= p311) AND (1 <= p383)) OR ((1 <= p311) AND (1 <= p369)) OR ((1 <= p311) AND (1 <= p371)) OR ((1 <= p311) AND (1 <= p373)) OR ((1 <= p311) AND (1 <= p375)) OR ((1 <= p311) AND (1 <= p363)) OR ((1 <= p311) AND (1 <= p365)) OR ((1 <= p311) AND (1 <= p367)) OR ((1 <= p311) AND (1 <= p409)) OR ((1 <= p311) AND (1 <= p401)) OR ((1 <= p311) AND (1 <= p403)) OR ((1 <= p311) AND (1 <= p405)) OR ((1 <= p311) AND (1 <= p407)) OR ((1 <= p311) AND (1 <= p393)) OR ((1 <= p311) AND (1 <= p395)) OR ((1 <= p311) AND (1 <= p397)) OR ((1 <= p311) AND (1 <= p399)) OR ((1 <= p311) AND (1 <= p386)) OR ((1 <= p311) AND (1 <= p388)) OR ((1 <= p311) AND (1 <= p390)) OR ((1 <= p311) AND (1 <= p392)) OR ((1 <= p311) AND (1 <= p378)) OR ((1 <= p311) AND (1 <= p380)) OR ((1 <= p311) AND (1 <= p382)) OR ((1 <= p311) AND (1 <= p384)) OR ((1 <= p311) AND (1 <= p370)) OR ((1 <= p311) AND (1 <= p372)) OR ((1 <= p311) AND (1 <= p374)) OR ((1 <= p311) AND (1 <= p376)) OR ((1 <= p311) AND (1 <= p362)) OR ((1 <= p311) AND (1 <= p364)) OR ((1 <= p311) AND (1 <= p366)) OR ((1 <= p311) AND (1 <= p368)) OR ((1 <= p311) AND (1 <= p410)) OR ((1 <= p311) AND (1 <= p402)) OR ((1 <= p311) AND (1 <= p404)) OR ((1 <= p311) AND (1 <= p406)) OR ((1 <= p311) AND (1 <= p408)) OR ((1 <= p311) AND (1 <= p394)) OR ((1 <= p311) AND (1 <= p396)) OR ((1 <= p311) AND (1 <= p398)) OR ((1 <= p311) AND (1 <= p400)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 100 literals and 50 conjunctive subformulas
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 8 will run for 412 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p210) AND (1 <= p213)) OR ((1 <= p210) AND (1 <= p211)) OR ((1 <= p210) AND (1 <= p221)) OR ((1 <= p210) AND (1 <= p219)) OR ((1 <= p210) AND (1 <= p217)) OR ((1 <= p210) AND (1 <= p215)) OR ((1 <= p210) AND (1 <= p229)) OR ((1 <= p210) AND (1 <= p227)) OR ((1 <= p210) AND (1 <= p233)) OR ((1 <= p210) AND (1 <= p225)) OR ((1 <= p210) AND (1 <= p235)) OR ((1 <= p210) AND (1... (shortened)
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 <= p210) AND (1 <= p213)) OR ((1 <= p210) AND (1 <= p211)) OR ((1 <= p210) AND (1 <= p221)) OR ((1 <= p210) AND (1 <= p219)) OR ((1 <= p210) AND (1 <= p217)) OR ((1 <= p210) AND (1 <= p215)) OR ((1 <= p210) AND (1 <= p229)) OR ((1 <= p210) AND (1 <= p227)) OR ((1 <= p210) AND (1 <= p233)) OR ((1 <= p210) AND (1 <= p225)) OR ((1 <= p210) AND (1 <= p235)) OR ((1 <= p210) AND (1... (shortened)
lola: processed formula length: 1739
lola: 29 rewrites
lola: closed formula file CTLFireability.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 <= p210) AND (1 <= p213)) OR ((1 <= p210) AND (1 <= p211)) OR ((1 <= p210) AND (1 <= p221)) OR ((1 <= p210) AND (1 <= p219)) OR ((1 <= p210) AND (1 <= p217)) OR ((1 <= p210) AND (1 <= p215)) OR ((1 <= p210) AND (1 <= p229)) OR ((1 <= p210) AND (1 <= p227)) OR ((1 <= p210) AND (1 <= p233)) OR ((1 <= p210) AND (1 <= p225)) OR ((1 <= p210) AND (1 <= p235)) OR ((1 <= p210) AND (1 <= p223)) OR ((1 <= p210) AND (1 <= p237)) OR ((1 <= p210) AND (1 <= p231)) OR ((1 <= p210) AND (1 <= p247)) OR ((1 <= p210) AND (1 <= p310)) OR ((1 <= p210) AND (1 <= p249)) OR ((1 <= p210) AND (1 <= p251)) OR ((1 <= p210) AND (1 <= p253)) OR ((1 <= p210) AND (1 <= p239)) OR ((1 <= p210) AND (1 <= p241)) OR ((1 <= p210) AND (1 <= p243)) OR ((1 <= p210) AND (1 <= p245)) OR ((1 <= p210) AND (1 <= p255)) OR ((1 <= p210) AND (1 <= p257)) OR ((1 <= p210) AND (1 <= p259)) OR ((1 <= p210) AND (1 <= p212)) OR ((1 <= p210) AND (1 <= p220)) OR ((1 <= p210) AND (1 <= p218)) OR ((1 <= p210) AND (1 <= p216)) OR ((1 <= p210) AND (1 <= p214)) OR ((1 <= p210) AND (1 <= p228)) OR ((1 <= p210) AND (1 <= p226)) OR ((1 <= p210) AND (1 <= p234)) OR ((1 <= p210) AND (1 <= p224)) OR ((1 <= p210) AND (1 <= p236)) OR ((1 <= p210) AND (1 <= p222)) OR ((1 <= p210) AND (1 <= p232)) OR ((1 <= p210) AND (1 <= p230)) OR ((1 <= p210) AND (1 <= p246)) OR ((1 <= p210) AND (1 <= p248)) OR ((1 <= p210) AND (1 <= p250)) OR ((1 <= p210) AND (1 <= p252)) OR ((1 <= p210) AND (1 <= p238)) OR ((1 <= p210) AND (1 <= p240)) OR ((1 <= p210) AND (1 <= p242)) OR ((1 <= p210) AND (1 <= p244)) OR ((1 <= p210) AND (1 <= p254)) OR ((1 <= p210) AND (1 <= p256)) OR ((1 <= p210) AND (1 <= p258)) OR ((1 <= p210) AND (1 <= p260)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 102 literals and 51 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 9 will run for 481 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((1 <= p413)) OR ((1 <= p1) AND (1 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((1 <= p413)) OR ((1 <= p1) AND (1 <= p2)))))
lola: processed formula length: 53
lola: 29 rewrites
lola: closed formula file CTLFireability.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: (((p413 <= 0)) AND ((p1 <= 0) OR (p2 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-9-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: 588608 markings, 588608 edges, 117722 markings/sec, 0 secs || sara is running 0 secs
lola: 1162638 markings, 1162638 edges, 114806 markings/sec, 5 secs || sara is running 5 secs
lola: 1684582 markings, 1684582 edges, 104389 markings/sec, 10 secs || sara is running 10 secs
lola: 2216978 markings, 2216978 edges, 106479 markings/sec, 15 secs || sara is running 15 secs
lola: 2730153 markings, 2730153 edges, 102635 markings/sec, 20 secs || sara is running 20 secs
lola: 3219187 markings, 3219187 edges, 97807 markings/sec, 25 secs || sara is running 25 secs
lola: 3704499 markings, 3704499 edges, 97062 markings/sec, 30 secs || sara is running 30 secs
lola: 4166363 markings, 4166362 edges, 92373 markings/sec, 35 secs || sara is running 35 secs
lola: 4609995 markings, 4609995 edges, 88726 markings/sec, 40 secs || sara is running 40 secs
lola: 5040848 markings, 5040847 edges, 86171 markings/sec, 45 secs || sara is running 45 secs
lola: 5464999 markings, 5464998 edges, 84830 markings/sec, 50 secs || sara is running 50 secs
lola: 5878470 markings, 5878470 edges, 82694 markings/sec, 55 secs || sara is running 55 secs
lola: 6284943 markings, 6284943 edges, 81295 markings/sec, 60 secs || sara is running 60 secs
lola: 6683934 markings, 6683934 edges, 79798 markings/sec, 65 secs || sara is running 65 secs
lola: 7074921 markings, 7074921 edges, 78197 markings/sec, 70 secs || sara is running 70 secs
lola: 7457340 markings, 7457340 edges, 76484 markings/sec, 75 secs || sara is running 75 secs
lola: 7834169 markings, 7834169 edges, 75366 markings/sec, 80 secs || sara is running 80 secs
lola: 8211644 markings, 8211644 edges, 75495 markings/sec, 85 secs || sara is running 85 secs
lola: 8578003 markings, 8578003 edges, 73272 markings/sec, 90 secs || sara is running 90 secs
lola: 8942282 markings, 8942282 edges, 72856 markings/sec, 95 secs || sara is running 95 secs
lola: 9302442 markings, 9302442 edges, 72032 markings/sec, 100 secs || sara is running 100 secs
lola: 9652694 markings, 9652693 edges, 70050 markings/sec, 105 secs || sara is running 105 secs
lola: 10004957 markings, 10004956 edges, 70453 markings/sec, 110 secs || sara is running 110 secs
lola: 10343875 markings, 10343875 edges, 67784 markings/sec, 115 secs || sara is running 115 secs
lola: 10668508 markings, 10668508 edges, 64927 markings/sec, 120 secs || sara is running 120 secs
lola: 11003094 markings, 11003093 edges, 66917 markings/sec, 125 secs || sara is running 125 secs
lola: 11326980 markings, 11326980 edges, 64777 markings/sec, 130 secs || sara is running 130 secs
lola: 11629006 markings, 11629006 edges, 60405 markings/sec, 135 secs || sara is running 135 secs
lola: 11934324 markings, 11934324 edges, 61064 markings/sec, 140 secs || sara is running 140 secs
lola: 12255227 markings, 12255227 edges, 64181 markings/sec, 145 secs || sara is running 145 secs
lola: 12545538 markings, 12545538 edges, 58062 markings/sec, 150 secs || sara is running 150 secs
lola: 12867362 markings, 12867362 edges, 64365 markings/sec, 155 secs || sara is running 155 secs
lola: 13199555 markings, 13199554 edges, 66439 markings/sec, 160 secs || sara is running 160 secs
lola: 13544640 markings, 13544640 edges, 69017 markings/sec, 165 secs || sara is running 165 secs
lola: 13832703 markings, 13832703 edges, 57613 markings/sec, 170 secs || sara is running 170 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 14010101 markings, 14010100 edges
lola: ========================================
lola: subprocess 10 will run for 542 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((1 <= p414))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((p414 <= 0))
lola: processed formula length: 13
lola: 32 rewrites
lola: closed formula file CTLFireability.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 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: ((1 <= p414))
lola: state equation task get result unparse finished 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: ((p414 <= 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: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 11 will run for 678 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (((1 <= p414)))) AND E (F (E (G (((p414 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 678 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= p414))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((1 <= p414))))
lola: processed formula length: 21
lola: 29 rewrites
lola: closed formula file CTLFireability.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: ((p414 <= 0))
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 CTLFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-11-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: 11946 markings, 11945 edges, 2389 markings/sec, 0 secs || sara is running 0 secs
lola: 23835 markings, 23834 edges, 2378 markings/sec, 5 secs || sara is running 5 secs
lola: 35767 markings, 35766 edges, 2386 markings/sec, 10 secs || sara is running 10 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 40413 markings, 40412 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 898 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((((p9 <= 0) OR (p139 <= 0)) AND ((p9 <= 0) OR (p204 <= 0)) AND ((p9 <= 0) OR (p135 <= 0)) AND ((p9 <= 0) OR (p200 <= 0)) AND ((p9 <= 0) OR (p147 <= 0)) AND ((p9 <= 0) OR (p143 <= 0)) AND ((p9 <= 0) OR (p208 <= 0)) AND ((p9 <= 0) OR (p123 <= 0)) AND ((p9 <= 0) OR (p188 <= 0)) AND ((p9 <= 0) OR (p119 <= 0)) AND ((p9 <= 0) OR (p184 <= 0)) AND ((p9 <= 0) OR (p131 <= 0)) AND ((p9 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 898 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p1) AND (1 <= p2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p1) AND (1 <= p2))
lola: processed formula length: 25
lola: 28 rewrites
lola: closed formula file CTLFireability.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 13 will run for 1347 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p9 <= 0) OR (p139 <= 0)) AND ((p9 <= 0) OR (p204 <= 0)) AND ((p9 <= 0) OR (p135 <= 0)) AND ((p9 <= 0) OR (p200 <= 0)) AND ((p9 <= 0) OR (p147 <= 0)) AND ((p9 <= 0) OR (p143 <= 0)) AND ((p9 <= 0) OR (p208 <= 0)) AND ((p9 <= 0) OR (p123 <= 0)) AND ((p9 <= 0) OR (p188 <= 0)) AND ((p9 <= 0) OR (p119 <= 0)) AND ((p9 <= 0) OR (p184 <= 0)) AND ((p9 <= 0) OR (p131 <= 0)) AND ((p9 <= 0... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p9 <= 0) OR (p139 <= 0)) AND ((p9 <= 0) OR (p204 <= 0)) AND ((p9 <= 0) OR (p135 <= 0)) AND ((p9 <= 0) OR (p200 <= 0)) AND ((p9 <= 0) OR (p147 <= 0)) AND ((p9 <= 0) OR (p143 <= 0)) AND ((p9 <= 0) OR (p208 <= 0)) AND ((p9 <= 0) OR (p123 <= 0)) AND ((p9 <= 0) OR (p188 <= 0)) AND ((p9 <= 0) OR (p119 <= 0)) AND ((p9 <= 0) OR (p184 <= 0)) AND ((p9 <= 0) OR (p131 <= 0)) AND ((p9 <= 0... (shortened)
lola: processed formula length: 3237
lola: 29 rewrites
lola: closed formula file CTLFireability.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: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 7 markings, 6 edges
lola: formula 0: (((1 <= p9) AND (1 <= p139)) OR ((1 <= p9) AND (1 <= p204)) OR ((1 <= p9) AND (1 <= p135)) OR ((1 <= p9) AND (1 <= p200)) OR ((1 <= p9) AND (1 <= p147)) OR ((1 <= p9) AND (1 <= p143)) OR ((1 <= p9) AND (1 <= p208)) OR ((1 <= p9) AND (1 <= p123)) OR ((1 <= p9) AND (1 <= p188)) OR ((1 <= p9) AND (1 <= p119)) OR ((1 <= p9) AND (1 <= p184)) OR ((1 <= p9) AND (1 <= p131)) OR ((1 <= p9) AND (1 <= p196)) OR ((1 <= p9) AND (1 <= p127)) OR ((1 <= p9) AND (1 <= p192)) OR ((1 <= p9) AND (1 <= p172)) OR ((1 <= p9) AND (1 <= p168)) OR ((1 <= p9) AND (1 <= p115)) OR ((1 <= p9) AND (1 <= p180)) OR ((1 <= p9) AND (1 <= p111)) OR ((1 <= p9) AND (1 <= p176)) OR ((1 <= p9) AND (1 <= p156)) OR ((1 <= p9) AND (1 <= p152)) OR ((1 <= p9) AND (1 <= p164)) OR ((1 <= p9) AND (1 <= p160)) OR ((1 <= p9) AND (1 <= p142)) OR ((1 <= p9) AND (1 <= p203)) OR ((1 <= p9) AND (1 <= p138)) OR ((1 <= p9) AND (1 <= p199)) OR ((1 <= p9) AND (1 <= p150)) OR ((1 <= p9) AND (1 <= p146)) OR ((1 <= p9) AND (1 <= p207)) OR ((1 <= p9) AND (1 <= p126)) OR ((1 <= p9) AND (1 <= p187)) OR ((1 <= p9) AND (1 <= p122)) OR ((1 <= p9) AND (1 <= p183)) OR ((1 <= p9) AND (1 <= p134)) OR ((1 <= p9) AND (1 <= p195)) OR ((1 <= p9) AND (1 <= p130)) OR ((1 <= p9) AND (1 <= p191)) OR ((1 <= p9) AND (1 <= p110)) OR ((1 <= p9) AND (1 <= p171)) OR ((1 <= p9) AND (1 <= p167)) OR ((1 <= p9) AND (1 <= p118)) OR ((1 <= p9) AND (1 <= p179)) OR ((1 <= p9) AND (1 <= p114)) OR ((1 <= p9) AND (1 <= p175)) OR ((1 <= p9) AND (1 <= p155)) OR ((1 <= p9) AND (1 <= p151)) OR ((1 <= p9) AND (1 <= p163)) OR ((1 <= p9) AND (1 <= p159)) OR ((1 <= p9) AND (1 <= p141)) OR ((1 <= p9) AND (1 <= p206)) OR ((1 <= p9) AND (1 <= p137)) OR ((1 <= p9) AND (1 <= p202)) OR ((1 <= p9) AND (1 <= p149)) OR ((1 <= p9) AND (1 <= p145)) OR ((1 <= p9) AND (1 <= p190)) OR ((1 <= p9) AND (1 <= p125)) OR ((1 <= p9) AND (1 <= p186)) OR ((1 <= p9) AND (1 <= p121)) OR ((1 <= p9) AND (1 <= p133)) OR ((1 <= p9) AND (1 <= p198)) OR ((1 <= p9) AND (1 <= p129)) OR ((1 <= p9) AND (1 <= p194)) OR ((1 <= p9) AND (1 <= p174)) OR ((1 <= p9) AND (1 <= p109)) OR ((1 <= p9) AND (1 <= p170)) OR ((1 <= p9) AND (1 <= p182)) OR ((1 <= p9) AND (1 <= p117)) OR ((1 <= p9) AND (1 <= p178)) OR ((1 <= p9) AND (1 <= p113)) OR ((1 <= p9) AND (1 <= p158)) OR ((1 <= p9) AND (1 <= p154)) OR ((1 <= p9) AND (1 <= p166)) OR ((1 <= p9) AND (1 <= p162)) OR ((1 <= p9) AND (1 <= p205)) OR ((1 <= p9) AND (1 <= p140)) OR ((1 <= p9) AND (1 <= p201)) OR ((1 <= p9) AND (1 <= p136)) OR ((1 <= p9) AND (1 <= p148)) OR ((1 <= p9) AND (1 <= p209)) OR ((1 <= p9) AND (1 <= p144)) OR ((1 <= p9) AND (1 <= p124)) OR ((1 <= p9) AND (1 <= p189)) OR ((1 <= p9) AND (1 <= p120)) OR ((1 <= p9) AND (1 <= p185)) OR ((1 <= p9) AND (1 <= p197)) OR ((1 <= p9) AND (1 <= p132)) OR ((1 <= p9) AND (1 <= p193)) OR ((1 <= p9) AND (1 <= p128)) OR ((1 <= p9) AND (1 <= p173)) OR ((1 <= p9) AND (1 <= p169)) OR ((1 <= p9) AND (1 <= p116)) OR ((1 <= p9) AND (1 <= p181)) OR ((1 <= p9) AND (1 <= p112)) OR ((1 <= p9) AND (1 <= p177)) OR ((1 <= p9) AND (1 <= p157)) OR ((1 <= p9) AND (1 <= p153)) OR ((1 <= p9) AND (1 <= p165)) OR ((1 <= p9) AND (1 <= p161)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 202 literals and 101 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 1347 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((1 <= p210) AND (1 <= p224)))) OR E (F ((A (G (((1 <= p416)))) AND A (G (((1 <= p415))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1347 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p210) AND (1 <= p224))))
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 <= p210) AND (1 <= p224))))
lola: processed formula length: 37
lola: 29 rewrites
lola: closed formula file CTLFireability.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 <= p210) AND (1 <= p224))
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: 8 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 2695 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((((p9 <= 0) OR (p13 <= 0)) AND ((p9 <= 0) OR (p78 <= 0)) AND ((p9 <= 0) OR (p74 <= 0)) AND ((p9 <= 0) OR (p21 <= 0)) AND ((p9 <= 0) OR (p86 <= 0)) AND ((p9 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p82 <= 0)) AND ((p9 <= 0) OR (p62 <= 0)) AND ((p9 <= 0) OR (p58 <= 0)) AND ((p9 <= 0) OR (p70 <= 0)) AND ((p9 <= 0) OR (p66 <= 0)) AND ((p9 <= 0) OR (p107 <= 0)) AND ((p9 <= 0) OR (p46... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 2695 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p415 <= 0) OR (p413 <= 0)) AND ((p415 <= 0) OR (((p311 <= 0) OR (p385 <= 0)) AND ((p311 <= 0) OR (p387 <= 0)) AND ((p311 <= 0) OR (p389 <= 0)) AND ((p311 <= 0) OR (p391 <= 0)) AND ((p311 <= 0) OR (p377 <= 0)) AND ((p311 <= 0) OR (p379 <= 0)) AND ((p311 <= 0) OR (p381 <= 0)) AND ((p311 <= 0) OR (p383 <= 0)) AND ((p311 <= 0) OR (p369 <= 0)) AND ((p311 <= 0) OR (p371 <= 0)) AND ((p311 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p415 <= 0) OR (p413 <= 0)) AND ((p415 <= 0) OR (((p311 <= 0) OR (p385 <= 0)) AND ((p311 <= 0) OR (p387 <= 0)) AND ((p311 <= 0) OR (p389 <= 0)) AND ((p311 <= 0) OR (p391 <= 0)) AND ((p311 <= 0) OR (p377 <= 0)) AND ((p311 <= 0) OR (p379 <= 0)) AND ((p311 <= 0) OR (p381 <= 0)) AND ((p311 <= 0) OR (p383 <= 0)) AND ((p311 <= 0) OR (p369 <= 0)) AND ((p311 <= 0) OR (p371 <= 0)) AND ((p311 ... (shortened)
lola: processed formula length: 1717
lola: 28 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 101 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: 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: ========================================
lola: ...considering subproblem: A (F ((A (X (((p311 <= 0) OR (p365 <= 0)))) AND ((p414 <= 0)))))
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(((p311 <= 0) OR (p365 <= 0))) AND ((p414 <= 0))))
lola: processed formula length: 57
lola: 30 rewrites
lola: closed formula file CTLFireability.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: 391514 markings, 394046 edges, 78303 markings/sec, 0 secs
lola: 812485 markings, 817800 edges, 84194 markings/sec, 5 secs
lola: 1221930 markings, 1229853 edges, 81889 markings/sec, 10 secs
lola: 1641632 markings, 1652444 edges, 83940 markings/sec, 15 secs
lola: 2062929 markings, 2077220 edges, 84259 markings/sec, 20 secs
lola: 2456624 markings, 2473577 edges, 78739 markings/sec, 25 secs
lola: 2876485 markings, 2896182 edges, 83972 markings/sec, 30 secs
lola: 3290793 markings, 3313164 edges, 82862 markings/sec, 35 secs
lola: 3709189 markings, 3734416 edges, 83679 markings/sec, 40 secs
lola: 4127280 markings, 4155891 edges, 83618 markings/sec, 45 secs
lola: 4519636 markings, 4550998 edges, 78471 markings/sec, 50 secs
lola: 4908733 markings, 4942652 edges, 77819 markings/sec, 55 secs
lola: 5313512 markings, 5350148 edges, 80956 markings/sec, 60 secs
lola: 5725787 markings, 5765022 edges, 82455 markings/sec, 65 secs
lola: 6126988 markings, 6169092 edges, 80240 markings/sec, 70 secs
lola: 6525266 markings, 6570440 edges, 79656 markings/sec, 75 secs
lola: 6922325 markings, 6970500 edges, 79412 markings/sec, 80 secs
lola: 7339171 markings, 7389988 edges, 83369 markings/sec, 85 secs
lola: 7764029 markings, 7817646 edges, 84972 markings/sec, 90 secs
lola: 8189124 markings, 8245589 edges, 85019 markings/sec, 95 secs
lola: 8616068 markings, 8676031 edges, 85389 markings/sec, 100 secs
lola: 9014012 markings, 9076717 edges, 79589 markings/sec, 105 secs
lola: 9440333 markings, 9505848 edges, 85264 markings/sec, 110 secs
lola: 9861982 markings, 9930114 edges, 84330 markings/sec, 115 secs
lola: 10290740 markings, 10362042 edges, 85752 markings/sec, 120 secs
lola: 10704387 markings, 10779042 edges, 82729 markings/sec, 125 secs
lola: 11109192 markings, 11186455 edges, 80961 markings/sec, 130 secs
lola: 11534387 markings, 11614366 edges, 85039 markings/sec, 135 secs
lola: 11963198 markings, 12045923 edges, 85762 markings/sec, 140 secs
lola: 12386321 markings, 12472342 edges, 84625 markings/sec, 145 secs
lola: 12792902 markings, 12882013 edges, 81316 markings/sec, 150 secs
lola: 13210522 markings, 13302295 edges, 83524 markings/sec, 155 secs
lola: 13634539 markings, 13729110 edges, 84803 markings/sec, 160 secs
lola: 14059163 markings, 14156596 edges, 84925 markings/sec, 165 secs
lola: 14486353 markings, 14587316 edges, 85438 markings/sec, 170 secs
lola: 14882738 markings, 14986388 edges, 79277 markings/sec, 175 secs
lola: 15307699 markings, 15414151 edges, 84992 markings/sec, 180 secs
lola: 15732560 markings, 15841628 edges, 84972 markings/sec, 185 secs
lola: 16159873 markings, 16272144 edges, 85463 markings/sec, 190 secs
lola: 16572792 markings, 16688391 edges, 82584 markings/sec, 195 secs
lola: 16979477 markings, 17097676 edges, 81337 markings/sec, 200 secs
lola: 17404525 markings, 17525452 edges, 85010 markings/sec, 205 secs
lola: 17833358 markings, 17957052 edges, 85767 markings/sec, 210 secs
lola: 18256516 markings, 18383521 edges, 84632 markings/sec, 215 secs
lola: 18661781 markings, 18791833 edges, 81053 markings/sec, 220 secs
lola: 19081478 markings, 19214208 edges, 83939 markings/sec, 225 secs
lola: 19504700 markings, 19640222 edges, 84644 markings/sec, 230 secs
lola: 19928609 markings, 20067003 edges, 84782 markings/sec, 235 secs
lola: 20353262 markings, 20495161 edges, 84931 markings/sec, 240 secs
lola: 20748714 markings, 20893295 edges, 79090 markings/sec, 245 secs
lola: 21174272 markings, 21321659 edges, 85112 markings/sec, 250 secs
lola: 21594977 markings, 21744980 edges, 84141 markings/sec, 255 secs
lola: 22022567 markings, 22175711 edges, 85518 markings/sec, 260 secs
lola: 22438227 markings, 22594746 edges, 83132 markings/sec, 265 secs
lola: 22842527 markings, 23001654 edges, 80860 markings/sec, 270 secs
lola: 23264983 markings, 23426834 edges, 84491 markings/sec, 275 secs
lola: 23694083 markings, 23858650 edges, 85820 markings/sec, 280 secs
lola: 24116585 markings, 24284438 edges, 84500 markings/sec, 285 secs
lola: 24523849 markings, 24694833 edges, 81453 markings/sec, 290 secs
lola: 24939853 markings, 25113475 edges, 83201 markings/sec, 295 secs
lola: 25363810 markings, 25540230 edges, 84791 markings/sec, 300 secs
lola: 25787814 markings, 25967065 edges, 84801 markings/sec, 305 secs
lola: 26214206 markings, 26396917 edges, 85278 markings/sec, 310 secs
lola: 26612394 markings, 26797894 edges, 79638 markings/sec, 315 secs
lola: 27038613 markings, 27226911 edges, 85244 markings/sec, 320 secs
lola: 27459305 markings, 27650244 edges, 84138 markings/sec, 325 secs
lola: 27887571 markings, 28081622 edges, 85653 markings/sec, 330 secs
lola: 28304923 markings, 28502378 edges, 83470 markings/sec, 335 secs
lola: 28707857 markings, 28907921 edges, 80587 markings/sec, 340 secs
lola: 29129833 markings, 29332621 edges, 84395 markings/sec, 345 secs
lola: 29559918 markings, 29765410 edges, 86017 markings/sec, 350 secs
lola: 29982971 markings, 30191754 edges, 84611 markings/sec, 355 secs
lola: 30391041 markings, 30602961 edges, 81614 markings/sec, 360 secs
lola: 30806887 markings, 31021447 edges, 83169 markings/sec, 365 secs
lola: 31229805 markings, 31447156 edges, 84584 markings/sec, 370 secs
lola: 31653394 markings, 31873568 edges, 84718 markings/sec, 375 secs
lola: 31867819 markings, 32095847 edges, 42885 markings/sec, 380 secs
lola: 32020164 markings, 32256910 edges, 30469 markings/sec, 385 secs
lola: 32186144 markings, 32432889 edges, 33196 markings/sec, 390 secs
lola: 32372916 markings, 32630664 edges, 37354 markings/sec, 395 secs
lola: 32563800 markings, 32832340 edges, 38177 markings/sec, 400 secs
lola: 32753449 markings, 33033742 edges, 37930 markings/sec, 405 secs
lola: 32935040 markings, 33226687 edges, 36318 markings/sec, 410 secs
lola: 33126440 markings, 33428880 edges, 38280 markings/sec, 415 secs
lola: 33316232 markings, 33629984 edges, 37958 markings/sec, 420 secs
lola: 33501082 markings, 33825577 edges, 36970 markings/sec, 425 secs
lola: 33692458 markings, 34027908 edges, 38275 markings/sec, 430 secs
lola: 33880806 markings, 34228065 edges, 37670 markings/sec, 435 secs
lola: 34063285 markings, 34422616 edges, 36496 markings/sec, 440 secs
lola: 34248811 markings, 34620618 edges, 37105 markings/sec, 445 secs
lola: 34413688 markings, 34796770 edges, 32975 markings/sec, 450 secs
lola: 34597449 markings, 34992904 edges, 36752 markings/sec, 455 secs
lola: 34781072 markings, 35189891 edges, 36725 markings/sec, 460 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 34856817 markings, 35271624 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (A (X (((1 <= p6) AND (1 <= p7))))))
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(((1 <= p6) AND (1 <= p7))))
lola: processed formula length: 33
lola: 30 rewrites
lola: closed formula file CTLFireability.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: 343967 markings, 897999 edges, 68793 markings/sec, 0 secs
lola: 624421 markings, 1842901 edges, 56091 markings/sec, 5 secs
lola: 879392 markings, 2798508 edges, 50994 markings/sec, 10 secs
lola: 1126873 markings, 3736476 edges, 49496 markings/sec, 15 secs
lola: 1381259 markings, 4685746 edges, 50877 markings/sec, 20 secs
lola: 1725205 markings, 5579925 edges, 68789 markings/sec, 25 secs
lola: 2000424 markings, 6521676 edges, 55044 markings/sec, 30 secs
lola: 2255707 markings, 7478060 edges, 51057 markings/sec, 35 secs
lola: 2503522 markings, 8416904 edges, 49563 markings/sec, 40 secs
lola: 2762487 markings, 9365453 edges, 51793 markings/sec, 45 secs
lola: 3106441 markings, 10261573 edges, 68791 markings/sec, 50 secs
lola: 3379595 markings, 11208067 edges, 54631 markings/sec, 55 secs
lola: 3636507 markings, 12167782 edges, 51382 markings/sec, 60 secs
lola: 3886266 markings, 13111833 edges, 49952 markings/sec, 65 secs
lola: 4143803 markings, 14063288 edges, 51507 markings/sec, 70 secs
lola: 4487754 markings, 14958843 edges, 68790 markings/sec, 75 secs
lola: 4742196 markings, 15854290 edges, 50888 markings/sec, 80 secs
lola: 4996157 markings, 16807923 edges, 50792 markings/sec, 85 secs
lola: 5246538 markings, 17752121 edges, 50076 markings/sec, 90 secs
lola: 5524769 markings, 18689814 edges, 55646 markings/sec, 95 secs
lola: 5867291 markings, 19587119 edges, 68504 markings/sec, 100 secs
lola: 6123048 markings, 20544787 edges, 51151 markings/sec, 105 secs
lola: 6376428 markings, 21496353 edges, 50676 markings/sec, 110 secs
lola: 6626442 markings, 22440639 edges, 50003 markings/sec, 115 secs
lola: 6906038 markings, 23378182 edges, 55919 markings/sec, 120 secs
lola: 7250032 markings, 24282951 edges, 68799 markings/sec, 125 secs
lola: 7510292 markings, 25250018 edges, 52052 markings/sec, 130 secs
lola: 7767223 markings, 26210987 edges, 51386 markings/sec, 135 secs
lola: 8020793 markings, 27162636 edges, 50714 markings/sec, 140 secs
lola: 8287558 markings, 28117488 edges, 53353 markings/sec, 145 secs
lola: 8631562 markings, 29023888 edges, 68801 markings/sec, 150 secs
lola: 8890351 markings, 29938167 edges, 51758 markings/sec, 155 secs
lola: 9144624 markings, 30892395 edges, 50855 markings/sec, 160 secs
lola: 9394499 markings, 31836309 edges, 49975 markings/sec, 165 secs
lola: 9668689 markings, 32777556 edges, 54838 markings/sec, 170 secs
lola: 10012618 markings, 33669071 edges, 68786 markings/sec, 175 secs
lola: 10269101 markings, 34623737 edges, 51297 markings/sec, 180 secs
lola: 10521226 markings, 35573005 edges, 50425 markings/sec, 185 secs
lola: 10770301 markings, 36514584 edges, 49815 markings/sec, 190 secs
lola: 11049863 markings, 37446461 edges, 55912 markings/sec, 195 secs
lola: 11388774 markings, 38343645 edges, 67782 markings/sec, 200 secs
lola: 11644298 markings, 39300037 edges, 51105 markings/sec, 205 secs
lola: 11895836 markings, 40248195 edges, 50308 markings/sec, 210 secs
lola: 12146573 markings, 41193792 edges, 50147 markings/sec, 215 secs
lola: 12431095 markings, 42127166 edges, 56904 markings/sec, 220 secs
lola: 12767661 markings, 43028462 edges, 67313 markings/sec, 225 secs
lola: 13024236 markings, 43988528 edges, 51315 markings/sec, 230 secs
lola: 13277086 markings, 44939430 edges, 50570 markings/sec, 235 secs
lola: 13527644 markings, 45884447 edges, 50112 markings/sec, 240 secs
lola: 13812351 markings, 46812921 edges, 56941 markings/sec, 245 secs
lola: 14147382 markings, 47716081 edges, 67006 markings/sec, 250 secs
lola: 14403615 markings, 48675037 edges, 51247 markings/sec, 255 secs
lola: 14655811 markings, 49623935 edges, 50439 markings/sec, 260 secs
lola: 14906217 markings, 50569134 edges, 50081 markings/sec, 265 secs
lola: 15193620 markings, 51500841 edges, 57481 markings/sec, 270 secs
lola: 15527211 markings, 52404140 edges, 66718 markings/sec, 275 secs
lola: 15783281 markings, 53362517 edges, 51214 markings/sec, 280 secs
lola: 16035311 markings, 54310966 edges, 50406 markings/sec, 285 secs
lola: 16285445 markings, 55255665 edges, 50027 markings/sec, 290 secs
lola: 16574859 markings, 56183154 edges, 57883 markings/sec, 295 secs
lola: 16905715 markings, 57088907 edges, 66171 markings/sec, 300 secs
lola: 17161486 markings, 58046749 edges, 51154 markings/sec, 305 secs
lola: 17413629 markings, 58995476 edges, 50429 markings/sec, 310 secs
lola: 17663960 markings, 59939790 edges, 50066 markings/sec, 315 secs
lola: 17956104 markings, 60866544 edges, 58429 markings/sec, 320 secs
lola: 18283305 markings, 61771539 edges, 65440 markings/sec, 325 secs
lola: 18538839 markings, 62728157 edges, 51107 markings/sec, 330 secs
lola: 18790102 markings, 63675560 edges, 50253 markings/sec, 335 secs
lola: 19041968 markings, 64623123 edges, 50373 markings/sec, 340 secs
lola: 19337317 markings, 65543387 edges, 59070 markings/sec, 345 secs
lola: 19661106 markings, 66454493 edges, 64758 markings/sec, 350 secs
lola: 19917117 markings, 67412715 edges, 51202 markings/sec, 355 secs
lola: 20168390 markings, 68359468 edges, 50255 markings/sec, 360 secs
lola: 20418588 markings, 69303712 edges, 50040 markings/sec, 365 secs
lola: 20718544 markings, 70223338 edges, 59991 markings/sec, 370 secs
lola: 21038766 markings, 71136975 edges, 64044 markings/sec, 375 secs
lola: 21294906 markings, 72095646 edges, 51228 markings/sec, 380 secs
lola: 21544684 markings, 73038621 edges, 49956 markings/sec, 385 secs
lola: 21795759 markings, 73984785 edges, 50215 markings/sec, 390 secs
lola: 22099771 markings, 74903054 edges, 60802 markings/sec, 395 secs
lola: 22415941 markings, 75817911 edges, 63234 markings/sec, 400 secs
lola: 22670727 markings, 76773387 edges, 50957 markings/sec, 405 secs
lola: 22919857 markings, 77715242 edges, 49826 markings/sec, 410 secs
lola: 23170154 markings, 78659557 edges, 50059 markings/sec, 415 secs
lola: 23480928 markings, 79568785 edges, 62155 markings/sec, 420 secs
lola: 23789443 markings, 80491147 edges, 61703 markings/sec, 425 secs
lola: 24031175 markings, 81414374 edges, 48346 markings/sec, 430 secs
lola: 24279204 markings, 82354175 edges, 49606 markings/sec, 435 secs
lola: 24531734 markings, 83304052 edges, 50506 markings/sec, 440 secs
lola: 24861971 markings, 84211546 edges, 66047 markings/sec, 445 secs
lola: 25153163 markings, 85139747 edges, 58238 markings/sec, 450 secs
lola: 25409746 markings, 86099771 edges, 51317 markings/sec, 455 secs
lola: 25657529 markings, 87038144 edges, 49557 markings/sec, 460 secs
lola: 25910977 markings, 87990071 edges, 50690 markings/sec, 465 secs
lola: 26243200 markings, 88891556 edges, 66445 markings/sec, 470 secs
lola: 26531467 markings, 89824363 edges, 57653 markings/sec, 475 secs
lola: 26785925 markings, 90778788 edges, 50892 markings/sec, 480 secs
lola: 27033610 markings, 91716986 edges, 49537 markings/sec, 485 secs
lola: 27285615 markings, 92665823 edges, 50401 markings/sec, 490 secs
lola: 27624397 markings, 93565248 edges, 67756 markings/sec, 495 secs
lola: 27905827 markings, 94499051 edges, 56286 markings/sec, 500 secs
lola: 28161577 markings, 95456244 edges, 51150 markings/sec, 505 secs
lola: 28409012 markings, 96394098 edges, 49487 markings/sec, 510 secs
lola: 28661643 markings, 97343919 edges, 50526 markings/sec, 515 secs
lola: 29005601 markings, 98240521 edges, 68792 markings/sec, 520 secs
lola: 29283316 markings, 99180791 edges, 55543 markings/sec, 525 secs
lola: 29539011 markings, 100137972 edges, 51139 markings/sec, 530 secs
lola: 29786688 markings, 101076557 edges, 49535 markings/sec, 535 secs
lola: 30042894 markings, 102028422 edges, 51241 markings/sec, 540 secs
lola: 30386849 markings, 102924545 edges, 68791 markings/sec, 545 secs
lola: 30662747 markings, 103867470 edges, 55180 markings/sec, 550 secs
lola: 30918658 markings, 104825360 edges, 51182 markings/sec, 555 secs
lola: 31167816 markings, 105767308 edges, 49832 markings/sec, 560 secs
lola: 31424183 markings, 106720714 edges, 51273 markings/sec, 565 secs
lola: 31768130 markings, 107615272 edges, 68789 markings/sec, 570 secs
lola: 31815071 markings, 108511070 edges, 9388 markings/sec, 575 secs
lola: 31876072 markings, 109335977 edges, 12200 markings/sec, 580 secs
lola: 31937690 markings, 110168101 edges, 12324 markings/sec, 585 secs
lola: 31999528 markings, 111004557 edges, 12368 markings/sec, 590 secs
lola: 32061435 markings, 111842005 edges, 12381 markings/sec, 595 secs
lola: 32123698 markings, 112683779 edges, 12453 markings/sec, 600 secs
lola: 32185879 markings, 113524346 edges, 12436 markings/sec, 605 secs
lola: 32248241 markings, 114368545 edges, 12472 markings/sec, 610 secs
lola: 32310878 markings, 115217180 edges, 12527 markings/sec, 615 secs
lola: 32374170 markings, 116073365 edges, 12658 markings/sec, 620 secs
lola: 32437979 markings, 116935534 edges, 12762 markings/sec, 625 secs
lola: 32501715 markings, 117795995 edges, 12747 markings/sec, 630 secs
lola: 32565842 markings, 118661201 edges, 12825 markings/sec, 635 secs
lola: 32630389 markings, 119531818 edges, 12909 markings/sec, 640 secs
lola: 32694783 markings, 120403967 edges, 12879 markings/sec, 645 secs
lola: 32759364 markings, 121281282 edges, 12916 markings/sec, 650 secs
lola: 32824772 markings, 122164003 edges, 13082 markings/sec, 655 secs
lola: 32891098 markings, 123057880 edges, 13265 markings/sec, 660 secs
lola: 32957344 markings, 123953756 edges, 13249 markings/sec, 665 secs
lola: 33023384 markings, 124851263 edges, 13208 markings/sec, 670 secs
lola: 33090264 markings, 125752209 edges, 13376 markings/sec, 675 secs
lola: 33157664 markings, 126661061 edges, 13480 markings/sec, 680 secs
lola: 33224426 markings, 127569190 edges, 13352 markings/sec, 685 secs
lola: 33292294 markings, 128483408 edges, 13574 markings/sec, 690 secs
lola: 33360568 markings, 129405195 edges, 13655 markings/sec, 695 secs
lola: 33428716 markings, 130328054 edges, 13630 markings/sec, 700 secs
lola: 33496387 markings, 131238514 edges, 13534 markings/sec, 705 secs
lola: 33542791 markings, 131865842 edges, 9281 markings/sec, 710 secs
lola: 33569367 markings, 132229316 edges, 5315 markings/sec, 715 secs
lola: 33596243 markings, 132594905 edges, 5375 markings/sec, 720 secs
lola: 33623593 markings, 132961153 edges, 5470 markings/sec, 725 secs
lola: 33651249 markings, 133332585 edges, 5531 markings/sec, 730 secs
lola: 33678863 markings, 133708734 edges, 5523 markings/sec, 735 secs
lola: 33706942 markings, 134089624 edges, 5616 markings/sec, 740 secs
lola: 33735266 markings, 134474533 edges, 5665 markings/sec, 745 secs
lola: 33764045 markings, 134862288 edges, 5756 markings/sec, 750 secs
lola: 33793128 markings, 135253364 edges, 5817 markings/sec, 755 secs
lola: 33822493 markings, 135648412 edges, 5873 markings/sec, 760 secs
lola: 33852228 markings, 136049789 edges, 5947 markings/sec, 765 secs
lola: 33882244 markings, 136455912 edges, 6003 markings/sec, 770 secs
lola: 33912584 markings, 136866642 edges, 6068 markings/sec, 775 secs
lola: 33943409 markings, 137283550 edges, 6165 markings/sec, 780 secs
lola: 33974711 markings, 137705811 edges, 6260 markings/sec, 785 secs
lola: 34008406 markings, 138161816 edges, 6739 markings/sec, 790 secs
lola: 34038970 markings, 138575146 edges, 6113 markings/sec, 795 secs
lola: 34071532 markings, 139017404 edges, 6512 markings/sec, 800 secs
lola: 34104551 markings, 139466880 edges, 6604 markings/sec, 805 secs
lola: 34138231 markings, 139921851 edges, 6736 markings/sec, 810 secs
lola: 34172676 markings, 140385734 edges, 6889 markings/sec, 815 secs
lola: 34207782 markings, 140856899 edges, 7021 markings/sec, 820 secs
lola: 34243048 markings, 141338348 edges, 7053 markings/sec, 825 secs
lola: 34279303 markings, 141827769 edges, 7251 markings/sec, 830 secs
lola: 34316547 markings, 142327205 edges, 7449 markings/sec, 835 secs
lola: 34353925 markings, 142838862 edges, 7476 markings/sec, 840 secs
lola: 34393029 markings, 143361530 edges, 7821 markings/sec, 845 secs
lola: 34432433 markings, 143899211 edges, 7881 markings/sec, 850 secs
lola: 34473355 markings, 144450084 edges, 8184 markings/sec, 855 secs
lola: 34515197 markings, 145014109 edges, 8368 markings/sec, 860 secs
lola: 34558125 markings, 145597446 edges, 8586 markings/sec, 865 secs
lola: 34602551 markings, 146198904 edges, 8885 markings/sec, 870 secs
lola: 34648577 markings, 146821978 edges, 9205 markings/sec, 875 secs
lola: 34696716 markings, 147471359 edges, 9628 markings/sec, 880 secs
lola: 34747064 markings, 148148823 edges, 10070 markings/sec, 885 secs
lola: 34799159 markings, 148856058 edges, 10419 markings/sec, 890 secs
lola: 34854613 markings, 149603313 edges, 11091 markings/sec, 895 secs
lola: 34864432 markings, 150231301 edges, 1964 markings/sec, 900 secs
lola: 34867284 markings, 150838916 edges, 570 markings/sec, 905 secs
lola: 34869902 markings, 151396145 edges, 524 markings/sec, 910 secs
lola: 34872754 markings, 152003622 edges, 570 markings/sec, 915 secs
lola: 34875564 markings, 152606221 edges, 562 markings/sec, 920 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 34877423 markings, 153007424 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (G ((((p9 <= 0) OR (p13 <= 0)) AND ((p9 <= 0) OR (p78 <= 0)) AND ((p9 <= 0) OR (p74 <= 0)) AND ((p9 <= 0) OR (p21 <= 0)) AND ((p9 <= 0) OR (p86 <= 0)) AND ((p9 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p82 <= 0)) AND ((p9 <= 0) OR (p62 <= 0)) AND ((p9 <= 0) OR (p58 <= 0)) AND ((p9 <= 0) OR (p70 <= 0)) AND ((p9 <= 0) OR (p66 <= 0)) AND ((p9 <= 0) OR (p107 <= 0)) AND ((p9 <= 0) OR (p46... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (((p415 <= 0) OR (p413 <= 0)) AND ((p415 <= 0) OR (((p311 <= 0) OR (p385 <= 0)) AND ((p311 <= 0) OR (p387 <= 0)) AND ((p311 <= 0) OR (p389 <= 0)) AND ((p311 <= 0) OR (p391 <= 0)) AND ((p311 <= 0) OR (p377 <= 0)) AND ((p311 <= 0) OR (p379 <= 0)) AND ((p311 <= 0) OR (p381 <= 0)) AND ((p311 <= 0) OR (p383 <= 0)) AND ((p311 <= 0) OR (p369 <= 0)) AND ((p311 <= 0) OR (p371 <= 0)) AND ((p311 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p415 <= 0) OR (p413 <= 0)) AND ((p415 <= 0) OR (((p311 <= 0) OR (p385 <= 0)) AND ((p311 <= 0) OR (p387 <= 0)) AND ((p311 <= 0) OR (p389 <= 0)) AND ((p311 <= 0) OR (p391 <= 0)) AND ((p311 <= 0) OR (p377 <= 0)) AND ((p311 <= 0) OR (p379 <= 0)) AND ((p311 <= 0) OR (p381 <= 0)) AND ((p311 <= 0) OR (p383 <= 0)) AND ((p311 <= 0) OR (p369 <= 0)) AND ((p311 <= 0) OR (p371 <= 0)) AND ((p311 ... (shortened)
lola: processed formula length: 1717
lola: 28 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 101 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: ========================================
lola: ...considering subproblem: A (G ((((p9 <= 0) OR (p13 <= 0)) AND ((p9 <= 0) OR (p78 <= 0)) AND ((p9 <= 0) OR (p74 <= 0)) AND ((p9 <= 0) OR (p21 <= 0)) AND ((p9 <= 0) OR (p86 <= 0)) AND ((p9 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p82 <= 0)) AND ((p9 <= 0) OR (p62 <= 0)) AND ((p9 <= 0) OR (p58 <= 0)) AND ((p9 <= 0) OR (p70 <= 0)) AND ((p9 <= 0) OR (p66 <= 0)) AND ((p9 <= 0) OR (p107 <= 0)) AND ((p9 <= 0) OR (p46 ... (shortened)
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 ((((p9 <= 0) OR (p13 <= 0)) AND ((p9 <= 0) OR (p78 <= 0)) AND ((p9 <= 0) OR (p74 <= 0)) AND ((p9 <= 0) OR (p21 <= 0)) AND ((p9 <= 0) OR (p86 <= 0)) AND ((p9 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p82 <= 0)) AND ((p9 <= 0) OR (p62 <= 0)) AND ((p9 <= 0) OR (p58 <= 0)) AND ((p9 <= 0) OR (p70 <= 0)) AND ((p9 <= 0) OR (p66 <= 0)) AND ((p9 <= 0) OR (p107 <= 0)) AND ((p9 <= 0) OR (p46 ... (shortened)
lola: processed formula length: 3083
lola: 30 rewrites
lola: closed formula file CTLFireability.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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes no yes no yes no yes no yes yes no yes no
lola:
preliminary result: yes no yes no yes no yes no yes no yes yes no yes no
lola: memory consumption: 357852 KB
lola: time consumption: 2271 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished
--------------------
content from 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="AirplaneLD-PT-0100"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itslola"
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-4028"
echo " Executing tool itslola"
echo " Input is AirplaneLD-PT-0100, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r166-smll-158987787500268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AirplaneLD-PT-0100.tgz
mv AirplaneLD-PT-0100 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; 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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;