About the Execution of ITS-LoLa for Dekker-PT-100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15789.010 | 3600000.00 | 2068297.00 | 38499.60 | ?FFTTFTT?TFFFF?F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r178-tajo-158987882200340.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 Dekker-PT-100, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882200340
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.1M
-rw-r--r-- 1 mcc users 3.2K Apr 27 14:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 27 14:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 27 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 27 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 14:36 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Apr 27 14:36 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 27 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 27 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 27 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 27 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 27 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 27 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 27 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 27 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 equiv_col
-rw-r--r-- 1 mcc users 4 Apr 27 14:36 instance
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 iscolored
-rw-r--r-- 1 mcc users 5.9M Apr 27 14:36 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 Dekker-PT-100-CTLFireability-00
FORMULA_NAME Dekker-PT-100-CTLFireability-01
FORMULA_NAME Dekker-PT-100-CTLFireability-02
FORMULA_NAME Dekker-PT-100-CTLFireability-03
FORMULA_NAME Dekker-PT-100-CTLFireability-04
FORMULA_NAME Dekker-PT-100-CTLFireability-05
FORMULA_NAME Dekker-PT-100-CTLFireability-06
FORMULA_NAME Dekker-PT-100-CTLFireability-07
FORMULA_NAME Dekker-PT-100-CTLFireability-08
FORMULA_NAME Dekker-PT-100-CTLFireability-09
FORMULA_NAME Dekker-PT-100-CTLFireability-10
FORMULA_NAME Dekker-PT-100-CTLFireability-11
FORMULA_NAME Dekker-PT-100-CTLFireability-12
FORMULA_NAME Dekker-PT-100-CTLFireability-13
FORMULA_NAME Dekker-PT-100-CTLFireability-14
FORMULA_NAME Dekker-PT-100-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1591217808507
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 20:56:49] [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-03 20:56:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 20:56:50] [INFO ] Load time of PNML (sax parser for PT used): 370 ms
[2020-06-03 20:56:50] [INFO ] Transformed 500 places.
[2020-06-03 20:56:50] [INFO ] Transformed 10200 transitions.
[2020-06-03 20:56:50] [INFO ] Found NUPN structural information;
[2020-06-03 20:56:50] [INFO ] Parsed PT model containing 500 places and 10200 transitions in 461 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 94 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 1610 ms. (steps per millisecond=62 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1]
[2020-06-03 20:56:52] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 500 cols
[2020-06-03 20:56:52] [INFO ] Computed 300 place invariants in 37 ms
[2020-06-03 20:56:52] [INFO ] [Real]Absence check using 200 positive place invariants in 103 ms returned sat
[2020-06-03 20:56:52] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 48 ms returned sat
[2020-06-03 20:56:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:56:53] [INFO ] [Real]Absence check using state equation in 677 ms returned sat
[2020-06-03 20:56:53] [INFO ] State equation strengthened by 100 read => feed constraints.
[2020-06-03 20:56:53] [INFO ] [Real]Added 100 Read/Feed constraints in 38 ms returned sat
[2020-06-03 20:56:53] [INFO ] Deduced a trap composed of 4 places in 160 ms
[2020-06-03 20:56:53] [INFO ] Deduced a trap composed of 4 places in 113 ms
[2020-06-03 20:56:53] [INFO ] Deduced a trap composed of 5 places in 79 ms
[2020-06-03 20:56:54] [INFO ] Deduced a trap composed of 6 places in 104 ms
[2020-06-03 20:56:54] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-06-03 20:56:54] [INFO ] Deduced a trap composed of 6 places in 64 ms
[2020-06-03 20:56:54] [INFO ] Deduced a trap composed of 6 places in 63 ms
[2020-06-03 20:56:54] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2020-06-03 20:56:54] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2020-06-03 20:56:54] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2020-06-03 20:56:54] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2020-06-03 20:56:54] [INFO ] Deduced a trap composed of 4 places in 50 ms
[2020-06-03 20:56:54] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2020-06-03 20:56:54] [INFO ] Deduced a trap composed of 4 places in 46 ms
[2020-06-03 20:56:54] [INFO ] Deduced a trap composed of 4 places in 42 ms
[2020-06-03 20:56:54] [INFO ] Deduced a trap composed of 4 places in 33 ms
[2020-06-03 20:56:55] [INFO ] Deduced a trap composed of 5 places in 73 ms
[2020-06-03 20:56:55] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-06-03 20:56:55] [INFO ] Deduced a trap composed of 6 places in 60 ms
[2020-06-03 20:56:55] [INFO ] Deduced a trap composed of 6 places in 40 ms
[2020-06-03 20:56:55] [INFO ] Deduced a trap composed of 5 places in 69 ms
[2020-06-03 20:56:55] [INFO ] Deduced a trap composed of 5 places in 59 ms
[2020-06-03 20:56:55] [INFO ] Deduced a trap composed of 5 places in 56 ms
[2020-06-03 20:56:55] [INFO ] Deduced a trap composed of 4 places in 48 ms
[2020-06-03 20:56:55] [INFO ] Deduced a trap composed of 5 places in 68 ms
[2020-06-03 20:56:55] [INFO ] Deduced a trap composed of 5 places in 59 ms
[2020-06-03 20:56:55] [INFO ] Deduced a trap composed of 4 places in 46 ms
[2020-06-03 20:56:55] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 2405 ms
[2020-06-03 20:56:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:56:56] [INFO ] [Nat]Absence check using 200 positive place invariants in 93 ms returned sat
[2020-06-03 20:56:56] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 49 ms returned sat
[2020-06-03 20:56:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:56:56] [INFO ] [Nat]Absence check using state equation in 685 ms returned sat
[2020-06-03 20:56:56] [INFO ] [Nat]Added 100 Read/Feed constraints in 43 ms returned sat
[2020-06-03 20:56:57] [INFO ] Deduced a trap composed of 4 places in 79 ms
[2020-06-03 20:56:57] [INFO ] Deduced a trap composed of 4 places in 143 ms
[2020-06-03 20:56:57] [INFO ] Deduced a trap composed of 5 places in 145 ms
[2020-06-03 20:56:57] [INFO ] Deduced a trap composed of 6 places in 96 ms
[2020-06-03 20:56:57] [INFO ] Deduced a trap composed of 4 places in 130 ms
[2020-06-03 20:56:57] [INFO ] Deduced a trap composed of 6 places in 107 ms
[2020-06-03 20:56:57] [INFO ] Deduced a trap composed of 6 places in 95 ms
[2020-06-03 20:56:58] [INFO ] Deduced a trap composed of 4 places in 85 ms
[2020-06-03 20:56:58] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2020-06-03 20:56:58] [INFO ] Deduced a trap composed of 4 places in 67 ms
[2020-06-03 20:56:58] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2020-06-03 20:56:58] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2020-06-03 20:56:58] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2020-06-03 20:56:58] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2020-06-03 20:56:58] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2020-06-03 20:56:58] [INFO ] Deduced a trap composed of 4 places in 56 ms
[2020-06-03 20:56:58] [INFO ] Deduced a trap composed of 4 places in 79 ms
[2020-06-03 20:56:58] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-06-03 20:56:59] [INFO ] Deduced a trap composed of 5 places in 80 ms
[2020-06-03 20:56:59] [INFO ] Deduced a trap composed of 5 places in 72 ms
[2020-06-03 20:56:59] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2020-06-03 20:56:59] [INFO ] Deduced a trap composed of 6 places in 50 ms
[2020-06-03 20:56:59] [INFO ] Deduced a trap composed of 4 places in 41 ms
[2020-06-03 20:56:59] [INFO ] Deduced a trap composed of 4 places in 86 ms
[2020-06-03 20:56:59] [INFO ] Deduced a trap composed of 5 places in 71 ms
[2020-06-03 20:56:59] [INFO ] Deduced a trap composed of 5 places in 82 ms
[2020-06-03 20:56:59] [INFO ] Deduced a trap composed of 4 places in 67 ms
[2020-06-03 20:56:59] [INFO ] Deduced a trap composed of 6 places in 71 ms
[2020-06-03 20:56:59] [INFO ] Deduced a trap composed of 4 places in 45 ms
[2020-06-03 20:57:00] [INFO ] Deduced a trap composed of 5 places in 62 ms
[2020-06-03 20:57:00] [INFO ] Deduced a trap composed of 4 places in 61 ms
[2020-06-03 20:57:00] [INFO ] Deduced a trap composed of 6 places in 57 ms
[2020-06-03 20:57:00] [INFO ] Deduced a trap composed of 4 places in 56 ms
[2020-06-03 20:57:00] [INFO ] Deduced a trap composed of 4 places in 45 ms
[2020-06-03 20:57:00] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 3535 ms
[2020-06-03 20:57:00] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 267 ms.
[2020-06-03 20:57:02] [INFO ] Added : 101 causal constraints over 21 iterations in 1873 ms. Result :sat
[2020-06-03 20:57:03] [INFO ] Flatten gal took : 837 ms
[2020-06-03 20:57:04] [INFO ] Flatten gal took : 632 ms
[2020-06-03 20:57:04] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2020-06-03 20:57:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 139 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ Dekker-PT-100 @ 3570 seconds
FORMULA Dekker-PT-100-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Dekker-PT-100-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Dekker-PT-100-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Dekker-PT-100-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Dekker-PT-100-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Dekker-PT-100-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Dekker-PT-100-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Dekker-PT-100-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Dekker-PT-100-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Dekker-PT-100-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Dekker-PT-100-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Dekker-PT-100-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Dekker-PT-100-CTLFireability-08 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Dekker-PT-100-CTLFireability-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Dekker-PT-100-CTLFireability-00 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Dekker-PT-100-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1584
rslt: Output for CTLFireability @ Dekker-PT-100
{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 20:57:04 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 218
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 218
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"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": "EX(((1 <= p35) AND (1 <= p191) AND (1 <= p252)))",
"processed_size": 48,
"rewrites": 29
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 233
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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": "((p27 <= 0) OR (p133 <= 0) OR (p240 <= 0))",
"processed_size": 44,
"rewrites": 28
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 250
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (G ((((p115 <= 0) OR (p129 <= 0) OR (p393 <= 0)) AND ((p13 <= 0) OR (p117 <= 0) OR (p219 <= 0)))))",
"processed_size": 104,
"rewrites": 29
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 790
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 233
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 24,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 23,
"visible_transitions": 0
},
"processed": "A(((p159 <= 0) OR (p185 <= 0) OR (p438 <= 0) OR (p1 <= 0) OR (p119 <= 0) OR (p378 <= 0) OR ((1 <= p159) AND (1 <= p189) AND (1 <= p483)) OR ((1 <= p37) AND (1 <= p197) AND (1 <= p255)) OR ((1 <= p99) AND (1 <= p155) AND (1 <= p432) AND (1 <= p107) AND (1 <= p151) AND (1 <= p360))) U AX(((1 <= p75) AND (1 <= p147) AND (1 <= p420) AND (1 <= p65) AND (1 <= p81) AND (1 <= p321))))",
"processed_size": 387,
"rewrites": 30
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 251
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 5,
"adisj": 2,
"aneg": 0,
"comp": 24,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 24,
"visible_transitions": 0
},
"processed": "EG((AF(((1 <= p15) AND (1 <= p69) AND (1 <= p222))) OR ((EX(((1 <= p7) AND (1 <= p125) AND (1 <= p210))) AND ((p135 <= 0) OR (p171 <= 0) OR (p402 <= 0) OR ((1 <= p105) AND (1 <= p199) AND (1 <= p498)) OR ((1 <= p93) AND (1 <= p107) AND (1 <= p339)))) OR ((1 <= p151) AND (1 <= p197) AND (1 <= p426) AND (1 <= p147) AND (1 <= p163) AND (1 <= p420) AND ((p131 <= 0) OR (p139 <= 0) OR (p408 <= 0))))))",
"processed_size": 404,
"rewrites": 31
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 4,
"markings": 3,
"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"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 272
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 3,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "AF((((1 <= p29) AND (1 <= p113) AND (1 <= p243)) OR (AG(((1 <= p91) AND (1 <= p141) AND (1 <= p336))) AND AX(((1 <= p187) AND (1 <= p481))))))",
"processed_size": 142,
"rewrites": 31
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 6,
"markings": 3,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "A (G (((p33 <= 0) OR (p91 <= 0) OR (p249 <= 0))))",
"processed_size": 51,
"rewrites": 30
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 330
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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 (F (((1 <= p9) AND (1 <= p35) AND (1 <= p213))))",
"processed_size": 50,
"rewrites": 29
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 371
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "A (G (((p51 <= 0) OR (p187 <= 0) OR (p480 <= 0))))",
"processed_size": 52,
"rewrites": 30
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 424
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p89) AND (1 <= p177) AND (1 <= p333)) OR ((1 <= p71) AND (1 <= p107) AND (1 <= p306)))))",
"processed_size": 103,
"rewrites": 29
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 495
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "((p83 <= 0) OR (p123 <= 0) OR (p324 <= 0))",
"processed_size": 44,
"rewrites": 31
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 399
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "((p15 <= 0) OR (p67 <= 0) OR (p300 <= 0))",
"processed_size": 43,
"rewrites": 31
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 399
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 742
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "((p47 <= 0) OR (p153 <= 0) OR (p429 <= 0))",
"processed_size": 44,
"rewrites": 31
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 399
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1315
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 5,
"adisj": 1,
"aneg": 2,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "(A((((p65 <= 0) OR (p195 <= 0) OR (p297 <= 0)) AND ((p5 <= 0) OR (p91 <= 0) OR (p336 <= 0))) R ((p63 <= 0) OR (p109 <= 0) OR (p363 <= 0))) AND A(((1 <= p1) AND (1 <= p95) AND (1 <= p342)) U EG(((1 <= p184) AND (1 <= p476)))))",
"processed_size": 231,
"rewrites": 31
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 5,
"markings": 3,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2630
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2630
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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": "((p25 <= 0) OR (p187 <= 0) OR (p480 <= 0))",
"processed_size": 44,
"rewrites": 28
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "((1 <= p17) AND (1 <= p161) AND (1 <= p225))",
"processed_size": 44,
"rewrites": 28
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 17,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (G ((((1 <= p69) AND (1 <= p113) AND (1 <= p369)) OR ((1 <= p3) AND (1 <= p37) AND (1 <= p255)))))",
"processed_size": 101,
"rewrites": 30
},
"result":
{
"edges": 0,
"markings": 0,
"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"
},
"stateequation":
{
"literals": 18,
"problems": 9
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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 (((p133 <= 0) OR (p163 <= 0) OR (p399 <= 0))))",
"processed_size": 53,
"rewrites": 29
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 399
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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": "((p25 <= 0) OR (p187 <= 0) OR (p480 <= 0))",
"processed_size": 44,
"rewrites": 28
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 20,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 19,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 4552,
"runtime": 1986.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G((** OR E(F(**))))) : A(G(*)) : A(F(**)) : (** AND (E(G(*)) OR (A(G(**)) OR **))) : E(F(**)) : A(F(**)) : (** AND (E(X(**)) OR (A(G(**)) OR (E(X(**)) OR E(G(**)))))) : E(F(**)) : (A((E(F(**)) U **)) OR (A(G(**)) AND (** OR (A(X(**)) OR **)))) : (A((* R *)) AND A((** U E(G(**))))) : A((** U A(X(**)))) : A(G(*)) : E(G((A(F(**)) OR ((E(X(**)) AND **) OR **)))) : A(F((** OR (A(G(**)) AND A(X(**)))))) : A(X(E(F(**)))) : A(F(**))"
},
"net":
{
"arcs": 80200,
"conflict_clusters": 1,
"places": 500,
"places_significant": 200,
"singleton_clusters": 0,
"transitions": 10200
},
"result":
{
"preliminary_value": "unknown no no yes yes no yes yes unknown yes no no no no unknown no ",
"value": "unknown no no yes yes no yes yes unknown yes no no no no unknown 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: 10700/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 500
lola: finding significant places
lola: 500 places, 10200 transitions, 200 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: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p193 <= 1)
lola: LP says that atomic proposition is always true: (p489 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p228 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p342 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p249 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p123 <= 1)
lola: LP says that atomic proposition is always true: (p324 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p187 <= 1)
lola: LP says that atomic proposition is always true: (p480 <= 1)
lola: LP says that atomic proposition is always true: (p133 <= 1)
lola: LP says that atomic proposition is always true: (p163 <= 1)
lola: LP says that atomic proposition is always true: (p399 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p369 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p255 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p161 <= 1)
lola: LP says that atomic proposition is always true: (p225 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p143 <= 1)
lola: LP says that atomic proposition is always true: (p339 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p240 <= 1)
lola: LP says that atomic proposition is always true: (p129 <= 1)
lola: LP says that atomic proposition is always true: (p147 <= 1)
lola: LP says that atomic proposition is always true: (p420 <= 1)
lola: LP says that atomic proposition is always true: (p133 <= 1)
lola: LP says that atomic proposition is always true: (p193 <= 1)
lola: LP says that atomic proposition is always true: (p399 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p177 <= 1)
lola: LP says that atomic proposition is always true: (p333 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p306 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p300 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p133 <= 1)
lola: LP says that atomic proposition is always true: (p240 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p191 <= 1)
lola: LP says that atomic proposition is always true: (p252 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p252 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p408 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p181 <= 1)
lola: LP says that atomic proposition is always true: (p339 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p129 <= 1)
lola: LP says that atomic proposition is always true: (p393 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p117 <= 1)
lola: LP says that atomic proposition is always true: (p219 <= 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: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p258 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p151 <= 1)
lola: LP says that atomic proposition is always true: (p426 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p339 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p127 <= 1)
lola: LP says that atomic proposition is always true: (p390 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p163 <= 1)
lola: LP says that atomic proposition is always true: (p444 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p216 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p185 <= 1)
lola: LP says that atomic proposition is always true: (p477 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p195 <= 1)
lola: LP says that atomic proposition is always true: (p252 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p195 <= 1)
lola: LP says that atomic proposition is always true: (p297 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p336 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p363 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p342 <= 1)
lola: LP says that atomic proposition is always true: (p184 <= 1)
lola: LP says that atomic proposition is always true: (p476 <= 1)
lola: LP says that atomic proposition is always true: (p159 <= 1)
lola: LP says that atomic proposition is always true: (p185 <= 1)
lola: LP says that atomic proposition is always true: (p438 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p119 <= 1)
lola: LP says that atomic proposition is always true: (p378 <= 1)
lola: LP says that atomic proposition is always true: (p159 <= 1)
lola: LP says that atomic proposition is always true: (p189 <= 1)
lola: LP says that atomic proposition is always true: (p483 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p197 <= 1)
lola: LP says that atomic proposition is always true: (p255 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p155 <= 1)
lola: LP says that atomic proposition is always true: (p432 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p151 <= 1)
lola: LP says that atomic proposition is always true: (p360 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p147 <= 1)
lola: LP says that atomic proposition is always true: (p420 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p321 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p187 <= 1)
lola: LP says that atomic proposition is always true: (p480 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p222 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p135 <= 1)
lola: LP says that atomic proposition is always true: (p171 <= 1)
lola: LP says that atomic proposition is always true: (p402 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p199 <= 1)
lola: LP says that atomic proposition is always true: (p498 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p339 <= 1)
lola: LP says that atomic proposition is always true: (p151 <= 1)
lola: LP says that atomic proposition is always true: (p197 <= 1)
lola: LP says that atomic proposition is always true: (p426 <= 1)
lola: LP says that atomic proposition is always true: (p147 <= 1)
lola: LP says that atomic proposition is always true: (p163 <= 1)
lola: LP says that atomic proposition is always true: (p420 <= 1)
lola: LP says that atomic proposition is always true: (p131 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p408 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p243 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p141 <= 1)
lola: LP says that atomic proposition is always true: (p336 <= 1)
lola: LP says that atomic proposition is always true: (p187 <= 1)
lola: LP says that atomic proposition is always true: (p481 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p173 <= 1)
lola: LP says that atomic proposition is always true: (p459 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p246 <= 1)
lola: LP says that atomic proposition is always true: (p145 <= 1)
lola: LP says that atomic proposition is always true: (p157 <= 1)
lola: LP says that atomic proposition is always true: (p417 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p153 <= 1)
lola: LP says that atomic proposition is always true: (p429 <= 1)
lola: A (G ((((p87 <= 0) OR (p193 <= 0) OR (p489 <= 0) OR (p19 <= 0) OR (p107 <= 0) OR (p228 <= 0)) OR E (F (((1 <= p67) AND (1 <= p95) AND (1 <= p342))))))) : NOT(E (F (((1 <= p33) AND (1 <= p91) AND (1 <= p249))))) : A (F (((1 <= p83) AND (1 <= p123) AND (1 <= p324)))) : (((p25 <= 0) OR (p187 <= 0) OR (p480 <= 0)) AND ((NOT(A (F (((1 <= p133) AND (1 <= p163) AND (1 <= p399))))) OR A (G ((((1 <= p69) AND (1 <= p113) AND (1 <= p369)) OR ((1 <= p3) AND (1 <= p37) AND (1 <= p255)))))) OR ((1 <= p17) AND (1 <= p161) AND (1 <= p225)))) : A (((A (X (((1 <= p93) AND (1 <= p143) AND (1 <= p339)))) AND (((1 <= p27) AND (1 <= p139) AND (1 <= p240)) OR ((1 <= p129) AND (1 <= p147) AND (1 <= p420)) OR ((1 <= p133) AND (1 <= p193) AND (1 <= p399)))) U E (F ((((1 <= p89) AND (1 <= p177) AND (1 <= p333)) OR ((1 <= p71) AND (1 <= p107) AND (1 <= p306))))))) : A (F (((1 <= p15) AND (1 <= p67) AND (1 <= p300)))) : (((p27 <= 0) OR (p133 <= 0) OR (p240 <= 0)) AND (((E (X (((1 <= p35) AND (1 <= p191) AND (1 <= p252)))) OR A (G (((1 <= p35) AND (1 <= p73) AND (1 <= p252))))) OR E (X (((1 <= p5) AND (1 <= p139) AND (1 <= p408) AND (1 <= p93) AND (1 <= p181) AND (1 <= p339))))) OR E (G ((((p115 <= 0) OR (p129 <= 0) OR (p393 <= 0)) AND ((p13 <= 0) OR (p117 <= 0) OR (p219 <= 0))))))) : NOT(E (G (NOT(E (F (((1 <= p9) AND (1 <= p35) AND (1 <= p213)))))))) : (A ((E (F (((1 <= p39) AND (1 <= p57) AND (1 <= p258)))) U ((1 <= p25) AND (1 <= p151) AND (1 <= p426)))) OR (A (G (((1 <= p79) AND (1 <= p93) AND (1 <= p339)))) AND ((((p51 <= 0) OR (p127 <= 0) OR (p390 <= 0)) OR A (X (((1 <= p41) AND (1 <= p163) AND (1 <= p444))))) OR ((1 <= p11) AND (1 <= p167) AND (1 <= p216) AND (((1 <= p73) AND (1 <= p185) AND (1 <= p477)) OR ((1 <= p35) AND (1 <= p195) AND (1 <= p252))))))) : (NOT(E (((((1 <= p65) AND (1 <= p195) AND (1 <= p297)) OR ((1 <= p5) AND (1 <= p91) AND (1 <= p336))) U ((1 <= p63) AND (1 <= p109) AND (1 <= p363))))) AND A ((((1 <= p1) AND (1 <= p95) AND (1 <= p342)) U E (G (((1 <= p184) AND (1 <= p476))))))) : A ((((p159 <= 0) OR (p185 <= 0) OR (p438 <= 0) OR (p1 <= 0) OR (p119 <= 0) OR (p378 <= 0) OR ((1 <= p159) AND (1 <= p189) AND (1 <= p483)) OR ((1 <= p37) AND (1 <= p197) AND (1 <= p255)) OR ((1 <= p99) AND (1 <= p155) AND (1 <= p432) AND (1 <= p107) AND (1 <= p151) AND (1 <= p360))) U A (X (((1 <= p75) AND (1 <= p147) AND (1 <= p420) AND (1 <= p65) AND (1 <= p81) AND (1 <= p321)))))) : A (G (NOT(A (F (((1 <= p51) AND (1 <= p187) AND (1 <= p480))))))) : E (G (((A (F (((1 <= p15) AND (1 <= p69) AND (1 <= p222)))) OR (E (X (((1 <= p7) AND (1 <= p125) AND (1 <= p210)))) AND ((p135 <= 0) OR (p171 <= 0) OR (p402 <= 0) OR ((1 <= p105) AND (1 <= p199) AND (1 <= p498)) OR ((1 <= p93) AND (1 <= p107) AND (1 <= p339))))) OR ((1 <= p151) AND (1 <= p197) AND (1 <= p426) AND (1 <= p147) AND (1 <= p163) AND (1 <= p420) AND ((p131 <= 0) OR (p139 <= 0) OR (p408 <= 0)))))) : A (F ((((1 <= p29) AND (1 <= p113) AND (1 <= p243)) OR (A (G (((1 <= p91) AND (1 <= p141) AND (1 <= p336)))) AND A (X (((1 <= p187) AND (1 <= p481)))))))) : A (X (E (F (((1 <= p55) AND (1 <= p173) AND (1 <= p459) AND (1 <= p31) AND (1 <= p41) AND (1 <= p246) AND ((p145 <= 0) OR (p157 <= 0) OR (p417 <= 0))))))) : A (F (((1 <= p47) AND (1 <= p153) AND (1 <= p429))))
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:452
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:476
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:458
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 218 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p27 <= 0) OR (p133 <= 0) OR (p240 <= 0)) AND (E (X (((1 <= p35) AND (1 <= p191) AND (1 <= p252)))) OR (A (G (((1 <= p35) AND (1 <= p73) AND (1 <= p252)))) OR (E (X (((1 <= p5) AND (1 <= p139) AND (1 <= p408) AND (1 <= p93) AND (1 <= p181) AND (1 <= p339)))) OR E (G ((((p115 <= 0) OR (p129 <= 0) OR (p393 <= 0)) AND ((p13 <= 0) OR (p117 <= 0) OR (p219 <= 0)))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 218 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((1 <= p35) AND (1 <= p191) AND (1 <= p252))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(((1 <= p35) AND (1 <= p191) AND (1 <= p252)))
lola: processed formula length: 48
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 233 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p27 <= 0) OR (p133 <= 0) OR (p240 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p27 <= 0) OR (p133 <= 0) OR (p240 <= 0))
lola: processed formula length: 44
lola: 28 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 250 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p115 <= 0) OR (p129 <= 0) OR (p393 <= 0)) AND ((p13 <= 0) OR (p117 <= 0) OR (p219 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p115 <= 0) OR (p129 <= 0) OR (p393 <= 0)) AND ((p13 <= 0) OR (p117 <= 0) OR (p219 <= 0)))))
lola: processed formula length: 104
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: (((1 <= p115) AND (1 <= p129) AND (1 <= p393)) OR ((1 <= p13) AND (1 <= p117) AND (1 <= p219)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 3 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 233 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((E (F (((1 <= p39) AND (1 <= p57) AND (1 <= p258)))) U ((1 <= p25) AND (1 <= p151) AND (1 <= p426)))) OR (A (G (((1 <= p79) AND (1 <= p93) AND (1 <= p339)))) AND (((p51 <= 0) OR (p127 <= 0) OR (p390 <= 0)) OR (A (X (((1 <= p41) AND (1 <= p163) AND (1 <= p444)))) OR ((1 <= p11) AND (1 <= p167) AND (1 <= p216) AND (((1 <= p73) AND (1 <= p185) AND (1 <= p477)) OR ((1 <= p35) AND (1 <= p195) AN... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: (A(EF(((1 <= p39) AND (1 <= p57) AND (1 <= p258))) U ((1 <= p25) AND (1 <= p151) AND (1 <= p426))) OR (AG(((1 <= p79) AND (1 <= p93) AND (1 <= p339))) AND (((p51 <= 0) OR (p127 <= 0) OR (p390 <= 0)) OR (AX(((1 <= p41) AND (1 <= p163) AND (1 <= p444))) OR ((1 <= p11) AND (1 <= p167) AND (1 <= p216) AND (((1 <= p73) AND (1 <= p185) AND (1 <= p477)) OR ((1 <= p35) AND (1 <= p195) AND (1 <= p252)))... (shortened)
lola: processed formula length: 405
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 349189 markings, 1418442 edges, 69838 markings/sec, 0 secs
lola: 687952 markings, 2904035 edges, 67753 markings/sec, 5 secs
lola: 1021791 markings, 4410360 edges, 66768 markings/sec, 10 secs
lola: 1316116 markings, 5772907 edges, 58865 markings/sec, 15 secs
lola: 1608869 markings, 7224396 edges, 58551 markings/sec, 20 secs
lola: 1915785 markings, 8639514 edges, 61383 markings/sec, 25 secs
lola: 2244130 markings, 9951191 edges, 65669 markings/sec, 30 secs
lola: 2555789 markings, 11346495 edges, 62332 markings/sec, 35 secs
lola: 2848934 markings, 12773828 edges, 58629 markings/sec, 40 secs
lola: 3146046 markings, 14110647 edges, 59422 markings/sec, 45 secs
lola: 3461388 markings, 15533355 edges, 63068 markings/sec, 50 secs
lola: 3777651 markings, 16930968 edges, 63253 markings/sec, 55 secs
lola: 4122887 markings, 18346076 edges, 69047 markings/sec, 60 secs
lola: 4444155 markings, 19864339 edges, 64254 markings/sec, 65 secs
lola: 4751186 markings, 21430396 edges, 61406 markings/sec, 70 secs
lola: 5066921 markings, 22946654 edges, 63147 markings/sec, 75 secs
lola: 5399019 markings, 24387740 edges, 66420 markings/sec, 80 secs
lola: 5703992 markings, 25907404 edges, 60995 markings/sec, 85 secs
lola: 5994427 markings, 27488495 edges, 58087 markings/sec, 90 secs
lola: 6299623 markings, 29028857 edges, 61039 markings/sec, 95 secs
lola: 6584098 markings, 30669499 edges, 56895 markings/sec, 100 secs
lola: 6866877 markings, 32307680 edges, 56556 markings/sec, 105 secs
lola: 7153374 markings, 33920742 edges, 57299 markings/sec, 110 secs
lola: 7466123 markings, 35448628 edges, 62550 markings/sec, 115 secs
lola: 7760017 markings, 37042571 edges, 58779 markings/sec, 120 secs
lola: 8047187 markings, 38668867 edges, 57434 markings/sec, 125 secs
lola: 8338837 markings, 40281214 edges, 58330 markings/sec, 130 secs
lola: 8662879 markings, 41828355 edges, 64808 markings/sec, 135 secs
lola: 8982337 markings, 43391384 edges, 63892 markings/sec, 140 secs
lola: 9308691 markings, 44909975 edges, 65271 markings/sec, 145 secs
lola: 9647276 markings, 46363510 edges, 67717 markings/sec, 150 secs
lola: 9958413 markings, 47896324 edges, 62227 markings/sec, 155 secs
lola: 10232869 markings, 49358721 edges, 54891 markings/sec, 160 secs
lola: 10538439 markings, 50837665 edges, 61114 markings/sec, 165 secs
lola: 10826063 markings, 52487851 edges, 57525 markings/sec, 170 secs
lola: 11122061 markings, 54103214 edges, 59200 markings/sec, 175 secs
lola: 11421797 markings, 55700477 edges, 59947 markings/sec, 180 secs
lola: 11744319 markings, 57230472 edges, 64504 markings/sec, 185 secs
lola: 12047266 markings, 58826214 edges, 60589 markings/sec, 190 secs
lola: 12336567 markings, 60473706 edges, 57860 markings/sec, 195 secs
lola: 12657039 markings, 62008158 edges, 64094 markings/sec, 200 secs
lola: 12973085 markings, 63525067 edges, 63209 markings/sec, 205 secs
lola: 13279322 markings, 65075580 edges, 61247 markings/sec, 210 secs
lola: 13586835 markings, 66618302 edges, 61503 markings/sec, 215 secs
lola: 13890471 markings, 68124645 edges, 60727 markings/sec, 220 secs
lola: 14183639 markings, 69660529 edges, 58634 markings/sec, 225 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 233 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p159 <= 0) OR (p185 <= 0) OR (p438 <= 0) OR (p1 <= 0) OR (p119 <= 0) OR (p378 <= 0) OR ((1 <= p159) AND (1 <= p189) AND (1 <= p483)) OR ((1 <= p37) AND (1 <= p197) AND (1 <= p255)) OR ((1 <= p99) AND (1 <= p155) AND (1 <= p432) AND (1 <= p107) AND (1 <= p151) AND (1 <= p360))) U A (X (((1 <= p75) AND (1 <= p147) AND (1 <= p420) AND (1 <= p65) AND (1 <= p81) AND (1 <= p321))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(((p159 <= 0) OR (p185 <= 0) OR (p438 <= 0) OR (p1 <= 0) OR (p119 <= 0) OR (p378 <= 0) OR ((1 <= p159) AND (1 <= p189) AND (1 <= p483)) OR ((1 <= p37) AND (1 <= p197) AND (1 <= p255)) OR ((1 <= p99) AND (1 <= p155) AND (1 <= p432) AND (1 <= p107) AND (1 <= p151) AND (1 <= p360))) U AX(((1 <= p75) AND (1 <= p147) AND (1 <= p420) AND (1 <= p65) AND (1 <= p81) AND (1 <= p321))))
lola: processed formula length: 387
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: 3 markings, 3 edges
lola: ========================================
lola: subprocess 3 will run for 251 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((A (F (((1 <= p15) AND (1 <= p69) AND (1 <= p222)))) OR ((E (X (((1 <= p7) AND (1 <= p125) AND (1 <= p210)))) AND ((p135 <= 0) OR (p171 <= 0) OR (p402 <= 0) OR ((1 <= p105) AND (1 <= p199) AND (1 <= p498)) OR ((1 <= p93) AND (1 <= p107) AND (1 <= p339)))) OR ((1 <= p151) AND (1 <= p197) AND (1 <= p426) AND (1 <= p147) AND (1 <= p163) AND (1 <= p420) AND ((p131 <= 0) OR (p139 <= 0) OR (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((AF(((1 <= p15) AND (1 <= p69) AND (1 <= p222))) OR ((EX(((1 <= p7) AND (1 <= p125) AND (1 <= p210))) AND ((p135 <= 0) OR (p171 <= 0) OR (p402 <= 0) OR ((1 <= p105) AND (1 <= p199) AND (1 <= p498)) OR ((1 <= p93) AND (1 <= p107) AND (1 <= p339)))) OR ((1 <= p151) AND (1 <= p197) AND (1 <= p426) AND (1 <= p147) AND (1 <= p163) AND (1 <= p420) AND ((p131 <= 0) OR (p139 <= 0) OR (p408 <= 0))... (shortened)
lola: processed formula length: 404
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: 3 markings, 4 edges
lola: ========================================
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p29) AND (1 <= p113) AND (1 <= p243)) OR (A (G (((1 <= p91) AND (1 <= p141) AND (1 <= p336)))) AND A (X (((1 <= p187) AND (1 <= p481))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((((1 <= p29) AND (1 <= p113) AND (1 <= p243)) OR (AG(((1 <= p91) AND (1 <= p141) AND (1 <= p336))) AND AX(((1 <= p187) AND (1 <= p481))))))
lola: processed formula length: 142
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: 3 markings, 6 edges
lola: ========================================
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F (((1 <= p55) AND (1 <= p173) AND (1 <= p459) AND (1 <= p31) AND (1 <= p41) AND (1 <= p246) AND ((p145 <= 0) OR (p157 <= 0) OR (p417 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF(((1 <= p55) AND (1 <= p173) AND (1 <= p459) AND (1 <= p31) AND (1 <= p41) AND (1 <= p246) AND ((p145 <= 0) OR (p157 <= 0) OR (p417 <= 0)))))
lola: processed formula length: 148
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: 332285 markings, 1336134 edges, 66457 markings/sec, 0 secs
lola: 670954 markings, 2818710 edges, 67734 markings/sec, 5 secs
lola: 1000948 markings, 4328189 edges, 65999 markings/sec, 10 secs
lola: 1326121 markings, 5824876 edges, 65035 markings/sec, 15 secs
lola: 1639203 markings, 7362101 edges, 62616 markings/sec, 20 secs
lola: 1945349 markings, 8768533 edges, 61229 markings/sec, 25 secs
lola: 2296371 markings, 10173663 edges, 70204 markings/sec, 30 secs
lola: 2622538 markings, 11652214 edges, 65233 markings/sec, 35 secs
lola: 2933113 markings, 13170689 edges, 62115 markings/sec, 40 secs
lola: 3265772 markings, 14614776 edges, 66532 markings/sec, 45 secs
lola: 3583912 markings, 16107294 edges, 63628 markings/sec, 50 secs
lola: 3917470 markings, 17557338 edges, 66712 markings/sec, 55 secs
lola: 4265686 markings, 18965105 edges, 69643 markings/sec, 60 secs
lola: 4568051 markings, 20536741 edges, 60473 markings/sec, 65 secs
lola: 4854759 markings, 21930351 edges, 57342 markings/sec, 70 secs
lola: 5153816 markings, 23300489 edges, 59811 markings/sec, 75 secs
lola: 5477599 markings, 24759343 edges, 64757 markings/sec, 80 secs
lola: 5777714 markings, 26293152 edges, 60023 markings/sec, 85 secs
lola: 6052070 markings, 27792178 edges, 54871 markings/sec, 90 secs
lola: 6337845 markings, 29223470 edges, 57155 markings/sec, 95 secs
lola: 6601528 markings, 30776391 edges, 52737 markings/sec, 100 secs
lola: 6869416 markings, 32322872 edges, 53578 markings/sec, 105 secs
lola: 7143096 markings, 33862533 edges, 54736 markings/sec, 110 secs
lola: 7454358 markings, 35383993 edges, 62252 markings/sec, 115 secs
lola: 7746206 markings, 36973624 edges, 58370 markings/sec, 120 secs
lola: 8034112 markings, 38587955 edges, 57581 markings/sec, 125 secs
lola: 8323794 markings, 40199243 edges, 57936 markings/sec, 130 secs
lola: 8646918 markings, 41737192 edges, 64625 markings/sec, 135 secs
lola: 8961839 markings, 43297516 edges, 62984 markings/sec, 140 secs
lola: 9284229 markings, 44808733 edges, 64478 markings/sec, 145 secs
lola: 9622638 markings, 46242413 edges, 67682 markings/sec, 150 secs
lola: 9932146 markings, 47760307 edges, 61902 markings/sec, 155 secs
lola: 10228209 markings, 49333324 edges, 59213 markings/sec, 160 secs
lola: 10543154 markings, 50862076 edges, 62989 markings/sec, 165 secs
lola: 10828884 markings, 52505591 edges, 57146 markings/sec, 170 secs
lola: 11120836 markings, 54096505 edges, 58390 markings/sec, 175 secs
lola: 11412191 markings, 55656989 edges, 58271 markings/sec, 180 secs
lola: 11704446 markings, 57028270 edges, 58451 markings/sec, 185 secs
lola: 11987672 markings, 58516096 edges, 56645 markings/sec, 190 secs
lola: 12277463 markings, 60142594 edges, 57958 markings/sec, 195 secs
lola: 12582143 markings, 61697867 edges, 60936 markings/sec, 200 secs
lola: 12882607 markings, 63071164 edges, 60093 markings/sec, 205 secs
lola: 13175425 markings, 64505920 edges, 58564 markings/sec, 210 secs
lola: 13470424 markings, 66080278 edges, 59000 markings/sec, 215 secs
lola: 13782688 markings, 67573346 edges, 62453 markings/sec, 220 secs
lola: 14056525 markings, 69028327 edges, 54767 markings/sec, 225 secs
lola: 14340016 markings, 70424415 edges, 56698 markings/sec, 230 secs
lola: 14613237 markings, 71698223 edges, 54644 markings/sec, 235 secs
lola: 14897986 markings, 73056058 edges, 56950 markings/sec, 240 secs
lola: 15155842 markings, 74430002 edges, 51571 markings/sec, 245 secs
lola: 15377138 markings, 75670698 edges, 44259 markings/sec, 250 secs
lola: 15596885 markings, 76889918 edges, 43949 markings/sec, 255 secs
lola: 15867376 markings, 78233686 edges, 54098 markings/sec, 260 secs
lola: 16122095 markings, 79645319 edges, 50944 markings/sec, 265 secs
lola: 16360881 markings, 80864185 edges, 47757 markings/sec, 270 secs
lola: 16628255 markings, 82234217 edges, 53475 markings/sec, 275 secs
lola: 16894327 markings, 83496736 edges, 53214 markings/sec, 280 secs
lola: 17098148 markings, 84653803 edges, 40764 markings/sec, 285 secs
lola: 17294066 markings, 85768030 edges, 39184 markings/sec, 290 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown yes unknown unknown unknown no unknown no no unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p33 <= 0) OR (p91 <= 0) OR (p249 <= 0))))
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 (((p33 <= 0) OR (p91 <= 0) OR (p249 <= 0))))
lola: processed formula length: 51
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: formula 0: ((1 <= p33) AND (1 <= p91) AND (1 <= p249))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 7 will run for 330 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p9) AND (1 <= p35) AND (1 <= p213))))
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 <= p9) AND (1 <= p35) AND (1 <= p213))))
lola: processed formula length: 50
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 <= p9) AND (1 <= p35) AND (1 <= p213))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 8 will run for 371 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p51 <= 0) OR (p187 <= 0) OR (p480 <= 0))))
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 (((p51 <= 0) OR (p187 <= 0) OR (p480 <= 0))))
lola: processed formula length: 52
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: formula 0: ((1 <= p51) AND (1 <= p187) AND (1 <= p480))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 9 will run for 424 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p89) AND (1 <= p177) AND (1 <= p333)) OR ((1 <= p71) AND (1 <= p107) AND (1 <= p306)))))
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 <= p89) AND (1 <= p177) AND (1 <= p333)) OR ((1 <= p71) AND (1 <= p107) AND (1 <= p306)))))
lola: processed formula length: 103
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 <= p89) AND (1 <= p177) AND (1 <= p333)) OR ((1 <= p71) AND (1 <= p107) AND (1 <= p306)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 10 will run for 495 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p83) AND (1 <= p123) AND (1 <= p324))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p83 <= 0) OR (p123 <= 0) OR (p324 <= 0))
lola: processed formula length: 44
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: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p83) AND (1 <= p123) AND (1 <= p324))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 3 markings, 3 edges
lola: ========================================
lola: subprocess 11 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p15) AND (1 <= p67) AND (1 <= p300))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p15 <= 0) OR (p67 <= 0) OR (p300 <= 0))
lola: processed formula length: 43
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: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p15) AND (1 <= p67) AND (1 <= p300))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 3 markings, 3 edges
lola: ========================================
lola: subprocess 12 will run for 742 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p47) AND (1 <= p153) AND (1 <= p429))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p47 <= 0) OR (p153 <= 0) OR (p429 <= 0))
lola: processed formula length: 44
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: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p47) AND (1 <= p153) AND (1 <= p429))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 3 markings, 3 edges
lola: ========================================
lola: subprocess 13 will run for 990 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p87 <= 0) OR (p193 <= 0) OR (p489 <= 0) OR (p19 <= 0) OR (p107 <= 0) OR (p228 <= 0)) OR E (F (((1 <= p67) AND (1 <= p95) AND (1 <= p342)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((((p87 <= 0) OR (p193 <= 0) OR (p489 <= 0) OR (p19 <= 0) OR (p107 <= 0) OR (p228 <= 0)) OR EF(((1 <= p67) AND (1 <= p95) AND (1 <= p342)))))
lola: processed formula length: 148
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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 205514 markings, 788211 edges, 41103 markings/sec, 0 secs
lola: 441022 markings, 1811404 edges, 47102 markings/sec, 5 secs
lola: 727138 markings, 3098914 edges, 57223 markings/sec, 10 secs
lola: 1002332 markings, 4333941 edges, 55039 markings/sec, 15 secs
lola: 1277127 markings, 5566048 edges, 54959 markings/sec, 20 secs
lola: 1538283 markings, 6895500 edges, 52231 markings/sec, 25 secs
lola: 1848814 markings, 8353315 edges, 62106 markings/sec, 30 secs
lola: 2187573 markings, 9714235 edges, 67752 markings/sec, 35 secs
lola: 2503189 markings, 11118904 edges, 63123 markings/sec, 40 secs
lola: 2807401 markings, 12562107 edges, 60842 markings/sec, 45 secs
lola: 3117017 markings, 13988495 edges, 61923 markings/sec, 50 secs
lola: 3435211 markings, 15402448 edges, 63639 markings/sec, 55 secs
lola: 3751663 markings, 16810644 edges, 63290 markings/sec, 60 secs
lola: 4078226 markings, 18183817 edges, 65313 markings/sec, 65 secs
lola: 4397131 markings, 19613615 edges, 63781 markings/sec, 70 secs
lola: 4688282 markings, 21139858 edges, 58230 markings/sec, 75 secs
lola: 4954592 markings, 22427146 edges, 53262 markings/sec, 80 secs
lola: 5245833 markings, 23695251 edges, 58248 markings/sec, 85 secs
lola: 5537250 markings, 25075080 edges, 58283 markings/sec, 90 secs
lola: 5810259 markings, 26455504 edges, 54602 markings/sec, 95 secs
lola: 6059525 markings, 27826708 edges, 49853 markings/sec, 100 secs
lola: 6328151 markings, 29172476 edges, 53725 markings/sec, 105 secs
lola: 6588333 markings, 30693647 edges, 52036 markings/sec, 110 secs
lola: 6828519 markings, 32109631 edges, 48037 markings/sec, 115 secs
lola: 7074427 markings, 33498364 edges, 49182 markings/sec, 120 secs
lola: 7354183 markings, 34906708 edges, 55951 markings/sec, 125 secs
lola: 7617917 markings, 36263436 edges, 52747 markings/sec, 130 secs
lola: 7887102 markings, 37727063 edges, 53837 markings/sec, 135 secs
lola: 8143241 markings, 39237473 edges, 51228 markings/sec, 140 secs
lola: 8420639 markings, 40650842 edges, 55480 markings/sec, 145 secs
lola: 8696323 markings, 42001565 edges, 55137 markings/sec, 150 secs
lola: 8984998 markings, 43405230 edges, 57735 markings/sec, 155 secs
lola: 9296645 markings, 44857124 edges, 62329 markings/sec, 160 secs
lola: 9605340 markings, 46167077 edges, 61739 markings/sec, 165 secs
lola: 9883635 markings, 47524503 edges, 55659 markings/sec, 170 secs
lola: 10171085 markings, 49033181 edges, 57490 markings/sec, 175 secs
lola: 10472517 markings, 50505283 edges, 60286 markings/sec, 180 secs
lola: 10756057 markings, 52063566 edges, 56708 markings/sec, 185 secs
lola: 11033693 markings, 53637895 edges, 55527 markings/sec, 190 secs
lola: 11317895 markings, 55176630 edges, 56840 markings/sec, 195 secs
lola: 11626722 markings, 56636880 edges, 61765 markings/sec, 200 secs
lola: 11913153 markings, 58142606 edges, 57286 markings/sec, 205 secs
lola: 12199327 markings, 59684331 edges, 57235 markings/sec, 210 secs
lola: 12482653 markings, 61236576 edges, 56665 markings/sec, 215 secs
lola: 12796833 markings, 62639074 edges, 62836 markings/sec, 220 secs
lola: 13096835 markings, 64107770 edges, 60000 markings/sec, 225 secs
lola: 13380570 markings, 65623608 edges, 56747 markings/sec, 230 secs
lola: 13653960 markings, 66941607 edges, 54678 markings/sec, 235 secs
lola: 13922809 markings, 68307658 edges, 53770 markings/sec, 240 secs
lola: 14165928 markings, 69574482 edges, 48624 markings/sec, 245 secs
lola: 14457482 markings, 71001116 edges, 58311 markings/sec, 250 secs
lola: 14741231 markings, 72278317 edges, 56750 markings/sec, 255 secs
lola: 15009021 markings, 73653453 edges, 53558 markings/sec, 260 secs
lola: 15270761 markings, 75049065 edges, 52348 markings/sec, 265 secs
lola: 15466481 markings, 76188438 edges, 39144 markings/sec, 270 secs
lola: 15706437 markings, 77442767 edges, 47991 markings/sec, 275 secs
lola: 15964890 markings, 78748203 edges, 51691 markings/sec, 280 secs
lola: 16180906 markings, 79954650 edges, 43203 markings/sec, 285 secs
lola: 16447174 markings, 81323303 edges, 53254 markings/sec, 290 secs
lola: 16689856 markings, 82505410 edges, 48536 markings/sec, 295 secs
lola: 16916195 markings, 83618415 edges, 45268 markings/sec, 300 secs
lola: 17163558 markings, 85043771 edges, 49473 markings/sec, 305 secs
lola: 17394758 markings, 86365916 edges, 46240 markings/sec, 310 secs
lola: 17628613 markings, 87807227 edges, 46771 markings/sec, 315 secs
lola: 17881258 markings, 89211610 edges, 50529 markings/sec, 320 secs
lola: 18102603 markings, 90553197 edges, 44269 markings/sec, 325 secs
lola: 18279965 markings, 91670188 edges, 35472 markings/sec, 330 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1315 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((((p65 <= 0) OR (p195 <= 0) OR (p297 <= 0)) AND ((p5 <= 0) OR (p91 <= 0) OR (p336 <= 0))) R ((p63 <= 0) OR (p109 <= 0) OR (p363 <= 0)))) AND A ((((1 <= p1) AND (1 <= p95) AND (1 <= p342)) U E (G (((1 <= p184) AND (1 <= p476)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:815
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: (A((((p65 <= 0) OR (p195 <= 0) OR (p297 <= 0)) AND ((p5 <= 0) OR (p91 <= 0) OR (p336 <= 0))) R ((p63 <= 0) OR (p109 <= 0) OR (p363 <= 0))) AND A(((1 <= p1) AND (1 <= p95) AND (1 <= p342)) U EG(((1 <= p184) AND (1 <= p476)))))
lola: processed formula length: 231
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 3 significant temporal operators and needs 13 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: 3 markings, 5 edges
lola: ========================================
lola: subprocess 15 will run for 2630 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p25 <= 0) OR (p187 <= 0) OR (p480 <= 0)) AND (E (G (((p133 <= 0) OR (p163 <= 0) OR (p399 <= 0)))) OR (A (G ((((1 <= p69) AND (1 <= p113) AND (1 <= p369)) OR ((1 <= p3) AND (1 <= p37) AND (1 <= p255))))) OR ((1 <= p17) AND (1 <= p161) AND (1 <= p225)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2630 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p25 <= 0) OR (p187 <= 0) OR (p480 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p25 <= 0) OR (p187 <= 0) OR (p480 <= 0))
lola: processed formula length: 44
lola: 28 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p17) AND (1 <= p161) AND (1 <= p225))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p17) AND (1 <= p161) AND (1 <= p225))
lola: processed formula length: 44
lola: 28 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 18 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p69) AND (1 <= p113) AND (1 <= p369)) OR ((1 <= p3) AND (1 <= p37) AND (1 <= p255)))))
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:787
lola: processed formula: A (G ((((1 <= p69) AND (1 <= p113) AND (1 <= p369)) OR ((1 <= p3) AND (1 <= p37) AND (1 <= p255)))))
lola: processed formula length: 101
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:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p69 <= 0) OR (p113 <= 0) OR (p369 <= 0)) AND ((p3 <= 0) OR (p37 <= 0) OR (p255 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 18 literals and 9 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A ((E (F (((1 <= p39) AND (1 <= p57) AND (1 <= p258)))) U ((1 <= p25) AND (1 <= p151) AND (1 <= p426)))) OR (A (G (((1 <= p79) AND (1 <= p93) AND (1 <= p339)))) AND (((p51 <= 0) OR (p127 <= 0) OR (p390 <= 0)) OR (A (X (((1 <= p41) AND (1 <= p163) AND (1 <= p444)))) OR ((1 <= p11) AND (1 <= p167) AND (1 <= p216) AND (((1 <= p73) AND (1 <= p185) AND (1 <= p477)) OR ((1 <= p35) AND (1 <= p195) AN... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: (A(EF(((1 <= p39) AND (1 <= p57) AND (1 <= p258))) U ((1 <= p25) AND (1 <= p151) AND (1 <= p426))) OR (AG(((1 <= p79) AND (1 <= p93) AND (1 <= p339))) AND (((p51 <= 0) OR (p127 <= 0) OR (p390 <= 0)) OR (AX(((1 <= p41) AND (1 <= p163) AND (1 <= p444))) OR ((1 <= p11) AND (1 <= p167) AND (1 <= p216) AND (((1 <= p73) AND (1 <= p185) AND (1 <= p477)) OR ((1 <= p35) AND (1 <= p195) AND (1 <= p252)))... (shortened)
lola: processed formula length: 405
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 196467 markings, 751936 edges, 39293 markings/sec, 0 secs
lola: 408243 markings, 1671117 edges, 42355 markings/sec, 5 secs
lola: 732454 markings, 3126129 edges, 64842 markings/sec, 10 secs
lola: 1060577 markings, 4581040 edges, 65625 markings/sec, 15 secs
lola: 1353626 markings, 5965235 edges, 58610 markings/sec, 20 secs
lola: 1640773 markings, 7369156 edges, 57429 markings/sec, 25 secs
lola: 1956041 markings, 8815064 edges, 63054 markings/sec, 30 secs
lola: 2260802 markings, 10024309 edges, 60952 markings/sec, 35 secs
lola: 2560328 markings, 11363621 edges, 59905 markings/sec, 40 secs
lola: 2861205 markings, 12836601 edges, 60175 markings/sec, 45 secs
lola: 3162084 markings, 14171681 edges, 60176 markings/sec, 50 secs
lola: 3455818 markings, 15507078 edges, 58747 markings/sec, 55 secs
lola: 3755052 markings, 16826381 edges, 59847 markings/sec, 60 secs
lola: 4051574 markings, 18089251 edges, 59304 markings/sec, 65 secs
lola: 4356977 markings, 19414263 edges, 61081 markings/sec, 70 secs
lola: 4650966 markings, 20952246 edges, 58798 markings/sec, 75 secs
lola: 4956891 markings, 22438207 edges, 61185 markings/sec, 80 secs
lola: 5280872 markings, 23840267 edges, 64796 markings/sec, 85 secs
lola: 5577952 markings, 25289146 edges, 59416 markings/sec, 90 secs
lola: 5868922 markings, 26771523 edges, 58194 markings/sec, 95 secs
lola: 6149267 markings, 28286852 edges, 56069 markings/sec, 100 secs
lola: 6438845 markings, 29800678 edges, 57916 markings/sec, 105 secs
lola: 6702813 markings, 31402114 edges, 52794 markings/sec, 110 secs
lola: 6979293 markings, 32953665 edges, 55296 markings/sec, 115 secs
lola: 7264311 markings, 34472951 edges, 57004 markings/sec, 120 secs
lola: 7562443 markings, 35947820 edges, 59626 markings/sec, 125 secs
lola: 7844817 markings, 37484168 edges, 56475 markings/sec, 130 secs
lola: 8114259 markings, 39071506 edges, 53888 markings/sec, 135 secs
lola: 8406653 markings, 40593315 edges, 58479 markings/sec, 140 secs
lola: 8714931 markings, 42100259 edges, 61656 markings/sec, 145 secs
lola: 9025217 markings, 43592474 edges, 62057 markings/sec, 150 secs
lola: 9343857 markings, 45047369 edges, 63728 markings/sec, 155 secs
lola: 9667339 markings, 46454794 edges, 64696 markings/sec, 160 secs
lola: 9967629 markings, 47947552 edges, 60058 markings/sec, 165 secs
lola: 10257024 markings, 49475081 edges, 57879 markings/sec, 170 secs
lola: 10561975 markings, 50965243 edges, 60990 markings/sec, 175 secs
lola: 10838670 markings, 52562790 edges, 55339 markings/sec, 180 secs
lola: 11125548 markings, 54122139 edges, 57376 markings/sec, 185 secs
lola: 11395584 markings, 55571326 edges, 54007 markings/sec, 190 secs
lola: 11680055 markings, 56910178 edges, 56894 markings/sec, 195 secs
lola: 11954400 markings, 58354146 edges, 54869 markings/sec, 200 secs
lola: 12235816 markings, 59894117 edges, 56283 markings/sec, 205 secs
lola: 12524855 markings, 61445088 edges, 57808 markings/sec, 210 secs
lola: 12846975 markings, 62881998 edges, 64424 markings/sec, 215 secs
lola: 13149369 markings, 64381963 edges, 60479 markings/sec, 220 secs
lola: 13439668 markings, 65918324 edges, 58060 markings/sec, 225 secs
lola: 13746017 markings, 67382704 edges, 61270 markings/sec, 230 secs
lola: 14027769 markings, 68878023 edges, 56350 markings/sec, 235 secs
lola: 14323491 markings, 70346444 edges, 59144 markings/sec, 240 secs
lola: 14631467 markings, 71780589 edges, 61595 markings/sec, 245 secs
lola: 14914707 markings, 73137953 edges, 56648 markings/sec, 250 secs
lola: 15181391 markings, 74560627 edges, 53337 markings/sec, 255 secs
lola: 15386569 markings, 75726363 edges, 41036 markings/sec, 260 secs
lola: 15575371 markings, 76782580 edges, 37760 markings/sec, 265 secs
lola: 15806311 markings, 77921630 edges, 46188 markings/sec, 270 secs
lola: 16030093 markings, 79124018 edges, 44756 markings/sec, 275 secs
lola: 16255637 markings, 80345405 edges, 45109 markings/sec, 280 secs
lola: 16505348 markings, 81634593 edges, 49942 markings/sec, 285 secs
lola: 16756119 markings, 82798592 edges, 50154 markings/sec, 290 secs
lola: 16993401 markings, 84043599 edges, 47456 markings/sec, 295 secs
lola: 17188577 markings, 85189350 edges, 39035 markings/sec, 300 secs
lola: 17416607 markings, 86498690 edges, 45606 markings/sec, 305 secs
lola: 17610753 markings, 87705945 edges, 38829 markings/sec, 310 secs
lola: 17830790 markings, 88932953 edges, 44007 markings/sec, 315 secs
lola: 18045524 markings, 90188240 edges, 42947 markings/sec, 320 secs
lola: 18246404 markings, 91475772 edges, 40176 markings/sec, 325 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (X (E (F (((1 <= p55) AND (1 <= p173) AND (1 <= p459) AND (1 <= p31) AND (1 <= p41) AND (1 <= p246) AND ((p145 <= 0) OR (p157 <= 0) OR (p417 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF(((1 <= p55) AND (1 <= p173) AND (1 <= p459) AND (1 <= p31) AND (1 <= p41) AND (1 <= p246) AND ((p145 <= 0) OR (p157 <= 0) OR (p417 <= 0)))))
lola: processed formula length: 148
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: 189062 markings, 725216 edges, 37812 markings/sec, 0 secs
lola: 410023 markings, 1678981 edges, 44192 markings/sec, 5 secs
lola: 678829 markings, 2859147 edges, 53761 markings/sec, 10 secs
lola: 955054 markings, 4132736 edges, 55245 markings/sec, 15 secs
lola: 1235395 markings, 5371366 edges, 56068 markings/sec, 20 secs
lola: 1493819 markings, 6684072 edges, 51685 markings/sec, 25 secs
lola: 1768091 markings, 7969303 edges, 54854 markings/sec, 30 secs
lola: 2053812 markings, 9195236 edges, 57144 markings/sec, 35 secs
lola: 2349100 markings, 10408741 edges, 59058 markings/sec, 40 secs
lola: 2623578 markings, 11657302 edges, 54896 markings/sec, 45 secs
lola: 2899753 markings, 13014457 edges, 55235 markings/sec, 50 secs
lola: 3179594 markings, 14244624 edges, 55968 markings/sec, 55 secs
lola: 3459563 markings, 15525680 edges, 55994 markings/sec, 60 secs
lola: 3758659 markings, 16841432 edges, 59819 markings/sec, 65 secs
lola: 4085835 markings, 18212604 edges, 65435 markings/sec, 70 secs
lola: 4402249 markings, 19641804 edges, 63283 markings/sec, 75 secs
lola: 4692955 markings, 21161411 edges, 58141 markings/sec, 80 secs
lola: 4997976 markings, 22633467 edges, 61004 markings/sec, 85 secs
lola: 5320462 markings, 24017708 edges, 64497 markings/sec, 90 secs
lola: 5615024 markings, 25477228 edges, 58912 markings/sec, 95 secs
lola: 5904008 markings, 26976353 edges, 57797 markings/sec, 100 secs
lola: 6190831 markings, 28482598 edges, 57365 markings/sec, 105 secs
lola: 6479090 markings, 30027569 edges, 57652 markings/sec, 110 secs
lola: 6742299 markings, 31625148 edges, 52642 markings/sec, 115 secs
lola: 7017887 markings, 33178022 edges, 55118 markings/sec, 120 secs
lola: 7298108 markings, 34641882 edges, 56044 markings/sec, 125 secs
lola: 7569972 markings, 35985589 edges, 54373 markings/sec, 130 secs
lola: 7824376 markings, 37375702 edges, 50881 markings/sec, 135 secs
lola: 8078251 markings, 38864584 edges, 50775 markings/sec, 140 secs
lola: 8362562 markings, 40392842 edges, 56862 markings/sec, 145 secs
lola: 8673889 markings, 41884559 edges, 62265 markings/sec, 150 secs
lola: 8980551 markings, 43382281 edges, 61332 markings/sec, 155 secs
lola: 9293826 markings, 44845158 edges, 62655 markings/sec, 160 secs
lola: 9621126 markings, 46235160 edges, 65460 markings/sec, 165 secs
lola: 9919735 markings, 47700743 edges, 59722 markings/sec, 170 secs
lola: 10206582 markings, 49219727 edges, 57369 markings/sec, 175 secs
lola: 10509222 markings, 50695539 edges, 60528 markings/sec, 180 secs
lola: 10790800 markings, 52268782 edges, 56316 markings/sec, 185 secs
lola: 11072290 markings, 53833214 edges, 56298 markings/sec, 190 secs
lola: 11356235 markings, 55380272 edges, 56789 markings/sec, 195 secs
lola: 11667664 markings, 56844675 edges, 62286 markings/sec, 200 secs
lola: 11961596 markings, 58390923 edges, 58786 markings/sec, 205 secs
lola: 12249065 markings, 59968778 edges, 57494 markings/sec, 210 secs
lola: 12540944 markings, 61523525 edges, 58376 markings/sec, 215 secs
lola: 12859826 markings, 62952665 edges, 63776 markings/sec, 220 secs
lola: 13164054 markings, 64448604 edges, 60846 markings/sec, 225 secs
lola: 13452352 markings, 65983381 edges, 57660 markings/sec, 230 secs
lola: 13757110 markings, 67440421 edges, 60952 markings/sec, 235 secs
lola: 14038392 markings, 68932321 edges, 56256 markings/sec, 240 secs
lola: 14327722 markings, 70366146 edges, 57866 markings/sec, 245 secs
lola: 14618491 markings, 71721772 edges, 58154 markings/sec, 250 secs
lola: 14904739 markings, 73089743 edges, 57250 markings/sec, 255 secs
lola: 15184770 markings, 74578884 edges, 56006 markings/sec, 260 secs
lola: 15366861 markings, 75610994 edges, 36418 markings/sec, 265 secs
lola: 15568464 markings, 76745218 edges, 40321 markings/sec, 270 secs
lola: 15711787 markings, 77469648 edges, 28665 markings/sec, 275 secs
lola: 15936142 markings, 78593719 edges, 44871 markings/sec, 280 secs
lola: 16135350 markings, 79721083 edges, 39842 markings/sec, 285 secs
lola: 16311248 markings, 80615918 edges, 35180 markings/sec, 290 secs
lola: 16549806 markings, 81853072 edges, 47712 markings/sec, 295 secs
lola: 16737268 markings, 82716857 edges, 37492 markings/sec, 300 secs
lola: 16874148 markings, 83390043 edges, 27376 markings/sec, 305 secs
lola: 17077002 markings, 84529968 edges, 40571 markings/sec, 310 secs
lola: 17269719 markings, 85629531 edges, 38543 markings/sec, 315 secs
lola: 17487987 markings, 86954828 edges, 43654 markings/sec, 320 secs
lola: 17716322 markings, 88317089 edges, 45667 markings/sec, 325 secs
lola: 17938834 markings, 89538673 edges, 44502 markings/sec, 330 secs
lola: 18131866 markings, 90740162 edges, 38606 markings/sec, 335 secs
lola: 18331154 markings, 91983400 edges, 39858 markings/sec, 340 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (G ((((p87 <= 0) OR (p193 <= 0) OR (p489 <= 0) OR (p19 <= 0) OR (p107 <= 0) OR (p228 <= 0)) OR E (F (((1 <= p67) AND (1 <= p95) AND (1 <= p342)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((((p87 <= 0) OR (p193 <= 0) OR (p489 <= 0) OR (p19 <= 0) OR (p107 <= 0) OR (p228 <= 0)) OR EF(((1 <= p67) AND (1 <= p95) AND (1 <= p342)))))
lola: processed formula length: 148
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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 192677 markings, 737792 edges, 38535 markings/sec, 0 secs
lola: 378751 markings, 1555515 edges, 37215 markings/sec, 5 secs
lola: 645891 markings, 2702431 edges, 53428 markings/sec, 10 secs
lola: 937414 markings, 4057871 edges, 58305 markings/sec, 15 secs
lola: 1246329 markings, 5425119 edges, 61783 markings/sec, 20 secs
lola: 1524150 markings, 6830609 edges, 55564 markings/sec, 25 secs
lola: 1817168 markings, 8206939 edges, 58604 markings/sec, 30 secs
lola: 2089017 markings, 9338584 edges, 54370 markings/sec, 35 secs
lola: 2412545 markings, 10704726 edges, 64706 markings/sec, 40 secs
lola: 2720921 markings, 12114784 edges, 61675 markings/sec, 45 secs
lola: 3014574 markings, 13549263 edges, 58731 markings/sec, 50 secs
lola: 3336048 markings, 14923304 edges, 64295 markings/sec, 55 secs
lola: 3637832 markings, 16348313 edges, 60357 markings/sec, 60 secs
lola: 3959856 markings, 17722459 edges, 64405 markings/sec, 65 secs
lola: 4209450 markings, 18718530 edges, 49919 markings/sec, 70 secs
lola: 4495467 markings, 20140728 edges, 57203 markings/sec, 75 secs
lola: 4768079 markings, 21505351 edges, 54522 markings/sec, 80 secs
lola: 5055031 markings, 22889158 edges, 57390 markings/sec, 85 secs
lola: 5329699 markings, 24060580 edges, 54934 markings/sec, 90 secs
lola: 5619454 markings, 25501315 edges, 57951 markings/sec, 95 secs
lola: 5907181 markings, 26996087 edges, 57545 markings/sec, 100 secs
lola: 6185701 markings, 28461507 edges, 55704 markings/sec, 105 secs
lola: 6451849 markings, 29872175 edges, 53230 markings/sec, 110 secs
lola: 6690679 markings, 31328745 edges, 47766 markings/sec, 115 secs
lola: 6936048 markings, 32701410 edges, 49074 markings/sec, 120 secs
lola: 7196589 markings, 34144973 edges, 52108 markings/sec, 125 secs
lola: 7483183 markings, 35539551 edges, 57319 markings/sec, 130 secs
lola: 7748925 markings, 36988282 edges, 53148 markings/sec, 135 secs
lola: 8019383 markings, 38506274 edges, 54092 markings/sec, 140 secs
lola: 8263553 markings, 39895005 edges, 48834 markings/sec, 145 secs
lola: 8551649 markings, 41258935 edges, 57619 markings/sec, 150 secs
lola: 8840133 markings, 42729674 edges, 57697 markings/sec, 155 secs
lola: 9133207 markings, 44131149 edges, 58615 markings/sec, 160 secs
lola: 9452963 markings, 45501014 edges, 63951 markings/sec, 165 secs
lola: 9761221 markings, 46931732 edges, 61652 markings/sec, 170 secs
lola: 10060398 markings, 48418793 edges, 59835 markings/sec, 175 secs
lola: 10351014 markings, 49937730 edges, 58123 markings/sec, 180 secs
lola: 10651626 markings, 51456538 edges, 60122 markings/sec, 185 secs
lola: 10928046 markings, 53066629 edges, 55284 markings/sec, 190 secs
lola: 11214263 markings, 54630339 edges, 57243 markings/sec, 195 secs
lola: 11516413 markings, 56136189 edges, 60430 markings/sec, 200 secs
lola: 11820618 markings, 57639898 edges, 60841 markings/sec, 205 secs
lola: 12113792 markings, 59184287 edges, 58635 markings/sec, 210 secs
lola: 12393473 markings, 60779822 edges, 55936 markings/sec, 215 secs
lola: 12709014 markings, 62230438 edges, 63108 markings/sec, 220 secs
lola: 13011712 markings, 63713300 edges, 60540 markings/sec, 225 secs
lola: 13307169 markings, 65221802 edges, 59091 markings/sec, 230 secs
lola: 13606421 markings, 66709895 edges, 59850 markings/sec, 235 secs
lola: 13898611 markings, 68171761 edges, 58438 markings/sec, 240 secs
lola: 14182867 markings, 69656592 edges, 56851 markings/sec, 245 secs
lola: 14479921 markings, 71101074 edges, 59411 markings/sec, 250 secs
lola: 14790160 markings, 72510932 edges, 62048 markings/sec, 255 secs
lola: 15072188 markings, 73998475 edges, 56406 markings/sec, 260 secs
lola: 15323248 markings, 75349817 edges, 50212 markings/sec, 265 secs
lola: 15574011 markings, 76775399 edges, 50153 markings/sec, 270 secs
lola: 15794988 markings, 77863975 edges, 44195 markings/sec, 275 secs
lola: 16023475 markings, 79087487 edges, 45697 markings/sec, 280 secs
lola: 16216053 markings, 80146608 edges, 38516 markings/sec, 285 secs
lola: 16393529 markings, 81041711 edges, 35495 markings/sec, 290 secs
lola: 16640644 markings, 82286576 edges, 49423 markings/sec, 295 secs
lola: 16792918 markings, 82986461 edges, 30455 markings/sec, 300 secs
lola: 17015707 markings, 84164491 edges, 44558 markings/sec, 305 secs
lola: 17189703 markings, 85195080 edges, 34799 markings/sec, 310 secs
lola: 17299634 markings, 85799800 edges, 21986 markings/sec, 315 secs
lola: 17518149 markings, 87150964 edges, 43703 markings/sec, 320 secs
lola: 17659082 markings, 87994225 edges, 28187 markings/sec, 325 secs
lola: 17814099 markings, 88841048 edges, 31003 markings/sec, 330 secs
lola: 17986014 markings, 89829083 edges, 34383 markings/sec, 335 secs
lola: 18152815 markings, 90873521 edges, 33360 markings/sec, 340 secs
lola: 18325151 markings, 91948027 edges, 34467 markings/sec, 345 secs
lola: 18364826 markings, 92176752 edges, 7935 markings/sec, 350 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (((p25 <= 0) OR (p187 <= 0) OR (p480 <= 0)) AND (E (G (((p133 <= 0) OR (p163 <= 0) OR (p399 <= 0)))) OR (A (G ((((1 <= p69) AND (1 <= p113) AND (1 <= p369)) OR ((1 <= p3) AND (1 <= p37) AND (1 <= p255))))) OR ((1 <= p17) AND (1 <= p161) AND (1 <= p225)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (G (((p133 <= 0) OR (p163 <= 0) OR (p399 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p133 <= 0) OR (p163 <= 0) OR (p399 <= 0))))
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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p133) AND (1 <= p163) AND (1 <= p399))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 3 markings, 3 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((p25 <= 0) OR (p187 <= 0) OR (p480 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p25 <= 0) OR (p187 <= 0) OR (p480 <= 0))
lola: processed formula length: 44
lola: 28 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: unknown no no yes yes no yes yes unknown yes no no no no unknown no
lola:
preliminary result: unknown no no yes yes no yes yes unknown yes no no no no unknown no
lola: memory consumption: 4552 KB
lola: time consumption: 1986 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="Dekker-PT-100"
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 Dekker-PT-100, 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 r178-tajo-158987882200340"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-100.tgz
mv Dekker-PT-100 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 ;