Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r166-smll-158987787700436.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is AutoFlight-PT-05a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r166-smll-158987787700436
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 3.4K Mar 25 23:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 25 23:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 18:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 18:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 15:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 25 15:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 10:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 10:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 25 17:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 25 17:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 36K Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutoFlight-PT-05a-CTLFireability-00
FORMULA_NAME AutoFlight-PT-05a-CTLFireability-01
FORMULA_NAME AutoFlight-PT-05a-CTLFireability-02
FORMULA_NAME AutoFlight-PT-05a-CTLFireability-03
FORMULA_NAME AutoFlight-PT-05a-CTLFireability-04
FORMULA_NAME AutoFlight-PT-05a-CTLFireability-05
FORMULA_NAME AutoFlight-PT-05a-CTLFireability-06
FORMULA_NAME AutoFlight-PT-05a-CTLFireability-07
FORMULA_NAME AutoFlight-PT-05a-CTLFireability-08
FORMULA_NAME AutoFlight-PT-05a-CTLFireability-09
FORMULA_NAME AutoFlight-PT-05a-CTLFireability-10
FORMULA_NAME AutoFlight-PT-05a-CTLFireability-11
FORMULA_NAME AutoFlight-PT-05a-CTLFireability-12
FORMULA_NAME AutoFlight-PT-05a-CTLFireability-13
FORMULA_NAME AutoFlight-PT-05a-CTLFireability-14
FORMULA_NAME AutoFlight-PT-05a-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591472055587

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-06 19:34:18] [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-06 19:34:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-06 19:34:18] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2020-06-06 19:34:19] [INFO ] Transformed 132 places.
[2020-06-06 19:34:19] [INFO ] Transformed 130 transitions.
[2020-06-06 19:34:19] [INFO ] Found NUPN structural information;
[2020-06-06 19:34:19] [INFO ] Parsed PT model containing 132 places and 130 transitions in 202 ms.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 33 ms.
Incomplete random walk after 100000 steps, including 3038 resets, run finished after 458 ms. (steps per millisecond=218 ) properties seen :[1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1]
// Phase 1: matrix 105 rows 132 cols
[2020-06-06 19:34:19] [INFO ] Computed 34 place invariants in 10 ms
[2020-06-06 19:34:19] [INFO ] [Real]Absence check using 33 positive place invariants in 41 ms returned sat
[2020-06-06 19:34:19] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-06 19:34:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 19:34:19] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2020-06-06 19:34:19] [INFO ] State equation strengthened by 25 read => feed constraints.
[2020-06-06 19:34:19] [INFO ] [Real]Added 25 Read/Feed constraints in 7 ms returned sat
[2020-06-06 19:34:20] [INFO ] Deduced a trap composed of 52 places in 121 ms
[2020-06-06 19:34:20] [INFO ] Deduced a trap composed of 53 places in 93 ms
[2020-06-06 19:34:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 270 ms
[2020-06-06 19:34:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 19:34:20] [INFO ] [Nat]Absence check using 33 positive place invariants in 37 ms returned sat
[2020-06-06 19:34:20] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 3 ms returned sat
[2020-06-06 19:34:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 19:34:20] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2020-06-06 19:34:20] [INFO ] [Nat]Added 25 Read/Feed constraints in 12 ms returned sat
[2020-06-06 19:34:20] [INFO ] Deduced a trap composed of 52 places in 79 ms
[2020-06-06 19:34:20] [INFO ] Deduced a trap composed of 53 places in 103 ms
[2020-06-06 19:34:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 232 ms
[2020-06-06 19:34:20] [INFO ] Computed and/alt/rep : 104/311/104 causal constraints in 22 ms.
[2020-06-06 19:34:21] [INFO ] Added : 104 causal constraints over 21 iterations in 478 ms. Result :sat
[2020-06-06 19:34:21] [INFO ] [Real]Absence check using 33 positive place invariants in 26 ms returned sat
[2020-06-06 19:34:21] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2020-06-06 19:34:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 19:34:21] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2020-06-06 19:34:21] [INFO ] [Real]Added 25 Read/Feed constraints in 7 ms returned sat
[2020-06-06 19:34:21] [INFO ] Computed and/alt/rep : 104/311/104 causal constraints in 17 ms.
[2020-06-06 19:34:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 19:34:21] [INFO ] [Nat]Absence check using 33 positive place invariants in 29 ms returned sat
[2020-06-06 19:34:21] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2020-06-06 19:34:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 19:34:21] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2020-06-06 19:34:21] [INFO ] [Nat]Added 25 Read/Feed constraints in 9 ms returned sat
[2020-06-06 19:34:21] [INFO ] Computed and/alt/rep : 104/311/104 causal constraints in 18 ms.
[2020-06-06 19:34:22] [INFO ] Added : 82 causal constraints over 17 iterations in 356 ms. Result :sat
[2020-06-06 19:34:22] [INFO ] [Real]Absence check using 33 positive place invariants in 25 ms returned sat
[2020-06-06 19:34:22] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 4 ms returned unsat
[2020-06-06 19:34:22] [INFO ] [Real]Absence check using 33 positive place invariants in 25 ms returned sat
[2020-06-06 19:34:22] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 3 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-06-06 19:34:22] [INFO ] Flatten gal took : 87 ms
[2020-06-06 19:34:22] [INFO ] Flatten gal took : 29 ms
[2020-06-06 19:34:22] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 9 ms.
[2020-06-06 19:34:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ AutoFlight-PT-05a @ 3570 seconds

FORMULA AutoFlight-PT-05a-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-05a-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-05a-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-05a-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-05a-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-05a-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-05a-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-05a-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-05a-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-05a-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-05a-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-05a-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-05a-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-05a-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-05a-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-05a-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1953
rslt: Output for CTLFireability @ AutoFlight-PT-05a

{
"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": "Sat Jun 6 19:34:23 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 3,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "EF((EG(((p19 <= 0))) AND (EX(((1 <= p7) AND (1 <= p52))) OR ((1 <= p24)))))",
"processed_size": 75,
"rewrites": 39
},
"net":
{
"conflict_clusters": 68,
"singleton_clusters": 0
},
"result":
{
"edges": 23,
"markings": 21,
"produced_by": "CTL model checker",
"value": true
},
"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": 237
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 1,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "E (G ((((1 <= p46)) OR ((1 <= p10)) OR ((1 <= p36) AND (1 <= p103)) OR ((1 <= p35) AND (1 <= p83)) OR ((1 <= p62)) OR (p7 <= 0) OR (p89 <= 0))))",
"processed_size": 150,
"rewrites": 37
},
"result":
{
"edges": 20,
"markings": 21,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 22
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 28,
"problems": 4
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 3,
"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 ((((1 <= p123) AND (1 <= p130) AND (1 <= p31)) U (((1 <= p9)) OR ((1 <= p106) AND (1 <= p131)))))",
"processed_size": 100,
"rewrites": 41
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 18
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "universal_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EX(AF(((1 <= p13) AND (1 <= p108))))",
"processed_size": 36,
"rewrites": 38
},
"net":
{
"conflict_clusters": 68,
"singleton_clusters": 0
},
"result":
{
"edges": 19,
"markings": 20,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"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 <= p23) AND (1 <= p47) AND (1 <= p122))))",
"processed_size": 51,
"rewrites": 37
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"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": 276
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(((1 <= p41) AND (1 <= p110)) OR ((1 <= p84)))",
"processed_size": 47,
"rewrites": 39
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 301
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "AX(((1 <= p43)))",
"processed_size": 16,
"rewrites": 37
},
"net":
{
"conflict_clusters": 68,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 276
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 276
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p47 <= 0) OR (p122 <= 0))",
"processed_size": 28,
"rewrites": 36
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 301
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((p3 <= 0) OR (p101 <= 0))))",
"processed_size": 35,
"rewrites": 37
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 331
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EG(EX(((p1 <= 0) OR (p72 <= 0))))",
"processed_size": 34,
"rewrites": 38
},
"net":
{
"conflict_clusters": 68,
"singleton_clusters": 0
},
"result":
{
"edges": 5174,
"markings": 1183,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 368
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 4,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "((((p21 <= 0) OR (p81 <= 0)) AND ((p35 <= 0) OR (p56 <= 0))) OR (((p46 <= 0)) AND ((p13 <= 0) OR (p108 <= 0))))",
"processed_size": 114,
"rewrites": 37
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 301
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "EG((AG(((p28 <= 0) OR (p55 <= 0))) OR EX((((1 <= p24) AND (1 <= p119)) OR ((1 <= p19))))))",
"processed_size": 92,
"rewrites": 39
},
"net":
{
"conflict_clusters": 68,
"singleton_clusters": 0
},
"result":
{
"edges": 7101,
"markings": 1953,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 331
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "AF(AX(((p20 <= 0))))",
"processed_size": 20,
"rewrites": 38
},
"net":
{
"conflict_clusters": 68,
"singleton_clusters": 0
},
"result":
{
"edges": 6339,
"markings": 2348,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 368
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 368
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (((p24 <= 0) OR (p119 <= 0))))",
"processed_size": 36,
"rewrites": 38
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 414
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 6,
"adisj": 2,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "AG((AX(((1 <= p20) AND (1 <= p114))) OR ((((1 <= p100) AND (1 <= p131)) OR ((1 <= p12))) AND (((1 <= p37)) OR ((1 <= p21) AND (1 <= p69))))))",
"processed_size": 143,
"rewrites": 38
},
"net":
{
"conflict_clusters": 68,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 414
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AF(AX(EF(((1 <= p35) AND (1 <= p93)))))",
"processed_size": 39,
"rewrites": 39
},
"net":
{
"conflict_clusters": 68,
"singleton_clusters": 0
},
"result":
{
"edges": 5332,
"markings": 1277,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 473
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "EX(AG(((p65 <= 0))))",
"processed_size": 20,
"rewrites": 38
},
"net":
{
"conflict_clusters": 68,
"singleton_clusters": 0
},
"result":
{
"edges": 7089,
"markings": 1942,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 552
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p9))))",
"processed_size": 19,
"rewrites": 37
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 662
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p21) AND (1 <= p81))))",
"processed_size": 35,
"rewrites": 37
},
"result":
{
"edges": 24,
"markings": 25,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 828
},
"exit":
{
"localtimelimitreached": false
},
"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 (((p7 <= 0) OR (p67 <= 0) OR (p6 <= 0))))",
"processed_size": 48,
"rewrites": 37
},
"result":
{
"edges": 20,
"markings": 21,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1104
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "AG(E((((1 <= p40)) OR ((1 <= p35) AND (1 <= p93))) U ((p21 <= 0) OR (p54 <= 0))))",
"processed_size": 83,
"rewrites": 38
},
"net":
{
"conflict_clusters": 68,
"singleton_clusters": 0
},
"result":
{
"edges": 9055,
"markings": 1954,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1656
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1656
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p61))))",
"processed_size": 20,
"rewrites": 37
},
"result":
{
"edges": 22,
"markings": 23,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3312
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3312
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 2,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "((((1 <= p35) AND (1 <= p93)) OR ((1 <= p41) AND (1 <= p110))) AND (((1 <= p14) AND (1 <= p53)) OR ((1 <= p100) AND (1 <= p131))))",
"processed_size": 132,
"rewrites": 36
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EF(AG(EX(((1 <= p39) AND (1 <= p109)))))",
"processed_size": 40,
"rewrites": 39
},
"net":
{
"conflict_clusters": 68,
"singleton_clusters": 0
},
"result":
{
"edges": 741921121,
"markings": 68179969,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 2,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "((((1 <= p35) AND (1 <= p93)) OR ((1 <= p41) AND (1 <= p110))) AND (((1 <= p14) AND (1 <= p53)) OR ((1 <= p100) AND (1 <= p131))))",
"processed_size": 132,
"rewrites": 36
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 17,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AF(EG(((p10 <= 0) OR (p107 <= 0))))",
"processed_size": 36,
"rewrites": 38
},
"net":
{
"conflict_clusters": 68,
"singleton_clusters": 0
},
"result":
{
"edges": 21,
"markings": 21,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 47920,
"runtime": 1617.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E(F((E(G(*)) AND (E(X(**)) OR **)))) : E(G(*)) : (E(G(**)) AND (E(X(A(F(**)))) OR A((** U **)))) : E(F(A(G(E(X(**)))))) : (A(F(*)) AND (A(X(**)) AND E(F(**)))) : (E(F(*)) AND (E(G(E(X(*)))) AND (** AND (A(X(*)) OR (** OR **))))) : (A(F(E(G(*)))) OR **) : E(F(**)) : E(G((A(G(**)) OR E(X(**))))) : A(F(A(X(**)))) : (A(G(*)) OR A(G((A(X(**)) OR **)))) : A(F(A(X(E(F(**)))))) : A(G(E((** U **)))) : E(X(A(G(*)))) : (E(F(**)) OR E(F(**)))"
},
"net":
{
"arcs": 370,
"conflict_clusters": 68,
"places": 132,
"places_significant": 98,
"singleton_clusters": 0,
"transitions": 105
},
"result":
{
"preliminary_value": "yes yes yes no no yes yes yes yes no no no yes no no yes ",
"value": "yes yes yes no no yes yes yes yes no no no yes no no yes "
},
"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: 237/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 132
lola: finding significant places
lola: 132 places, 105 transitions, 98 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: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p123 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p131 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p131 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p119 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p119 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p131 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: E (F (((1 <= p9)))) : E (F ((NOT(A (F (((1 <= p19))))) AND (E (X (((1 <= p7) AND (1 <= p52)))) OR ((1 <= p24)))))) : NOT(A (F (((1 <= p7) AND (1 <= p67) AND (1 <= p6))))) : (E (G ((((1 <= p46)) OR ((1 <= p10)) OR ((1 <= p36) AND (1 <= p103)) OR ((1 <= p35) AND (1 <= p83)) OR ((1 <= p62)) OR (p7 <= 0) OR (p89 <= 0)))) AND (E (X (A (F (((1 <= p13) AND (1 <= p108)))))) OR A ((((1 <= p123) AND (1 <= p130) AND (1 <= p31)) U (((1 <= p9)) OR ((1 <= p106) AND (1 <= p131))))))) : E (F (A (G (E (X (((1 <= p39) AND (1 <= p109)))))))) : ((NOT(E (G ((((1 <= p41) AND (1 <= p110)) OR ((1 <= p84)))))) AND A (X (((1 <= p43))))) AND E (F (((1 <= p23) AND (1 <= p47) AND (1 <= p122))))) : (((NOT(A (G (((1 <= p3) AND (1 <= p101))))) AND E (G (NOT(A (X (((1 <= p1) AND (1 <= p72)))))))) AND ((p47 <= 0) OR (p122 <= 0))) AND ((NOT(E (X (((1 <= p21) AND (1 <= p91))))) OR (((p21 <= 0) OR (p81 <= 0)) AND ((p35 <= 0) OR (p56 <= 0)))) OR (((p46 <= 0)) AND ((p13 <= 0) OR (p108 <= 0))))) : (A (F (NOT(A (F (((1 <= p10) AND (1 <= p107))))))) OR ((((1 <= p35) AND (1 <= p93)) OR ((1 <= p41) AND (1 <= p110))) AND (((1 <= p14) AND (1 <= p53)) OR ((1 <= p100) AND (1 <= p131))))) : E (F (((1 <= p21) AND (1 <= p81)))) : E (G ((A (G (((p28 <= 0) OR (p55 <= 0)))) OR E (X ((((1 <= p24) AND (1 <= p119)) OR ((1 <= p19)))))))) : A (F (A (X (((p20 <= 0)))))) : (NOT(E (F (((1 <= p24) AND (1 <= p119))))) OR A (G ((A (X (((1 <= p20) AND (1 <= p114)))) OR ((((1 <= p100) AND (1 <= p131)) OR ((1 <= p12))) AND (((1 <= p37)) OR ((1 <= p21) AND (1 <= p69)))))))) : A (F (A (X (E (F (((1 <= p35) AND (1 <= p93)))))))) : A (G (E (((((1 <= p40)) OR ((1 <= p35) AND (1 <= p93))) U ((p21 <= 0) OR (p54 <= 0)))))) : NOT(A (X (E (F (((1 <= p65))))))) : E (F ((E ((((1 <= p17)) U ((1 <= p14) AND (1 <= p90)))) OR ((1 <= p61)))))
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:548
lola: rewrite Frontend/Parser/formula_rewrite.k:446
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G (((p19 <= 0)))) AND (E (X (((1 <= p7) AND (1 <= p52)))) OR ((1 <= p24))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((EG(((p19 <= 0))) AND (EX(((1 <= p7) AND (1 <= p52))) OR ((1 <= p24)))))
lola: processed formula length: 75
lola: 39 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 21 markings, 23 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((((1 <= p46)) OR ((1 <= p10)) OR ((1 <= p36) AND (1 <= p103)) OR ((1 <= p35) AND (1 <= p83)) OR ((1 <= p62)) OR (p7 <= 0) OR (p89 <= 0)))) AND (E (X (A (F (((1 <= p13) AND (1 <= p108)))))) OR A ((((1 <= p123) AND (1 <= p130) AND (1 <= p31)) U (((1 <= p9)) OR ((1 <= p106) AND (1 <= p131)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((1 <= p46)) OR ((1 <= p10)) OR ((1 <= p36) AND (1 <= p103)) OR ((1 <= p35) AND (1 <= p83)) OR ((1 <= p62)) OR (p7 <= 0) OR (p89 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((1 <= p46)) OR ((1 <= p10)) OR ((1 <= p36) AND (1 <= p103)) OR ((1 <= p35) AND (1 <= p83)) OR ((1 <= p62)) OR (p7 <= 0) OR (p89 <= 0))))
lola: processed formula length: 150
lola: 37 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: (((p46 <= 0)) AND ((p10 <= 0)) AND ((p36 <= 0) OR (p103 <= 0)) AND ((p35 <= 0) OR (p83 <= 0)) AND ((p62 <= 0)) AND (1 <= p7) AND (1 <= p89))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: state equation task get result unparse finished id 0
lola: The predicate is possibly preserved.
lola: state equation: Generated DNF with 28 literals and 4 conjunctive subformulas
lola: 21 markings, 20 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p123) AND (1 <= p130) AND (1 <= p31)) U (((1 <= p9)) OR ((1 <= p106) AND (1 <= p131)))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A ((((1 <= p123) AND (1 <= p130) AND (1 <= p31)) U (((1 <= p9)) OR ((1 <= p106) AND (1 <= p131)))))
lola: processed formula length: 100
lola: 41 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 /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl 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: 1
lola: formula 0: ((1 <= p123) AND (1 <= p130) AND (1 <= p31))
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 /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (F (((1 <= p13) AND (1 <= p108))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AF(((1 <= p13) AND (1 <= p108))))
lola: processed formula length: 36
lola: 38 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: 20 markings, 19 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (E (X (((1 <= p39) AND (1 <= p109))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AG(EX(((1 <= p39) AND (1 <= p109)))))
lola: processed formula length: 40
lola: 39 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: 551558 markings, 3092352 edges, 110312 markings/sec, 0 secs
lola: 1099172 markings, 6266361 edges, 109523 markings/sec, 5 secs
lola: 1613147 markings, 9340460 edges, 102795 markings/sec, 10 secs
lola: 2096743 markings, 12311172 edges, 96719 markings/sec, 15 secs
lola: 2559996 markings, 15207634 edges, 92651 markings/sec, 20 secs
lola: 3005835 markings, 18059985 edges, 89168 markings/sec, 25 secs
lola: 3434930 markings, 20937034 edges, 85819 markings/sec, 30 secs
lola: 3867226 markings, 23764622 edges, 86459 markings/sec, 35 secs
lola: 4277820 markings, 26608440 edges, 82119 markings/sec, 40 secs
lola: 4688182 markings, 29420923 edges, 82072 markings/sec, 45 secs
lola: 5098108 markings, 32213331 edges, 81985 markings/sec, 50 secs
lola: 5496092 markings, 35008891 edges, 79597 markings/sec, 55 secs
lola: 5899768 markings, 37817150 edges, 80735 markings/sec, 60 secs
lola: 6286436 markings, 40572881 edges, 77334 markings/sec, 65 secs
lola: 6683753 markings, 43359518 edges, 79463 markings/sec, 70 secs
lola: 7068645 markings, 46128070 edges, 76978 markings/sec, 75 secs
lola: 7453592 markings, 48896759 edges, 76989 markings/sec, 80 secs
lola: 7832191 markings, 51673331 edges, 75720 markings/sec, 85 secs
lola: 8208451 markings, 54437566 edges, 75252 markings/sec, 90 secs
lola: 8579937 markings, 57194264 edges, 74297 markings/sec, 95 secs
lola: 8955086 markings, 59962872 edges, 75030 markings/sec, 100 secs
lola: 9330709 markings, 62744369 edges, 75125 markings/sec, 105 secs
lola: 9697645 markings, 65489572 edges, 73387 markings/sec, 110 secs
lola: 10062895 markings, 68248414 edges, 73050 markings/sec, 115 secs
lola: 10419783 markings, 71019458 edges, 71378 markings/sec, 120 secs
lola: 10773430 markings, 73765102 edges, 70729 markings/sec, 125 secs
lola: 11135836 markings, 76509356 edges, 72481 markings/sec, 130 secs
lola: 11480680 markings, 79287307 edges, 68969 markings/sec, 135 secs
lola: 11849882 markings, 82107291 edges, 73840 markings/sec, 140 secs
lola: 12203361 markings, 84915560 edges, 70696 markings/sec, 145 secs
lola: 12553751 markings, 87694318 edges, 70078 markings/sec, 150 secs
lola: 12905761 markings, 90479369 edges, 70402 markings/sec, 155 secs
lola: 13261865 markings, 93253134 edges, 71221 markings/sec, 160 secs
lola: 13623232 markings, 96088137 edges, 72273 markings/sec, 165 secs
lola: 13968391 markings, 98909559 edges, 69032 markings/sec, 170 secs
lola: 14309931 markings, 101691968 edges, 68308 markings/sec, 175 secs
lola: 14655578 markings, 104454066 edges, 69129 markings/sec, 180 secs
lola: 14994266 markings, 107264926 edges, 67738 markings/sec, 185 secs
lola: 15337290 markings, 110077032 edges, 68605 markings/sec, 190 secs
lola: 15673655 markings, 112885186 edges, 67273 markings/sec, 195 secs
lola: 16009722 markings, 115664538 edges, 67213 markings/sec, 200 secs
lola: 16345864 markings, 118452559 edges, 67228 markings/sec, 205 secs
lola: 16669332 markings, 121223295 edges, 64694 markings/sec, 210 secs
lola: 16997412 markings, 123987097 edges, 65616 markings/sec, 215 secs
lola: 17330004 markings, 126776752 edges, 66518 markings/sec, 220 secs
lola: 17659822 markings, 129549785 edges, 65964 markings/sec, 225 secs
lola: 17992788 markings, 132355750 edges, 66593 markings/sec, 230 secs
lola: 18315798 markings, 135161585 edges, 64602 markings/sec, 235 secs
lola: 18634639 markings, 137914894 edges, 63768 markings/sec, 240 secs
lola: 18959031 markings, 140700564 edges, 64878 markings/sec, 245 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown yes unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 2864876 KB
lola: time consumption: 258 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((((p41 <= 0) OR (p110 <= 0)) AND ((p84 <= 0))))) AND (A (X (((1 <= p43)))) AND E (F (((1 <= p23) AND (1 <= p47) AND (1 <= p122))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p23) AND (1 <= p47) AND (1 <= p122))))
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 <= p23) AND (1 <= p47) AND (1 <= p122))))
lola: processed formula length: 51
lola: 37 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 <= p23) AND (1 <= p47) AND (1 <= p122))
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: 10 markings, 9 edges
lola: ========================================
lola: subprocess 4 will run for 276 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((p41 <= 0) OR (p110 <= 0)) AND ((p84 <= 0)))))
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:788
lola: processed formula: (((1 <= p41) AND (1 <= p110)) OR ((1 <= p84)))
lola: processed formula length: 47
lola: 39 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: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: formula 0: (((p41 <= 0) OR (p110 <= 0)) AND ((p84 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 301 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((1 <= p43))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((1 <= p43)))
lola: processed formula length: 16
lola: 37 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 276 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((p3 <= 0) OR (p101 <= 0)))) AND (E (G (E (X (((p1 <= 0) OR (p72 <= 0)))))) AND (((p47 <= 0) OR (p122 <= 0)) AND (A (X (((p21 <= 0) OR (p91 <= 0)))) OR ((((p21 <= 0) OR (p81 <= 0)) AND ((p35 <= 0) OR (p56 <= 0))) OR (((p46 <= 0)) AND ((p13 <= 0) OR (p108 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 276 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p47 <= 0) OR (p122 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p47 <= 0) OR (p122 <= 0))
lola: processed formula length: 28
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 301 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p3 <= 0) OR (p101 <= 0))))
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 (((p3 <= 0) OR (p101 <= 0))))
lola: processed formula length: 35
lola: 37 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: formula 0: ((p3 <= 0) OR (p101 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 6 will run for 331 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (X (((p1 <= 0) OR (p72 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(EX(((p1 <= 0) OR (p72 <= 0))))
lola: processed formula length: 34
lola: 38 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1183 markings, 5174 edges
lola: ========================================
lola: subprocess 7 will run for 368 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p21 <= 0) OR (p81 <= 0)) AND ((p35 <= 0) OR (p56 <= 0))) OR (((p46 <= 0)) AND ((p13 <= 0) OR (p108 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: ((((p21 <= 0) OR (p81 <= 0)) AND ((p35 <= 0) OR (p56 <= 0))) OR (((p46 <= 0)) AND ((p13 <= 0) OR (p108 <= 0))))
lola: processed formula length: 114
lola: 37 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 7 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 301 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((A (G (((p28 <= 0) OR (p55 <= 0)))) OR E (X ((((1 <= p24) AND (1 <= p119)) OR ((1 <= p19))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((AG(((p28 <= 0) OR (p55 <= 0))) OR EX((((1 <= p24) AND (1 <= p119)) OR ((1 <= p19))))))
lola: processed formula length: 92
lola: 39 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: 1953 markings, 7101 edges
lola: ========================================
lola: subprocess 6 will run for 331 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (X (((p20 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(AX(((p20 <= 0))))
lola: processed formula length: 20
lola: 38 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: 2348 markings, 6339 edges
lola: ========================================
lola: subprocess 7 will run for 368 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((p24 <= 0) OR (p119 <= 0)))) OR A (G ((A (X (((1 <= p20) AND (1 <= p114)))) OR ((((1 <= p100) AND (1 <= p131)) OR ((1 <= p12))) AND (((1 <= p37)) OR ((1 <= p21) AND (1 <= p69))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 368 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p24 <= 0) OR (p119 <= 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 (((p24 <= 0) OR (p119 <= 0))))
lola: processed formula length: 36
lola: 38 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 <= p24) AND (1 <= p119))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 8 will run for 414 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((A (X (((1 <= p20) AND (1 <= p114)))) OR ((((1 <= p100) AND (1 <= p131)) OR ((1 <= p12))) AND (((1 <= p37)) OR ((1 <= p21) AND (1 <= p69)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((AX(((1 <= p20) AND (1 <= p114))) OR ((((1 <= p100) AND (1 <= p131)) OR ((1 <= p12))) AND (((1 <= p37)) OR ((1 <= p21) AND (1 <= p69))))))
lola: processed formula length: 143
lola: 38 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: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 414 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (X (E (F (((1 <= p35) AND (1 <= p93))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(AX(EF(((1 <= p35) AND (1 <= p93)))))
lola: processed formula length: 39
lola: 39 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1277 markings, 5332 edges
lola: ========================================
lola: subprocess 9 will run for 473 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G (((p65 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AG(((p65 <= 0))))
lola: processed formula length: 20
lola: 38 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: 1942 markings, 7089 edges
lola: ========================================
lola: subprocess 10 will run for 552 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p9))))
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))))
lola: processed formula length: 19
lola: 37 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))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 11 will run for 662 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p21) AND (1 <= p81))))
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 <= p21) AND (1 <= p81))))
lola: processed formula length: 35
lola: 37 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 <= p21) AND (1 <= p81))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 25 markings, 24 edges
lola: ========================================
lola: subprocess 12 will run for 828 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p7 <= 0) OR (p67 <= 0) OR (p6 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p7 <= 0) OR (p67 <= 0) OR (p6 <= 0))))
lola: processed formula length: 48
lola: 37 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 <= p7) AND (1 <= p67) AND (1 <= p6))
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: 21 markings, 20 edges
lola: ========================================
lola: subprocess 13 will run for 1104 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (((((1 <= p40)) OR ((1 <= p35) AND (1 <= p93))) U ((p21 <= 0) OR (p54 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(E((((1 <= p40)) OR ((1 <= p35) AND (1 <= p93))) U ((p21 <= 0) OR (p54 <= 0))))
lola: processed formula length: 83
lola: 38 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: 1954 markings, 9055 edges
lola: ========================================
lola: subprocess 14 will run for 1656 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((1 <= p14) AND (1 <= p90)))) OR E (F (((1 <= p61)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1656 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p61))))
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 <= p61))))
lola: processed formula length: 20
lola: 37 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 <= p61))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 23 markings, 22 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 3312 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (E (G (((p10 <= 0) OR (p107 <= 0)))))) OR ((((1 <= p35) AND (1 <= p93)) OR ((1 <= p41) AND (1 <= p110))) AND (((1 <= p14) AND (1 <= p53)) OR ((1 <= p100) AND (1 <= p131)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3312 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p35) AND (1 <= p93)) OR ((1 <= p41) AND (1 <= p110))) AND (((1 <= p14) AND (1 <= p53)) OR ((1 <= p100) AND (1 <= p131))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((((1 <= p35) AND (1 <= p93)) OR ((1 <= p41) AND (1 <= p110))) AND (((1 <= p14) AND (1 <= p53)) OR ((1 <= p100) AND (1 <= p131))))
lola: processed formula length: 132
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 8 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (A (G (E (X (((1 <= p39) AND (1 <= p109))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AG(EX(((1 <= p39) AND (1 <= p109)))))
lola: processed formula length: 40
lola: 39 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: 547844 markings, 3074571 edges, 109569 markings/sec, 0 secs
lola: 1093801 markings, 6233657 edges, 109191 markings/sec, 5 secs
lola: 1606609 markings, 9301737 edges, 102562 markings/sec, 10 secs
lola: 2096992 markings, 12312562 edges, 98077 markings/sec, 15 secs
lola: 2566953 markings, 15252473 edges, 93992 markings/sec, 20 secs
lola: 3019445 markings, 18145356 edges, 90498 markings/sec, 25 secs
lola: 3454819 markings, 21056382 edges, 87075 markings/sec, 30 secs
lola: 3892763 markings, 23930303 edges, 87589 markings/sec, 35 secs
lola: 4305773 markings, 26796123 edges, 82602 markings/sec, 40 secs
lola: 4720535 markings, 29642018 edges, 82952 markings/sec, 45 secs
lola: 5136600 markings, 32467563 edges, 83213 markings/sec, 50 secs
lola: 5538564 markings, 35290629 edges, 80393 markings/sec, 55 secs
lola: 5945081 markings, 38136017 edges, 81303 markings/sec, 60 secs
lola: 6336270 markings, 40932766 edges, 78238 markings/sec, 65 secs
lola: 6738929 markings, 43743179 edges, 80532 markings/sec, 70 secs
lola: 7129477 markings, 46548486 edges, 78110 markings/sec, 75 secs
lola: 7513210 markings, 49340551 edges, 76747 markings/sec, 80 secs
lola: 7898535 markings, 52153480 edges, 77065 markings/sec, 85 secs
lola: 8279215 markings, 54955447 edges, 76136 markings/sec, 90 secs
lola: 8656388 markings, 57761496 edges, 75435 markings/sec, 95 secs
lola: 9035923 markings, 60562208 edges, 75907 markings/sec, 100 secs
lola: 9416321 markings, 63357707 edges, 76080 markings/sec, 105 secs
lola: 9784119 markings, 66140577 edges, 73560 markings/sec, 110 secs
lola: 10151744 markings, 68933124 edges, 73525 markings/sec, 115 secs
lola: 10508990 markings, 71726888 edges, 71449 markings/sec, 120 secs
lola: 10871627 markings, 74502981 edges, 72527 markings/sec, 125 secs
lola: 11231571 markings, 77303334 edges, 71989 markings/sec, 130 secs
lola: 11584206 markings, 80086944 edges, 70527 markings/sec, 135 secs
lola: 11949662 markings, 82905248 edges, 73091 markings/sec, 140 secs
lola: 12300058 markings, 85678041 edges, 70079 markings/sec, 145 secs
lola: 12646879 markings, 88444170 edges, 69364 markings/sec, 150 secs
lola: 13004037 markings, 91233007 edges, 71432 markings/sec, 155 secs
lola: 13359818 markings, 94017171 edges, 71156 markings/sec, 160 secs
lola: 13715298 markings, 96824857 edges, 71096 markings/sec, 165 secs
lola: 14057656 markings, 99635625 edges, 68472 markings/sec, 170 secs
lola: 14401555 markings, 102397650 edges, 68780 markings/sec, 175 secs
lola: 14742826 markings, 105165386 edges, 68254 markings/sec, 180 secs
lola: 15081595 markings, 107974217 edges, 67754 markings/sec, 185 secs
lola: 15421392 markings, 110757400 edges, 67959 markings/sec, 190 secs
lola: 15757981 markings, 113565064 edges, 67318 markings/sec, 195 secs
lola: 16093641 markings, 116353233 edges, 67132 markings/sec, 200 secs
lola: 16422886 markings, 119112610 edges, 65849 markings/sec, 205 secs
lola: 16750532 markings, 121892792 edges, 65529 markings/sec, 210 secs
lola: 17074518 markings, 124646136 edges, 64797 markings/sec, 215 secs
lola: 17405065 markings, 127433183 edges, 66109 markings/sec, 220 secs
lola: 17742266 markings, 130222626 edges, 67440 markings/sec, 225 secs
lola: 18065860 markings, 132995197 edges, 64719 markings/sec, 230 secs
lola: 18387708 markings, 135804872 edges, 64370 markings/sec, 235 secs
lola: 18709325 markings, 138559445 edges, 64323 markings/sec, 240 secs
lola: 19028895 markings, 141327677 edges, 63914 markings/sec, 245 secs
lola: 19340915 markings, 144099341 edges, 62404 markings/sec, 250 secs
lola: 19659814 markings, 146870703 edges, 63780 markings/sec, 255 secs
lola: 19977401 markings, 149659034 edges, 63517 markings/sec, 260 secs
lola: 20288145 markings, 152444251 edges, 62149 markings/sec, 265 secs
lola: 20599105 markings, 155206020 edges, 62192 markings/sec, 270 secs
lola: 20918951 markings, 157957067 edges, 63969 markings/sec, 275 secs
lola: 21231913 markings, 160709774 edges, 62592 markings/sec, 280 secs
lola: 21539883 markings, 163469328 edges, 61594 markings/sec, 285 secs
lola: 21862803 markings, 166255387 edges, 64584 markings/sec, 290 secs
lola: 22174425 markings, 168996082 edges, 62324 markings/sec, 295 secs
lola: 22484977 markings, 171832192 edges, 62110 markings/sec, 300 secs
lola: 22794527 markings, 174619324 edges, 61910 markings/sec, 305 secs
lola: 23103879 markings, 177376081 edges, 61870 markings/sec, 310 secs
lola: 23414771 markings, 180166378 edges, 62178 markings/sec, 315 secs
lola: 23719736 markings, 183055748 edges, 60993 markings/sec, 320 secs
lola: 24002672 markings, 185913395 edges, 56587 markings/sec, 325 secs
lola: 24307717 markings, 188628435 edges, 61009 markings/sec, 330 secs
lola: 24612847 markings, 191406215 edges, 61026 markings/sec, 335 secs
lola: 24918104 markings, 194183751 edges, 61051 markings/sec, 340 secs
lola: 25222144 markings, 196910473 edges, 60808 markings/sec, 345 secs
lola: 25529966 markings, 199628796 edges, 61564 markings/sec, 350 secs
lola: 25826299 markings, 202377050 edges, 59267 markings/sec, 355 secs
lola: 26124948 markings, 205086320 edges, 59730 markings/sec, 360 secs
lola: 26412015 markings, 207853707 edges, 57413 markings/sec, 365 secs
lola: 26673554 markings, 210705617 edges, 52308 markings/sec, 370 secs
lola: 26980661 markings, 213447432 edges, 61421 markings/sec, 375 secs
lola: 27286266 markings, 216216922 edges, 61121 markings/sec, 380 secs
lola: 27581871 markings, 218989363 edges, 59121 markings/sec, 385 secs
lola: 27871455 markings, 221710356 edges, 57917 markings/sec, 390 secs
lola: 28159268 markings, 224430097 edges, 57563 markings/sec, 395 secs
lola: 28456491 markings, 227217479 edges, 59445 markings/sec, 400 secs
lola: 28749703 markings, 229999700 edges, 58642 markings/sec, 405 secs
lola: 29029836 markings, 232823415 edges, 56027 markings/sec, 410 secs
lola: 29308311 markings, 235563396 edges, 55695 markings/sec, 415 secs
lola: 29604146 markings, 238329810 edges, 59167 markings/sec, 420 secs
lola: 29890957 markings, 241066314 edges, 57362 markings/sec, 425 secs
lola: 30177497 markings, 243833344 edges, 57308 markings/sec, 430 secs
lola: 30470283 markings, 246604048 edges, 58557 markings/sec, 435 secs
lola: 30743016 markings, 249390212 edges, 54547 markings/sec, 440 secs
lola: 31037346 markings, 252158783 edges, 58866 markings/sec, 445 secs
lola: 31325420 markings, 254923398 edges, 57615 markings/sec, 450 secs
lola: 31602068 markings, 257656251 edges, 55330 markings/sec, 455 secs
lola: 31882939 markings, 260400935 edges, 56174 markings/sec, 460 secs
lola: 32160364 markings, 263152297 edges, 55485 markings/sec, 465 secs
lola: 32451640 markings, 265919951 edges, 58255 markings/sec, 470 secs
lola: 32740915 markings, 268699024 edges, 57855 markings/sec, 475 secs
lola: 33020545 markings, 271493410 edges, 55926 markings/sec, 480 secs
lola: 33300146 markings, 274362092 edges, 55920 markings/sec, 485 secs
lola: 33572648 markings, 277063473 edges, 54500 markings/sec, 490 secs
lola: 33856218 markings, 279857098 edges, 56714 markings/sec, 495 secs
lola: 34110203 markings, 282693133 edges, 50797 markings/sec, 500 secs
lola: 34376821 markings, 285450332 edges, 53324 markings/sec, 505 secs
lola: 34659191 markings, 288332295 edges, 56474 markings/sec, 510 secs
lola: 34925020 markings, 291208497 edges, 53166 markings/sec, 515 secs
lola: 35222586 markings, 293937957 edges, 59513 markings/sec, 520 secs
lola: 35487299 markings, 296711329 edges, 52943 markings/sec, 525 secs
lola: 35753562 markings, 299471100 edges, 53253 markings/sec, 530 secs
lola: 36015509 markings, 302249352 edges, 52389 markings/sec, 535 secs
lola: 36263663 markings, 304994415 edges, 49631 markings/sec, 540 secs
lola: 36507177 markings, 307775586 edges, 48703 markings/sec, 545 secs
lola: 36787724 markings, 310620581 edges, 56109 markings/sec, 550 secs
lola: 37066913 markings, 313409612 edges, 55838 markings/sec, 555 secs
lola: 37371050 markings, 316209656 edges, 60827 markings/sec, 560 secs
lola: 37671430 markings, 319047937 edges, 60076 markings/sec, 565 secs
lola: 37947493 markings, 321885215 edges, 55213 markings/sec, 570 secs
lola: 38206880 markings, 324818334 edges, 51877 markings/sec, 575 secs
lola: 38465058 markings, 327538885 edges, 51636 markings/sec, 580 secs
lola: 38761086 markings, 330223371 edges, 59206 markings/sec, 585 secs
lola: 39032453 markings, 333003672 edges, 54273 markings/sec, 590 secs
lola: 39307475 markings, 335773512 edges, 55004 markings/sec, 595 secs
lola: 39583825 markings, 338521367 edges, 55270 markings/sec, 600 secs
lola: 39844596 markings, 341271765 edges, 52154 markings/sec, 605 secs
lola: 40120635 markings, 344057170 edges, 55208 markings/sec, 610 secs
lola: 40384676 markings, 346870090 edges, 52808 markings/sec, 615 secs
lola: 40624064 markings, 349708320 edges, 47878 markings/sec, 620 secs
lola: 40876798 markings, 352617076 edges, 50547 markings/sec, 625 secs
lola: 41145375 markings, 355494666 edges, 53715 markings/sec, 630 secs
lola: 41393435 markings, 358294261 edges, 49612 markings/sec, 635 secs
lola: 41667147 markings, 361258009 edges, 54742 markings/sec, 640 secs
lola: 41943857 markings, 364119810 edges, 55342 markings/sec, 645 secs
lola: 42206554 markings, 366895884 edges, 52539 markings/sec, 650 secs
lola: 42466856 markings, 369638009 edges, 52060 markings/sec, 655 secs
lola: 42718618 markings, 372346960 edges, 50352 markings/sec, 660 secs
lola: 42965416 markings, 375245219 edges, 49360 markings/sec, 665 secs
lola: 43220615 markings, 378045371 edges, 51040 markings/sec, 670 secs
lola: 43493695 markings, 380802246 edges, 54616 markings/sec, 675 secs
lola: 43742772 markings, 383548819 edges, 49815 markings/sec, 680 secs
lola: 44006338 markings, 386236507 edges, 52713 markings/sec, 685 secs
lola: 44265023 markings, 389008791 edges, 51737 markings/sec, 690 secs
lola: 44514048 markings, 391768735 edges, 49805 markings/sec, 695 secs
lola: 44786305 markings, 394550411 edges, 54451 markings/sec, 700 secs
lola: 45034967 markings, 397315619 edges, 49732 markings/sec, 705 secs
lola: 45291020 markings, 400008991 edges, 51211 markings/sec, 710 secs
lola: 45553628 markings, 402719377 edges, 52522 markings/sec, 715 secs
lola: 45828511 markings, 405465459 edges, 54977 markings/sec, 720 secs
lola: 46089137 markings, 408204808 edges, 52125 markings/sec, 725 secs
lola: 46326956 markings, 410950868 edges, 47564 markings/sec, 730 secs
lola: 46541353 markings, 413737012 edges, 42879 markings/sec, 735 secs
lola: 46796319 markings, 416513145 edges, 50993 markings/sec, 740 secs
lola: 47027049 markings, 419182547 edges, 46146 markings/sec, 745 secs
lola: 47259031 markings, 421901391 edges, 46396 markings/sec, 750 secs
lola: 47491111 markings, 424658112 edges, 46416 markings/sec, 755 secs
lola: 47735997 markings, 427477593 edges, 48977 markings/sec, 760 secs
lola: 48008064 markings, 430336311 edges, 54413 markings/sec, 765 secs
lola: 48289036 markings, 433180304 edges, 56194 markings/sec, 770 secs
lola: 48545103 markings, 436022978 edges, 51213 markings/sec, 775 secs
lola: 48808763 markings, 438861237 edges, 52732 markings/sec, 780 secs
lola: 49064941 markings, 441641109 edges, 51236 markings/sec, 785 secs
lola: 49308256 markings, 444510983 edges, 48663 markings/sec, 790 secs
lola: 49590252 markings, 447246759 edges, 56399 markings/sec, 795 secs
lola: 49894138 markings, 450060067 edges, 60777 markings/sec, 800 secs
lola: 50169762 markings, 452797573 edges, 55125 markings/sec, 805 secs
lola: 50469921 markings, 455504521 edges, 60032 markings/sec, 810 secs
lola: 50760445 markings, 458186911 edges, 58105 markings/sec, 815 secs
lola: 51025832 markings, 460917839 edges, 53077 markings/sec, 820 secs
lola: 51287813 markings, 463643441 edges, 52396 markings/sec, 825 secs
lola: 51510500 markings, 466384275 edges, 44537 markings/sec, 830 secs
lola: 51762695 markings, 469194543 edges, 50439 markings/sec, 835 secs
lola: 52023225 markings, 471948625 edges, 52106 markings/sec, 840 secs
lola: 52284094 markings, 474670285 edges, 52174 markings/sec, 845 secs
lola: 52541746 markings, 477387882 edges, 51530 markings/sec, 850 secs
lola: 52800035 markings, 480126124 edges, 51658 markings/sec, 855 secs
lola: 53054265 markings, 482906186 edges, 50846 markings/sec, 860 secs
lola: 53300630 markings, 485676960 edges, 49273 markings/sec, 865 secs
lola: 53551749 markings, 488428477 edges, 50224 markings/sec, 870 secs
lola: 53809309 markings, 491164518 edges, 51512 markings/sec, 875 secs
lola: 54060225 markings, 493966975 edges, 50183 markings/sec, 880 secs
lola: 54301750 markings, 496743353 edges, 48305 markings/sec, 885 secs
lola: 54526412 markings, 499524119 edges, 44932 markings/sec, 890 secs
lola: 54748701 markings, 502292192 edges, 44458 markings/sec, 895 secs
lola: 54983246 markings, 505050515 edges, 46909 markings/sec, 900 secs
lola: 55205812 markings, 507834575 edges, 44513 markings/sec, 905 secs
lola: 55420307 markings, 510604123 edges, 42899 markings/sec, 910 secs
lola: 55641137 markings, 513333171 edges, 44166 markings/sec, 915 secs
lola: 55855477 markings, 516148981 edges, 42868 markings/sec, 920 secs
lola: 56092756 markings, 518996877 edges, 47456 markings/sec, 925 secs
lola: 56293703 markings, 521820287 edges, 40189 markings/sec, 930 secs
lola: 56521570 markings, 524625601 edges, 45573 markings/sec, 935 secs
lola: 56733848 markings, 527389141 edges, 42456 markings/sec, 940 secs
lola: 56945471 markings, 530143042 edges, 42325 markings/sec, 945 secs
lola: 57151438 markings, 532866069 edges, 41193 markings/sec, 950 secs
lola: 57343017 markings, 535638203 edges, 38316 markings/sec, 955 secs
lola: 57591673 markings, 538468697 edges, 49731 markings/sec, 960 secs
lola: 57782762 markings, 541245961 edges, 38218 markings/sec, 965 secs
lola: 58035667 markings, 544060094 edges, 50581 markings/sec, 970 secs
lola: 58252278 markings, 546832747 edges, 43322 markings/sec, 975 secs
lola: 58428048 markings, 549679791 edges, 35154 markings/sec, 980 secs
lola: 58640526 markings, 552452739 edges, 42496 markings/sec, 985 secs
lola: 58875918 markings, 555240134 edges, 47078 markings/sec, 990 secs
lola: 59092475 markings, 557999174 edges, 43311 markings/sec, 995 secs
lola: 59344314 markings, 560721340 edges, 50368 markings/sec, 1000 secs
lola: 59657621 markings, 563347528 edges, 62661 markings/sec, 1005 secs
lola: 59958853 markings, 565977214 edges, 60246 markings/sec, 1010 secs
lola: 60251469 markings, 568613963 edges, 58523 markings/sec, 1015 secs
lola: 60531878 markings, 571268227 edges, 56082 markings/sec, 1020 secs
lola: 60817221 markings, 573929536 edges, 57069 markings/sec, 1025 secs
lola: 61089225 markings, 576587272 edges, 54401 markings/sec, 1030 secs
lola: 61355847 markings, 579282901 edges, 53324 markings/sec, 1035 secs
lola: 61611211 markings, 581848106 edges, 51073 markings/sec, 1040 secs
lola: 61861248 markings, 584372986 edges, 50007 markings/sec, 1045 secs
lola: 62106811 markings, 587012459 edges, 49113 markings/sec, 1050 secs
lola: 62358455 markings, 589747756 edges, 50329 markings/sec, 1055 secs
lola: 62582691 markings, 592402338 edges, 44847 markings/sec, 1060 secs
lola: 62831389 markings, 595066734 edges, 49740 markings/sec, 1065 secs
lola: 63080714 markings, 597756481 edges, 49865 markings/sec, 1070 secs
lola: 63327581 markings, 600422542 edges, 49373 markings/sec, 1075 secs
lola: 63557296 markings, 603118911 edges, 45943 markings/sec, 1080 secs
lola: 63773217 markings, 605815717 edges, 43184 markings/sec, 1085 secs
lola: 63985185 markings, 608405575 edges, 42394 markings/sec, 1090 secs
lola: 64208793 markings, 611047020 edges, 44722 markings/sec, 1095 secs
lola: 64424588 markings, 613530122 edges, 43159 markings/sec, 1100 secs
lola: 64657633 markings, 616240656 edges, 46609 markings/sec, 1105 secs
lola: 64900607 markings, 618864403 edges, 48595 markings/sec, 1110 secs
lola: 65139725 markings, 621380922 edges, 47824 markings/sec, 1115 secs
lola: 65414373 markings, 623948766 edges, 54930 markings/sec, 1120 secs
lola: 65684407 markings, 626438320 edges, 54007 markings/sec, 1125 secs
lola: 65922511 markings, 628983100 edges, 47621 markings/sec, 1130 secs
lola: 66137061 markings, 631524739 edges, 42910 markings/sec, 1135 secs
lola: 66339139 markings, 634186289 edges, 40416 markings/sec, 1140 secs
lola: 66526659 markings, 636847516 edges, 37504 markings/sec, 1145 secs
lola: 66734850 markings, 639480041 edges, 41638 markings/sec, 1150 secs
lola: 66951350 markings, 642086906 edges, 43300 markings/sec, 1155 secs
lola: 67126422 markings, 644631892 edges, 35014 markings/sec, 1160 secs
lola: 67326066 markings, 647260913 edges, 39929 markings/sec, 1165 secs
lola: 67513804 markings, 649836300 edges, 37548 markings/sec, 1170 secs
lola: 67730791 markings, 652648049 edges, 43397 markings/sec, 1175 secs
lola: 67926137 markings, 655375981 edges, 39069 markings/sec, 1180 secs
lola: 68054101 markings, 657809736 edges, 25593 markings/sec, 1185 secs
lola: 68054242 markings, 660298660 edges, 28 markings/sec, 1190 secs
lola: 68054343 markings, 662889360 edges, 20 markings/sec, 1195 secs
lola: 68054422 markings, 665470472 edges, 16 markings/sec, 1200 secs
lola: 68054498 markings, 667961181 edges, 15 markings/sec, 1205 secs
lola: 68054600 markings, 670429456 edges, 20 markings/sec, 1210 secs
lola: 68178827 markings, 673194415 edges, 24845 markings/sec, 1215 secs
lola: 68178926 markings, 675703961 edges, 20 markings/sec, 1220 secs
lola: 68179108 markings, 678216305 edges, 36 markings/sec, 1225 secs
lola: 68179164 markings, 680768656 edges, 11 markings/sec, 1230 secs
lola: 68179253 markings, 683320173 edges, 18 markings/sec, 1235 secs
lola: 68179330 markings, 685905216 edges, 15 markings/sec, 1240 secs
lola: 68179353 markings, 688471601 edges, 5 markings/sec, 1245 secs
lola: 68179414 markings, 691010960 edges, 12 markings/sec, 1250 secs
lola: 68179455 markings, 693514869 edges, 8 markings/sec, 1255 secs
lola: 68179466 markings, 695970407 edges, 2 markings/sec, 1260 secs
lola: 68179484 markings, 698402536 edges, 4 markings/sec, 1265 secs
lola: 68179520 markings, 700847680 edges, 7 markings/sec, 1270 secs
lola: 68179539 markings, 703286623 edges, 4 markings/sec, 1275 secs
lola: 68179588 markings, 705697488 edges, 10 markings/sec, 1280 secs
lola: 68179652 markings, 708120776 edges, 13 markings/sec, 1285 secs
lola: 68179662 markings, 710559737 edges, 2 markings/sec, 1290 secs
lola: 68179721 markings, 712988213 edges, 12 markings/sec, 1295 secs
lola: 68179755 markings, 715425029 edges, 7 markings/sec, 1300 secs
lola: 68179801 markings, 717862561 edges, 9 markings/sec, 1305 secs
lola: 68179856 markings, 720316591 edges, 11 markings/sec, 1310 secs
lola: 68179874 markings, 722771103 edges, 4 markings/sec, 1315 secs
lola: 68179898 markings, 725234808 edges, 5 markings/sec, 1320 secs
lola: 68179932 markings, 727708171 edges, 7 markings/sec, 1325 secs
lola: 68179943 markings, 730193400 edges, 2 markings/sec, 1330 secs
lola: 68179957 markings, 732699123 edges, 3 markings/sec, 1335 secs
lola: 68179960 markings, 735233610 edges, 1 markings/sec, 1340 secs
lola: 68179964 markings, 737813211 edges, 1 markings/sec, 1345 secs
lola: 68179966 markings, 740512492 edges, 0 markings/sec, 1350 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 68179969 markings, 741921121 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (F (E (G (((p10 <= 0) OR (p107 <= 0)))))) OR ((((1 <= p35) AND (1 <= p93)) OR ((1 <= p41) AND (1 <= p110))) AND (((1 <= p14) AND (1 <= p53)) OR ((1 <= p100) AND (1 <= p131)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((((1 <= p35) AND (1 <= p93)) OR ((1 <= p41) AND (1 <= p110))) AND (((1 <= p14) AND (1 <= p53)) OR ((1 <= p100) AND (1 <= p131))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((((1 <= p35) AND (1 <= p93)) OR ((1 <= p41) AND (1 <= p110))) AND (((1 <= p14) AND (1 <= p53)) OR ((1 <= p100) AND (1 <= p131))))
lola: processed formula length: 132
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 8 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((p10 <= 0) OR (p107 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG(((p10 <= 0) OR (p107 <= 0))))
lola: processed formula length: 36
lola: 38 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 21 markings, 21 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes no no yes yes yes yes no no no yes no no yes
lola:
preliminary result: yes yes yes no no yes yes yes yes no no no yes no no yes
lola: memory consumption: 47920 KB
lola: time consumption: 1617 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="AutoFlight-PT-05a"
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 AutoFlight-PT-05a, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r166-smll-158987787700436"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-05a.tgz
mv AutoFlight-PT-05a 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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;