Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r194-csrt-159033389600196.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is Solitaire-PT-SqrNC5x5, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-csrt-159033389600196
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 2.9K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 9 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 66K Apr 27 15:14 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 Solitaire-PT-SqrNC5x5-CTLFireability-00
FORMULA_NAME Solitaire-PT-SqrNC5x5-CTLFireability-01
FORMULA_NAME Solitaire-PT-SqrNC5x5-CTLFireability-02
FORMULA_NAME Solitaire-PT-SqrNC5x5-CTLFireability-03
FORMULA_NAME Solitaire-PT-SqrNC5x5-CTLFireability-04
FORMULA_NAME Solitaire-PT-SqrNC5x5-CTLFireability-05
FORMULA_NAME Solitaire-PT-SqrNC5x5-CTLFireability-06
FORMULA_NAME Solitaire-PT-SqrNC5x5-CTLFireability-07
FORMULA_NAME Solitaire-PT-SqrNC5x5-CTLFireability-08
FORMULA_NAME Solitaire-PT-SqrNC5x5-CTLFireability-09
FORMULA_NAME Solitaire-PT-SqrNC5x5-CTLFireability-10
FORMULA_NAME Solitaire-PT-SqrNC5x5-CTLFireability-11
FORMULA_NAME Solitaire-PT-SqrNC5x5-CTLFireability-12
FORMULA_NAME Solitaire-PT-SqrNC5x5-CTLFireability-13
FORMULA_NAME Solitaire-PT-SqrNC5x5-CTLFireability-14
FORMULA_NAME Solitaire-PT-SqrNC5x5-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591206734587

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 17:52:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 17:52:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 17:52:16] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2020-06-03 17:52:16] [INFO ] Transformed 50 places.
[2020-06-03 17:52:16] [INFO ] Transformed 84 transitions.
[2020-06-03 17:52:16] [INFO ] Parsed PT model containing 50 places and 84 transitions in 106 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Incomplete random walk after 100000 steps, including 4521 resets, run finished after 292 ms. (steps per millisecond=342 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 84 rows 50 cols
[2020-06-03 17:52:17] [INFO ] Computed 25 place invariants in 4 ms
[2020-06-03 17:52:17] [INFO ] [Real]Absence check using 25 positive place invariants in 18 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-03 17:52:17] [INFO ] Flatten gal took : 61 ms
[2020-06-03 17:52:17] [INFO ] Flatten gal took : 15 ms
[2020-06-03 17:52:17] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2020-06-03 17:52:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ Solitaire-PT-SqrNC5x5 @ 3570 seconds

FORMULA Solitaire-PT-SqrNC5x5-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Solitaire-PT-SqrNC5x5-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Solitaire-PT-SqrNC5x5-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Solitaire-PT-SqrNC5x5-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Solitaire-PT-SqrNC5x5-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Solitaire-PT-SqrNC5x5-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Solitaire-PT-SqrNC5x5-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Solitaire-PT-SqrNC5x5-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Solitaire-PT-SqrNC5x5-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Solitaire-PT-SqrNC5x5-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Solitaire-PT-SqrNC5x5-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Solitaire-PT-SqrNC5x5-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Solitaire-PT-SqrNC5x5-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Solitaire-PT-SqrNC5x5-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Solitaire-PT-SqrNC5x5-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Solitaire-PT-SqrNC5x5-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2828
rslt: Output for CTLFireability @ Solitaire-PT-SqrNC5x5

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 17:52:17 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 223
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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": "((p2 <= 0) OR (p9 <= 0) OR (p37 <= 0) OR (p18 <= 0) OR (p25 <= 0) OR (p28 <= 0))",
"processed_size": 85,
"rewrites": 38
},
"result":
{
"edges": 25,
"markings": 26,
"produced_by": "state space /EXEG",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 24
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 6
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 257
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 13,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "EF(((((1 <= p12) AND (1 <= p21) AND (1 <= p26)) OR ((1 <= p0) AND (1 <= p8)) OR ((1 <= p25) AND (1 <= p44) AND (1 <= p18) AND (1 <= p21) AND (1 <= p27))) AND AX(((1 <= p22) AND (1 <= p28) AND (1 <= p41)))))",
"processed_size": 208,
"rewrites": 38
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 213958152,
"markings": 16098428,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 239
},
"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 (((p0 <= 0) OR (p6 <= 0) OR (p11 <= 0))))",
"processed_size": 48,
"rewrites": 37
},
"result":
{
"edges": 26,
"markings": 27,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 18
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 259
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p19 <= 0) OR (p26 <= 0) OR (p43 <= 0))",
"processed_size": 42,
"rewrites": 39
},
"result":
{
"edges": 26,
"markings": 27,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 16
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 283
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p0 <= 0) OR (p9 <= 0) OR (p22 <= 0))",
"processed_size": 40,
"rewrites": 40
},
"result":
{
"edges": 23,
"markings": 24,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 13
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 311
},
"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 (((p23 <= 0) OR (p30 <= 0) OR (p32 <= 0))))",
"processed_size": 50,
"rewrites": 37
},
"result":
{
"edges": 26,
"markings": 27,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 26
},
"threads": 1,
"type": "dfs"
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 346
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p19 <= 0) OR (p26 <= 0) OR (p43 <= 0))",
"processed_size": 42,
"rewrites": 39
},
"result":
{
"edges": 26,
"markings": 27,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 16
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 389
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "((p0 <= 0) OR (p5 <= 0) OR (p7 <= 0) OR (p18 <= 0) OR (p21 <= 0) OR (p27 <= 0))",
"processed_size": 84,
"rewrites": 39
},
"result":
{
"edges": 26,
"markings": 27,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 34
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "((p2 <= 0) OR (p7 <= 0) OR (p31 <= 0) OR (p5 <= 0) OR (p33 <= 0) OR (p36 <= 0) OR (p17 <= 0) OR (p23 <= 0))",
"processed_size": 114,
"rewrites": 40
},
"result":
{
"edges": 23,
"markings": 24,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 23
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 519
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 3,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "(((p33 <= 0) OR (p36 <= 0) OR (p39 <= 0) OR (p9 <= 0) OR (p14 <= 0) OR (p20 <= 0)) AND ((p24 <= 0) OR (p28 <= 0) OR (p35 <= 0)) AND ((p15 <= 0) OR (p21 <= 0)))",
"processed_size": 167,
"rewrites": 39
},
"result":
{
"edges": 26,
"markings": 27,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 60
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 623
},
"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": "((p11 <= 0) OR (p15 <= 0))",
"processed_size": 27,
"rewrites": 36
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 778
},
"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 (((p2 <= 0) OR (p7 <= 0) OR (p31 <= 0))))",
"processed_size": 48,
"rewrites": 37
},
"result":
{
"edges": 28,
"markings": 29,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 24
},
"threads": 1,
"type": "dfs"
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 778
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"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": "((p19 <= 0) OR (p24 <= 0) OR ((1 <= p41) AND (1 <= p42) AND (1 <= p44)))",
"processed_size": 74,
"rewrites": 36
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1038
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": "((p0 <= 0) OR (p9 <= 0))",
"processed_size": 25,
"rewrites": 39
},
"result":
{
"edges": 24,
"markings": 25,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1038
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (G (((p19 <= 0) OR (p27 <= 0) OR (p42 <= 0))))",
"processed_size": 50,
"rewrites": 37
},
"result":
{
"edges": 26,
"markings": 27,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 16
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1557
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p23) AND (1 <= p30) AND (1 <= p32))",
"processed_size": 42,
"rewrites": 36
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3115
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "((p10 <= 0) OR (p14 <= 0) OR (p17 <= 0) OR (p24 <= 0) OR ((1 <= p19) AND (1 <= p25) AND (1 <= p29)))",
"processed_size": 104,
"rewrites": 36
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 0,
"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": "E ((((1 <= p19) AND (1 <= p25)) U ((1 <= p1) AND (1 <= p11) AND (1 <= p12))))",
"processed_size": 77,
"rewrites": 39
},
"result":
{
"edges": 59,
"markings": 51,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 12
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3115
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "E (F (((p13 <= 0) OR (p21 <= 0) OR (p27 <= 0) OR (p0 <= 0) OR (p11 <= 0))))",
"processed_size": 79,
"rewrites": 37
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 5
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p9 <= 0) OR (p23 <= 0) OR (p29 <= 0))",
"processed_size": 41,
"rewrites": 39
},
"result":
{
"edges": 26,
"markings": 27,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 14
},
"threads": 1,
"type": "dfs"
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "EG(EX(((p23 <= 0) OR (p30 <= 0) OR (p32 <= 0) OR (p1 <= 0) OR (p4 <= 0) OR (p7 <= 0))))",
"processed_size": 92,
"rewrites": 38
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 213958152,
"markings": 16098428,
"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": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p23) AND (1 <= p30) AND (1 <= p32))",
"processed_size": 42,
"rewrites": 36
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 17,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "((p10 <= 0) OR (p14 <= 0) OR (p17 <= 0) OR (p24 <= 0) OR ((1 <= p19) AND (1 <= p25) AND (1 <= p29)))",
"processed_size": 104,
"rewrites": 36
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 18,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p19) AND (1 <= p25))",
"processed_size": 27,
"rewrites": 39
},
"result":
{
"edges": 36437330,
"markings": 3495670,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 16
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 0,
"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": "E ((((1 <= p19) AND (1 <= p25)) U ((1 <= p1) AND (1 <= p11) AND (1 <= p12))))",
"processed_size": 77,
"rewrites": 39
},
"result":
{
"edges": 59,
"markings": 51,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 20,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 12
},
"threads": 1,
"type": "dfs"
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 37620,
"runtime": 742.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(E(F(E(G(*)))) AND **) : A(F(*)) : (E(G(*)) OR E(G(**))) : (E(G(*)) AND **) : A(G(A(F(**)))) : E(G(E(X(*)))) : A(F(**)) : A(G(A(F(**)))) : E(X(E(G(**)))) : E(G(*)) : A(F(**)) : (E(F((** AND A(X(**))))) AND **) : E(G(*)) : A(F(**)) : (E(G(E(F(*)))) OR (E(F(*)) AND E(G(E(F(**)))))) : (A(F(*)) AND (** OR (E((** U **)) AND **)))"
},
"net":
{
"arcs": 456,
"conflict_clusters": 1,
"places": 50,
"places_significant": 25,
"singleton_clusters": 0,
"transitions": 84
},
"result":
{
"preliminary_value": "yes no yes yes no no no no yes yes no no yes no yes yes ",
"value": "yes no yes yes no no no no yes yes no no yes no yes 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: 134/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1600
lola: finding significant places
lola: 50 places, 84 transitions, 25 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: (E (F (NOT(A (F (((1 <= p0) AND (1 <= p9))))))) AND ((p19 <= 0) OR (p24 <= 0) OR ((1 <= p41) AND (1 <= p42) AND (1 <= p44)))) : NOT(E (G ((((p33 <= 0) OR (p36 <= 0) OR (p39 <= 0) OR (p9 <= 0) OR (p14 <= 0) OR (p20 <= 0)) AND ((p24 <= 0) OR (p28 <= 0) OR (p35 <= 0)) AND ((p15 <= 0) OR (p21 <= 0)))))) : (NOT(A (F ((((1 <= p0) AND (1 <= p11) AND (1 <= p13) AND (1 <= p32) AND (1 <= p38) AND (1 <= p49)) OR ((1 <= p35) AND (1 <= p38) AND (1 <= p23) AND (1 <= p28) AND (1 <= p40)))))) OR E (G (((p19 <= 0) OR (p27 <= 0) OR (p42 <= 0))))) : (NOT(A (F (((1 <= p2) AND (1 <= p7) AND (1 <= p31))))) AND ((p11 <= 0) OR (p15 <= 0))) : A (G (A (F (((1 <= p2) AND (1 <= p7) AND (1 <= p31) AND (1 <= p5) AND (1 <= p33) AND (1 <= p36) AND (1 <= p17) AND (1 <= p23)))))) : NOT(A (F (A (X (((1 <= p23) AND (1 <= p30) AND (1 <= p32) AND (1 <= p1) AND (1 <= p4) AND (1 <= p7))))))) : E (((1 <= 0) U A (F (((1 <= p0) AND (1 <= p5) AND (1 <= p7) AND (1 <= p18) AND (1 <= p21) AND (1 <= p27)))))) : A (G (A (F (((1 <= p0) AND (1 <= p9) AND (1 <= p22)))))) : E (X (E (G (((p2 <= 0) OR (p9 <= 0) OR (p37 <= 0) OR (p18 <= 0) OR (p25 <= 0) OR (p28 <= 0)))))) : NOT(A (F (((1 <= p0) AND (1 <= p6) AND (1 <= p11))))) : A (F (((1 <= p19) AND (1 <= p26) AND (1 <= p43)))) : (E (F (((((1 <= p12) AND (1 <= p21) AND (1 <= p26)) OR ((1 <= p0) AND (1 <= p8)) OR ((1 <= p25) AND (1 <= p44) AND (1 <= p18) AND (1 <= p21) AND (1 <= p27))) AND A (X (((1 <= p22) AND (1 <= p28) AND (1 <= p41))))))) AND ((p23 <= 0) OR (p30 <= 0) OR (p32 <= 0))) : NOT(A (F (((1 <= p23) AND (1 <= p30) AND (1 <= p32))))) : A (F (((1 <= p19) AND (1 <= p26) AND (1 <= p43)))) : (NOT(A (F (A (G (((1 <= p9) AND (1 <= p23) AND (1 <= p29))))))) OR (NOT(A (G (((1 <= p13) AND (1 <= p21) AND (1 <= p27) AND (1 <= p0) AND (1 <= p11))))) AND E (G (E (F (((1 <= p17) AND (1 <= p27)))))))) : (NOT(E (G (((1 <= p19) AND (1 <= p25))))) AND (((1 <= p23) AND (1 <= p30) AND (1 <= p32)) OR (E ((((1 <= p19) AND (1 <= p25)) U ((1 <= p1) AND (1 <= p11) AND (1 <= p12)))) AND ((p10 <= 0) OR (p14 <= 0) OR (p17 <= 0) OR (p24 <= 0) OR ((1 <= p19) AND (1 <= p25) AND (1 <= p29))))))
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: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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:183
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:329
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (X (((p23 <= 0) OR (p30 <= 0) OR (p32 <= 0) OR (p1 <= 0) OR (p4 <= 0) OR (p7 <= 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(((p23 <= 0) OR (p30 <= 0) OR (p32 <= 0) OR (p1 <= 0) OR (p4 <= 0) OR (p7 <= 0))))
lola: processed formula length: 92
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: 749243 markings, 5937205 edges, 149849 markings/sec, 0 secs
lola: 1352788 markings, 11720302 edges, 120709 markings/sec, 5 secs
lola: 1901085 markings, 17521382 edges, 109659 markings/sec, 10 secs
lola: 2451274 markings, 22932228 edges, 110038 markings/sec, 15 secs
lola: 3028234 markings, 28777202 edges, 115392 markings/sec, 20 secs
lola: 3516122 markings, 34262447 edges, 97578 markings/sec, 25 secs
lola: 3980668 markings, 39741604 edges, 92909 markings/sec, 30 secs
lola: 4427904 markings, 45115153 edges, 89447 markings/sec, 35 secs
lola: 4878753 markings, 50540407 edges, 90170 markings/sec, 40 secs
lola: 5298499 markings, 55630814 edges, 83949 markings/sec, 45 secs
lola: 5661533 markings, 60318943 edges, 72607 markings/sec, 50 secs
lola: 6083875 markings, 65623282 edges, 84468 markings/sec, 55 secs
lola: 6571456 markings, 71274727 edges, 97516 markings/sec, 60 secs
lola: 6978729 markings, 76629108 edges, 81455 markings/sec, 65 secs
lola: 7362912 markings, 81779343 edges, 76837 markings/sec, 70 secs
lola: 7738449 markings, 86860290 edges, 75107 markings/sec, 75 secs
lola: 8100777 markings, 91909652 edges, 72466 markings/sec, 80 secs
lola: 8450186 markings, 96897214 edges, 69882 markings/sec, 85 secs
lola: 8831976 markings, 101931386 edges, 76358 markings/sec, 90 secs
lola: 9164884 markings, 106668677 edges, 66582 markings/sec, 95 secs
lola: 9489449 markings, 111315373 edges, 64913 markings/sec, 100 secs
lola: 9809759 markings, 115953173 edges, 64062 markings/sec, 105 secs
lola: 10106625 markings, 120334351 edges, 59373 markings/sec, 110 secs
lola: 10415288 markings, 124788071 edges, 61733 markings/sec, 115 secs
lola: 10707799 markings, 129144401 edges, 58502 markings/sec, 120 secs
lola: 10995026 markings, 133463004 edges, 57445 markings/sec, 125 secs
lola: 11297324 markings, 137800391 edges, 60460 markings/sec, 130 secs
lola: 11575154 markings, 142079808 edges, 55566 markings/sec, 135 secs
lola: 11843852 markings, 146327529 edges, 53740 markings/sec, 140 secs
lola: 12162123 markings, 150873705 edges, 63654 markings/sec, 145 secs
lola: 12489276 markings, 155376163 edges, 65431 markings/sec, 150 secs
lola: 12770056 markings, 159680421 edges, 56156 markings/sec, 155 secs
lola: 13036624 markings, 163803223 edges, 53314 markings/sec, 160 secs
lola: 13290078 markings, 167901809 edges, 50691 markings/sec, 165 secs
lola: 13536185 markings, 171882330 edges, 49221 markings/sec, 170 secs
lola: 13810809 markings, 176125942 edges, 54925 markings/sec, 175 secs
lola: 14068505 markings, 180167146 edges, 51539 markings/sec, 180 secs
lola: 14325353 markings, 184351255 edges, 51370 markings/sec, 185 secs
lola: 14560758 markings, 188275442 edges, 47081 markings/sec, 190 secs
lola: 14810312 markings, 192408737 edges, 49911 markings/sec, 195 secs
lola: 15040391 markings, 196311473 edges, 46016 markings/sec, 200 secs
lola: 15296452 markings, 200335274 edges, 51212 markings/sec, 205 secs
lola: 15566594 markings, 204715323 edges, 54028 markings/sec, 210 secs
lola: 15806981 markings, 208874541 edges, 48077 markings/sec, 215 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 2255252 KB
lola: time consumption: 225 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 1 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (G (((p2 <= 0) OR (p9 <= 0) OR (p37 <= 0) OR (p18 <= 0) OR (p25 <= 0) OR (p28 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: rewrite Frontend/Parser/formula_rewrite.k:715
lola: processed formula: ((p2 <= 0) OR (p9 <= 0) OR (p37 <= 0) OR (p18 <= 0) OR (p25 <= 0) OR (p28 <= 0))
lola: processed formula length: 85
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 /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based 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: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p2 <= 0) OR (p9 <= 0) OR (p37 <= 0) OR (p18 <= 0) OR (p25 <= 0) OR (p28 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEG
lola: The predicate is possibly preserved from some successor.
lola: 26 markings, 25 edges
lola: ========================================
lola: subprocess 2 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((((1 <= p12) AND (1 <= p21) AND (1 <= p26)) OR ((1 <= p0) AND (1 <= p8)) OR ((1 <= p25) AND (1 <= p44) AND (1 <= p18) AND (1 <= p21) AND (1 <= p27))) AND A (X (((1 <= p22) AND (1 <= p28) AND (1 <= p41))))))) AND ((p23 <= 0) OR (p30 <= 0) OR (p32 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p23 <= 0) OR (p30 <= 0) OR (p32 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p23 <= 0) OR (p30 <= 0) OR (p32 <= 0))
lola: processed formula length: 42
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 257 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((((1 <= p12) AND (1 <= p21) AND (1 <= p26)) OR ((1 <= p0) AND (1 <= p8)) OR ((1 <= p25) AND (1 <= p44) AND (1 <= p18) AND (1 <= p21) AND (1 <= p27))) AND A (X (((1 <= p22) AND (1 <= p28) AND (1 <= p41)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(((((1 <= p12) AND (1 <= p21) AND (1 <= p26)) OR ((1 <= p0) AND (1 <= p8)) OR ((1 <= p25) AND (1 <= p44) AND (1 <= p18) AND (1 <= p21) AND (1 <= p27))) AND AX(((1 <= p22) AND (1 <= p28) AND (1 <= p41)))))
lola: processed formula length: 208
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: 727847 markings, 5752708 edges, 145569 markings/sec, 0 secs
lola: 1299519 markings, 11156698 edges, 114334 markings/sec, 5 secs
lola: 1805240 markings, 16559661 edges, 101144 markings/sec, 10 secs
lola: 2416566 markings, 22576307 edges, 122265 markings/sec, 15 secs
lola: 2936695 markings, 27796199 edges, 104026 markings/sec, 20 secs
lola: 3381156 markings, 32695473 edges, 88892 markings/sec, 25 secs
lola: 3792393 markings, 37507135 edges, 82247 markings/sec, 30 secs
lola: 4180720 markings, 42175073 edges, 77665 markings/sec, 35 secs
lola: 4559944 markings, 46747978 edges, 75845 markings/sec, 40 secs
lola: 4940490 markings, 51336307 edges, 76109 markings/sec, 45 secs
lola: 5326490 markings, 55989361 edges, 77200 markings/sec, 50 secs
lola: 5711639 markings, 60988523 edges, 77030 markings/sec, 55 secs
lola: 6133086 markings, 66112242 edges, 84289 markings/sec, 60 secs
lola: 6574113 markings, 71310939 edges, 88205 markings/sec, 65 secs
lola: 6960866 markings, 76371397 edges, 77351 markings/sec, 70 secs
lola: 7307936 markings, 81082577 edges, 69414 markings/sec, 75 secs
lola: 7663084 markings, 85828342 edges, 71030 markings/sec, 80 secs
lola: 7993085 markings, 90417405 edges, 66000 markings/sec, 85 secs
lola: 8319038 markings, 95139237 edges, 65191 markings/sec, 90 secs
lola: 8690667 markings, 100031364 edges, 74326 markings/sec, 95 secs
lola: 9042773 markings, 104880592 edges, 70421 markings/sec, 100 secs
lola: 9377458 markings, 109680788 edges, 66937 markings/sec, 105 secs
lola: 9703789 markings, 114413591 edges, 65266 markings/sec, 110 secs
lola: 10041905 markings, 119371557 edges, 67623 markings/sec, 115 secs
lola: 10359481 markings, 123966552 edges, 63515 markings/sec, 120 secs
lola: 10661525 markings, 128461083 edges, 60409 markings/sec, 125 secs
lola: 10962916 markings, 132966917 edges, 60278 markings/sec, 130 secs
lola: 11278574 markings, 137522392 edges, 63132 markings/sec, 135 secs
lola: 11565310 markings, 141926309 edges, 57347 markings/sec, 140 secs
lola: 11843115 markings, 146314412 edges, 55561 markings/sec, 145 secs
lola: 12163529 markings, 150895955 edges, 64083 markings/sec, 150 secs
lola: 12517757 markings, 155792982 edges, 70846 markings/sec, 155 secs
lola: 12806929 markings, 160224540 edges, 57834 markings/sec, 160 secs
lola: 13078690 markings, 164475932 edges, 54352 markings/sec, 165 secs
lola: 13338790 markings, 168666780 edges, 52020 markings/sec, 170 secs
lola: 13601041 markings, 172842190 edges, 52450 markings/sec, 175 secs
lola: 13879111 markings, 177132562 edges, 55614 markings/sec, 180 secs
lola: 14129846 markings, 181203956 edges, 50147 markings/sec, 185 secs
lola: 14375015 markings, 185177553 edges, 49034 markings/sec, 190 secs
lola: 14609714 markings, 189085252 edges, 46940 markings/sec, 195 secs
lola: 14859149 markings, 193216605 edges, 49887 markings/sec, 200 secs
lola: 15096208 markings, 197252720 edges, 47412 markings/sec, 205 secs
lola: 15385527 markings, 201713146 edges, 57864 markings/sec, 210 secs
lola: 15650140 markings, 206138838 edges, 52923 markings/sec, 215 secs
lola: 15901006 markings, 210472746 edges, 50173 markings/sec, 220 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 16098428 markings, 213958152 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 239 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p0 <= 0) OR (p6 <= 0) OR (p11 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p0 <= 0) OR (p6 <= 0) OR (p11 <= 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 <= p0) AND (1 <= p6) AND (1 <= p11))
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: 27 markings, 26 edges
lola: ========================================
lola: subprocess 4 will run for 259 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p19) AND (1 <= p26) AND (1 <= p43))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p19 <= 0) OR (p26 <= 0) OR (p43 <= 0))
lola: processed formula length: 42
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: formula 0: ((1 <= p19) AND (1 <= p26) AND (1 <= p43))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-4-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 27 markings, 26 edges
lola: ========================================
lola: subprocess 5 will run for 283 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((1 <= p0) AND (1 <= p9) AND (1 <= p22))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p0 <= 0) OR (p9 <= 0) OR (p22 <= 0))
lola: processed formula length: 40
lola: 40 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 /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p0) AND (1 <= p9) AND (1 <= p22))
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: SUBRESULT
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 24 markings, 23 edges
lola: ========================================
lola: subprocess 6 will run for 311 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p23 <= 0) OR (p30 <= 0) OR (p32 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p23 <= 0) OR (p30 <= 0) OR (p32 <= 0))))
lola: processed formula length: 50
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: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 27 markings, 26 edges
lola: ========================================
lola: subprocess 7 will run for 346 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p19) AND (1 <= p26) AND (1 <= p43))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p19 <= 0) OR (p26 <= 0) OR (p43 <= 0))
lola: processed formula length: 42
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: formula 0: ((1 <= p19) AND (1 <= p26) AND (1 <= p43))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 27 markings, 26 edges
lola: ========================================
lola: subprocess 8 will run for 389 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p0) AND (1 <= p5) AND (1 <= p7) AND (1 <= p18) AND (1 <= p21) AND (1 <= p27))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p0 <= 0) OR (p5 <= 0) OR (p7 <= 0) OR (p18 <= 0) OR (p21 <= 0) OR (p27 <= 0))
lola: processed formula length: 84
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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 27 markings, 26 edges
lola: ========================================
lola: subprocess 9 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((1 <= p2) AND (1 <= p7) AND (1 <= p31) AND (1 <= p5) AND (1 <= p33) AND (1 <= p36) AND (1 <= p17) AND (1 <= p23))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p2 <= 0) OR (p7 <= 0) OR (p31 <= 0) OR (p5 <= 0) OR (p33 <= 0) OR (p36 <= 0) OR (p17 <= 0) OR (p23 <= 0))
lola: processed formula length: 114
lola: 40 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 /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 24 markings, 23 edges
lola: ========================================
lola: subprocess 10 will run for 519 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p33) AND (1 <= p36) AND (1 <= p39) AND (1 <= p9) AND (1 <= p14) AND (1 <= p20)) OR ((1 <= p24) AND (1 <= p28) AND (1 <= p35)) OR ((1 <= p15) AND (1 <= p21)))))
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: (((p33 <= 0) OR (p36 <= 0) OR (p39 <= 0) OR (p9 <= 0) OR (p14 <= 0) OR (p20 <= 0)) AND ((p24 <= 0) OR (p28 <= 0) OR (p35 <= 0)) AND ((p15 <= 0) OR (p21 <= 0)))
lola: processed formula length: 167
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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 27 markings, 26 edges
lola: ========================================
lola: subprocess 11 will run for 623 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (((p2 <= 0) OR (p7 <= 0) OR (p31 <= 0)))) AND ((p11 <= 0) OR (p15 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 623 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p11 <= 0) OR (p15 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p11 <= 0) OR (p15 <= 0))
lola: processed formula length: 27
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 12 will run for 778 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p2 <= 0) OR (p7 <= 0) OR (p31 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p2 <= 0) OR (p7 <= 0) OR (p31 <= 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: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 29 markings, 28 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 778 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (E (G (((p0 <= 0) OR (p9 <= 0)))))) AND ((p19 <= 0) OR (p24 <= 0) OR ((1 <= p41) AND (1 <= p42) AND (1 <= p44))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 778 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p19 <= 0) OR (p24 <= 0) OR ((1 <= p41) AND (1 <= p42) AND (1 <= p44)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p19 <= 0) OR (p24 <= 0) OR ((1 <= p41) AND (1 <= p42) AND (1 <= p44)))
lola: processed formula length: 74
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 5 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1038 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (((p0 <= 0) OR (p9 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:598
lola: rewrite Frontend/Parser/formula_rewrite.k:633
lola: rewrite Frontend/Parser/formula_rewrite.k:730
lola: processed formula: ((p0 <= 0) OR (p9 <= 0))
lola: processed formula length: 25
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 /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: The predicate is possibly preserved from a reachable marking.
lola: 25 markings, 24 edges
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p0 <= 0) OR (p9 <= 0))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p0) AND (1 <= p9))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-13-1.sara
lola: state equation: write sara problem file to CTLFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-13-0.sara.
sara: place or transition ordering is non-deterministic

lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 1038 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((((p0 <= 0) OR (p11 <= 0) OR (p13 <= 0) OR (p32 <= 0) OR (p38 <= 0) OR (p49 <= 0)) AND ((p35 <= 0) OR (p38 <= 0) OR (p23 <= 0) OR (p28 <= 0) OR (p40 <= 0))))) OR E (G (((p19 <= 0) OR (p27 <= 0) OR (p42 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1038 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p19 <= 0) OR (p27 <= 0) OR (p42 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p19 <= 0) OR (p27 <= 0) OR (p42 <= 0))))
lola: processed formula length: 50
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: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p19) AND (1 <= p27) AND (1 <= p42))
lola: state equation task get result unparse finished id 0
lola: 27 markings, 26 edges
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 14 will run for 1557 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((p19 <= 0) OR (p25 <= 0)))) AND (((1 <= p23) AND (1 <= p30) AND (1 <= p32)) OR (E ((((1 <= p19) AND (1 <= p25)) U ((1 <= p1) AND (1 <= p11) AND (1 <= p12)))) AND ((p10 <= 0) OR (p14 <= 0) OR (p17 <= 0) OR (p24 <= 0) OR ((1 <= p19) AND (1 <= p25) AND (1 <= p29))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1557 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p23) AND (1 <= p30) AND (1 <= p32))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p23) AND (1 <= p30) AND (1 <= p32))
lola: processed formula length: 42
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3115 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p10 <= 0) OR (p14 <= 0) OR (p17 <= 0) OR (p24 <= 0) OR ((1 <= p19) AND (1 <= p25) AND (1 <= p29)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p10 <= 0) OR (p14 <= 0) OR (p17 <= 0) OR (p24 <= 0) OR ((1 <= p19) AND (1 <= p25) AND (1 <= p29)))
lola: processed formula length: 104
lola: 36 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: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((1 <= p19) AND (1 <= p25)) U ((1 <= p1) AND (1 <= p11) AND (1 <= p12))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((((1 <= p19) AND (1 <= p25)) U ((1 <= p1) AND (1 <= p11) AND (1 <= p12))))
lola: processed formula length: 77
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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
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 <= p1) AND (1 <= p11) AND (1 <= p12))
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 /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 51 markings, 59 edges
lola: state equation: write sara problem file to CTLFireability-17-0.sara
lola: ========================================
lola: state equation: calling and running saralola:
SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
sara: try reading problem file CTLFireability-17-0.sara.
sara: place or transition ordering is non-deterministic

lola: subprocess 15 will run for 3115 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (E (F (((p9 <= 0) OR (p23 <= 0) OR (p29 <= 0)))))) OR (E (F (((p13 <= 0) OR (p21 <= 0) OR (p27 <= 0) OR (p0 <= 0) OR (p11 <= 0)))) AND E (G (E (F (((1 <= p17) AND (1 <= p27))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3115 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p13 <= 0) OR (p21 <= 0) OR (p27 <= 0) OR (p0 <= 0) OR (p11 <= 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 (((p13 <= 0) OR (p21 <= 0) OR (p27 <= 0) OR (p0 <= 0) OR (p11 <= 0))))
lola: processed formula length: 79
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p13 <= 0) OR (p21 <= 0) OR (p27 <= 0) OR (p0 <= 0) OR (p11 <= 0))
lola: 0 markings, 0 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-15-0.sara.
sara: place or transition ordering is non-deterministic

lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((p9 <= 0) OR (p23 <= 0) OR (p29 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:593
lola: rewrite Frontend/Parser/formula_rewrite.k:628
lola: rewrite Frontend/Parser/formula_rewrite.k:731
lola: processed formula: ((p9 <= 0) OR (p23 <= 0) OR (p29 <= 0))
lola: processed formula length: 41
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 /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 27 markings, 26 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G (E (X (((p23 <= 0) OR (p30 <= 0) OR (p32 <= 0) OR (p1 <= 0) OR (p4 <= 0) OR (p7 <= 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(((p23 <= 0) OR (p30 <= 0) OR (p32 <= 0) OR (p1 <= 0) OR (p4 <= 0) OR (p7 <= 0))))
lola: processed formula length: 92
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: 701930 markings, 5538694 edges, 140386 markings/sec, 0 secs
lola: 1255676 markings, 10720643 edges, 110749 markings/sec, 5 secs
lola: 1709241 markings, 15500211 edges, 90713 markings/sec, 10 secs
lola: 2181516 markings, 20328063 edges, 94455 markings/sec, 15 secs
lola: 2701972 markings, 25290130 edges, 104091 markings/sec, 20 secs
lola: 3140654 markings, 30027363 edges, 87736 markings/sec, 25 secs
lola: 3551295 markings, 34676970 edges, 82128 markings/sec, 30 secs
lola: 3940991 markings, 39278616 edges, 77939 markings/sec, 35 secs
lola: 4349407 markings, 44152086 edges, 81683 markings/sec, 40 secs
lola: 4752817 markings, 49013128 edges, 80682 markings/sec, 45 secs
lola: 5131195 markings, 53546690 edges, 75676 markings/sec, 50 secs
lola: 5498662 markings, 58144582 edges, 73493 markings/sec, 55 secs
lola: 5828110 markings, 62416216 edges, 65890 markings/sec, 60 secs
lola: 6236481 markings, 67255294 edges, 81674 markings/sec, 65 secs
lola: 6636654 markings, 72130075 edges, 80035 markings/sec, 70 secs
lola: 6996009 markings, 76856338 edges, 71871 markings/sec, 75 secs
lola: 7360197 markings, 81742808 edges, 72838 markings/sec, 80 secs
lola: 7715065 markings, 86540013 edges, 70974 markings/sec, 85 secs
lola: 8032342 markings, 90974566 edges, 63455 markings/sec, 90 secs
lola: 8341078 markings, 95438808 edges, 61747 markings/sec, 95 secs
lola: 8697080 markings, 100120920 edges, 71200 markings/sec, 100 secs
lola: 9018959 markings, 104539605 edges, 64376 markings/sec, 105 secs
lola: 9331022 markings, 109006186 edges, 62413 markings/sec, 110 secs
lola: 9643436 markings, 113521108 edges, 62483 markings/sec, 115 secs
lola: 9953691 markings, 118038877 edges, 62051 markings/sec, 120 secs
lola: 10257729 markings, 122483861 edges, 60808 markings/sec, 125 secs
lola: 10548316 markings, 126783011 edges, 58117 markings/sec, 130 secs
lola: 10835923 markings, 131072393 edges, 57521 markings/sec, 135 secs
lola: 11143962 markings, 135553866 edges, 61608 markings/sec, 140 secs
lola: 11451870 markings, 140169764 edges, 61582 markings/sec, 145 secs
lola: 11728689 markings, 144503717 edges, 55364 markings/sec, 150 secs
lola: 12025100 markings, 148893329 edges, 59282 markings/sec, 155 secs
lola: 12351279 markings, 153482518 edges, 65236 markings/sec, 160 secs
lola: 12663242 markings, 158013069 edges, 62393 markings/sec, 165 secs
lola: 12943819 markings, 162349594 edges, 56115 markings/sec, 170 secs
lola: 13209427 markings, 166578244 edges, 53122 markings/sec, 175 secs
lola: 13463857 markings, 170699206 edges, 50886 markings/sec, 180 secs
lola: 13738424 markings, 174989774 edges, 54913 markings/sec, 185 secs
lola: 14022265 markings, 179411036 edges, 56768 markings/sec, 190 secs
lola: 14275514 markings, 183515577 edges, 50650 markings/sec, 195 secs
lola: 14518997 markings, 187565395 edges, 48697 markings/sec, 200 secs
lola: 14773332 markings, 191795930 edges, 50867 markings/sec, 205 secs
lola: 15028629 markings, 196110167 edges, 51059 markings/sec, 210 secs
lola: 15293474 markings, 200293064 edges, 52969 markings/sec, 215 secs
lola: 15577115 markings, 204886495 edges, 56728 markings/sec, 220 secs
lola: 15832006 markings, 209286681 edges, 50978 markings/sec, 225 secs
lola: 16065541 markings, 213373745 edges, 46707 markings/sec, 230 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 16098428 markings, 213958152 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (F (((p19 <= 0) OR (p25 <= 0)))) AND (((1 <= p23) AND (1 <= p30) AND (1 <= p32)) OR (E ((((1 <= p19) AND (1 <= p25)) U ((1 <= p1) AND (1 <= p11) AND (1 <= p12)))) AND ((p10 <= 0) OR (p14 <= 0) OR (p17 <= 0) OR (p24 <= 0) OR ((1 <= p19) AND (1 <= p25) AND (1 <= p29))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p23) AND (1 <= p30) AND (1 <= p32))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p23) AND (1 <= p30) AND (1 <= p32))
lola: processed formula length: 42
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((p10 <= 0) OR (p14 <= 0) OR (p17 <= 0) OR (p24 <= 0) OR ((1 <= p19) AND (1 <= p25) AND (1 <= p29)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p10 <= 0) OR (p14 <= 0) OR (p17 <= 0) OR (p24 <= 0) OR ((1 <= p19) AND (1 <= p25) AND (1 <= p29)))
lola: processed formula length: 104
lola: 36 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: ========================================
lola: ...considering subproblem: A (F (((p19 <= 0) OR (p25 <= 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 <= p19) AND (1 <= p25))
lola: processed formula length: 27
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: formula 0: ((p19 <= 0) OR (p25 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-19-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-19-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: 435869 markings, 3391926 edges, 87174 markings/sec, 0 secs || sara is running 0 secs
lola: 853124 markings, 7067142 edges, 83451 markings/sec, 5 secs || sara is running 5 secs
lola: 1232847 markings, 10601474 edges, 75945 markings/sec, 10 secs || sara is running 10 secs
lola: 1586519 markings, 14215542 edges, 70734 markings/sec, 15 secs || sara is running 15 secs
lola: 1925265 markings, 17783935 edges, 67749 markings/sec, 20 secs || sara is running 20 secs
lola: 2250971 markings, 21501204 edges, 65141 markings/sec, 25 secs || sara is running 25 secs
lola: 2555528 markings, 25075887 edges, 60911 markings/sec, 30 secs || sara is running 30 secs
lola: 2855971 markings, 28558012 edges, 60089 markings/sec, 35 secs || sara is running 35 secs
lola: 3153315 markings, 32142491 edges, 59469 markings/sec, 40 secs || sara is running 40 secs
lola: 3437808 markings, 35663467 edges, 56899 markings/sec, 45 secs || sara is running 45 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 3495670 markings, 36437330 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E ((((1 <= p19) AND (1 <= p25)) U ((1 <= p1) AND (1 <= p11) AND (1 <= p12))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((((1 <= p19) AND (1 <= p25)) U ((1 <= p1) AND (1 <= p11) AND (1 <= p12))))
lola: processed formula length: 77
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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 51 markings, 59 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes yes no no no no yes yes no no yes no yes yes
lola:
preliminary result: yes no yes yes no no no no yes yes no no yes no yes yes
lola: memory consumption: 37620 KB
lola: time consumption: 742 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="Solitaire-PT-SqrNC5x5"
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 Solitaire-PT-SqrNC5x5, 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 r194-csrt-159033389600196"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Solitaire-PT-SqrNC5x5.tgz
mv Solitaire-PT-SqrNC5x5 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 ;