Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2019-input.r137-smll-155284909500131.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-3957
Executing tool lola
Input is Referendum-COL-0010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r137-smll-155284909500131
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 168K
-rw-r--r-- 1 mcc users 3.3K Feb 12 12:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 12 12:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 8 14:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 8 14:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 106 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 344 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.3K Feb 5 01:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.1K Feb 5 01:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.5K Feb 4 22:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 4 14:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 4 14:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 1 11:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 1 11:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 4 22:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:35 equiv_pt
-rw-r--r-- 1 mcc users 5 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:35 iscolored
-rw-r--r-- 1 mcc users 3.5K Mar 10 17:31 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1552965855391

info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ Referendum-COL-0010 @ 3570 seconds

FORMULA Referendum-COL-0010-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-COL-0010-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-COL-0010-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-COL-0010-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-COL-0010-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-COL-0010-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-COL-0010-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-COL-0010-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-COL-0010-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-COL-0010-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-COL-0010-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-COL-0010-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-COL-0010-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-COL-0010-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-COL-0010-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-COL-0010-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3564
rslt: Output for CTLFireability @ Referendum-COL-0010

{
"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": "mcc2019",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue Mar 19 03:24:15 2019
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 10,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 10,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 10
},
"processed": "EX(AF((NOT FIREABLE(t0) AND NOT FIREABLE(t1) AND NOT FIREABLE(t2) AND NOT FIREABLE(t3) AND NOT FIREABLE(t4) AND NOT FIREABLE(t5) AND NOT FIREABLE(t6) AND NOT FIREABLE(t7) AND NOT FIREABLE(t8) AND NOT FIREABLE(t9))))",
"processed_size": 215,
"rewrites": 43
},
"net":
{
"conflict_clusters": 31,
"singleton_clusters": 0
},
"result":
{
"edges": 393660,
"markings": 59049,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 10,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 10,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 10
},
"processed": "(FIREABLE(t10) OR FIREABLE(t11) OR FIREABLE(t12) OR FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19))",
"processed_size": 177,
"rewrites": 43
},
"result":
{
"edges": 383420,
"markings": 58025,
"produced_by": "state space /EXEG",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 20
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 10
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "NOT FIREABLE(t20)",
"processed_size": 17,
"rewrites": 41
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 10,
"unfir": 10,
"visible_places": 0,
"visible_transitions": 10
},
"processed": "AX(EF((NOT FIREABLE(t0) AND NOT FIREABLE(t1) AND NOT FIREABLE(t2) AND NOT FIREABLE(t3) AND NOT FIREABLE(t4) AND NOT FIREABLE(t5) AND NOT FIREABLE(t6) AND NOT FIREABLE(t7) AND NOT FIREABLE(t8) AND NOT FIREABLE(t9))))",
"processed_size": 215,
"rewrites": 43
},
"net":
{
"conflict_clusters": 31,
"singleton_clusters": 0
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "CTL model checker",
"value": true
},
"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": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 11,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 11,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 11
},
"processed": "AF(EX((NOT FIREABLE(t10) AND NOT FIREABLE(t11) AND NOT FIREABLE(t12) AND NOT FIREABLE(t13) AND NOT FIREABLE(t14) AND NOT FIREABLE(t15) AND NOT FIREABLE(t16) AND NOT FIREABLE(t17) AND NOT FIREABLE(t18) AND NOT FIREABLE(t19) AND NOT FIREABLE(t20))))",
"processed_size": 247,
"rewrites": 43
},
"net":
{
"conflict_clusters": 31,
"singleton_clusters": 0
},
"result":
{
"edges": 383421,
"markings": 58026,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 10,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 10,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 10
},
"processed": "(FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9))",
"processed_size": 167,
"rewrites": 41
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 10,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 10,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 10
},
"processed": "A (G ((FIREABLE(t10) OR FIREABLE(t11) OR FIREABLE(t12) OR FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19))))",
"processed_size": 185,
"rewrites": 43
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 11,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 11,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 11
},
"processed": "E (((FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9)) U FIREABLE(t20)))",
"processed_size": 189,
"rewrites": 44
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 20
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 10,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 10,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 10
},
"processed": "EG(EX((FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9))))",
"processed_size": 175,
"rewrites": 43
},
"net":
{
"conflict_clusters": 31,
"singleton_clusters": 0
},
"result":
{
"edges": 383421,
"markings": 58026,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 10,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 10,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 10
},
"processed": "(NOT FIREABLE(t0) AND NOT FIREABLE(t1) AND NOT FIREABLE(t2) AND NOT FIREABLE(t3) AND NOT FIREABLE(t4) AND NOT FIREABLE(t5) AND NOT FIREABLE(t6) AND NOT FIREABLE(t7) AND NOT FIREABLE(t8) AND NOT FIREABLE(t9))",
"processed_size": 207,
"rewrites": 44
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space /EXEF",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 1
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "NOT FIREABLE(t20)",
"processed_size": 17,
"rewrites": 45
},
"result":
{
"edges": 393661,
"markings": 59050,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 11,
"unfir": 11,
"visible_places": 0,
"visible_transitions": 11
},
"processed": "(NOT FIREABLE(t20) OR (NOT FIREABLE(t0) AND NOT FIREABLE(t1) AND NOT FIREABLE(t2) AND NOT FIREABLE(t3) AND NOT FIREABLE(t4) AND NOT FIREABLE(t5) AND NOT FIREABLE(t6) AND NOT FIREABLE(t7) AND NOT FIREABLE(t8) AND NOT FIREABLE(t9)))",
"processed_size": 231,
"rewrites": 44
},
"result":
{
"produced_by": "state equation",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 11,
"problems": 2
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 20,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 20,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 20
},
"processed": "(FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9) OR FIREABLE(t10) OR FIREABLE(t11) OR FIREABLE(t12) OR FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19))",
"processed_size": 347,
"rewrites": 45
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "parallel",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 20,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 31,
"unfir": 11,
"visible_places": 0,
"visible_transitions": 11
},
"processed": "EG((AF((FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9))) OR (NOT FIREABLE(t0) AND NOT FIREABLE(t1) AND NOT FIREABLE(t2) AND NOT FIREABLE(t3) AND NOT FIREABLE(t4) AND NOT FIREABLE(t5) AND NOT FIREABLE(t6) AND NOT FIREABLE(t7) AND NOT FIREABLE(t8) AND NOT FIREABLE(t9) AND (FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9)) AND NOT FIREABLE(t20))))",
"processed_size": 582,
"rewrites": 43
},
"net":
{
"conflict_clusters": 31,
"singleton_clusters": 0
},
"result":
{
"edges": 452712,
"markings": 59050,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 3,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 20,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 30,
"unfir": 10,
"visible_places": 0,
"visible_transitions": 20
},
"processed": "EG(AF(((NOT FIREABLE(t0) AND NOT FIREABLE(t1) AND NOT FIREABLE(t2) AND NOT FIREABLE(t3) AND NOT FIREABLE(t4) AND NOT FIREABLE(t5) AND NOT FIREABLE(t6) AND NOT FIREABLE(t7) AND NOT FIREABLE(t8) AND NOT FIREABLE(t9)) OR ((FIREABLE(t10) OR FIREABLE(t11) OR FIREABLE(t12) OR FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19)) AND (FIREABLE(t10) OR FIREABLE(t11) OR FIREABLE(t12) OR FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19))))))",
"processed_size": 583,
"rewrites": 43
},
"net":
{
"conflict_clusters": 31,
"singleton_clusters": 0
},
"result":
{
"edges": 23,
"markings": 12,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 11,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 21,
"unfir": 10,
"visible_places": 0,
"visible_transitions": 21
},
"processed": "AF((AG(((FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9)) AND FIREABLE(t20))) AND EG((NOT FIREABLE(t10) AND NOT FIREABLE(t11) AND NOT FIREABLE(t12) AND NOT FIREABLE(t13) AND NOT FIREABLE(t14) AND NOT FIREABLE(t15) AND NOT FIREABLE(t16) AND NOT FIREABLE(t17) AND NOT FIREABLE(t18) AND NOT FIREABLE(t19)))))",
"processed_size": 423,
"rewrites": 44
},
"net":
{
"conflict_clusters": 31,
"singleton_clusters": 0
},
"result":
{
"edges": 23,
"markings": 12,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 4,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 32,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 44,
"unfir": 12,
"visible_places": 0,
"visible_transitions": 21
},
"processed": "(FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9) OR (NOT FIREABLE(t20) AND (FIREABLE(t10) OR FIREABLE(t11) OR FIREABLE(t12) OR FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19))) OR FIREABLE(t20) OR ((FIREABLE(t10) OR FIREABLE(t11) OR FIREABLE(t12) OR FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19) OR FIREABLE(t20)) AND (NOT FIREABLE(t20) OR (NOT FIREABLE(t10) AND NOT FIREABLE(t11) AND NOT FIREABLE(t12) AND NOT FIREABLE(t13) AND NOT FIREABLE(t14) AND NOT FIREABLE(t15) AND NOT FIREABLE(t16) AND NOT FIREABLE(t17) AND NOT FIREABLE(t18) AND NOT FIREABLE(t19)))))",
"processed_size": 839,
"rewrites": 41
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 11,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 11,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 11
},
"processed": "A (G (((NOT FIREABLE(t0) AND NOT FIREABLE(t1) AND NOT FIREABLE(t2) AND NOT FIREABLE(t3) AND NOT FIREABLE(t4) AND NOT FIREABLE(t5) AND NOT FIREABLE(t6) AND NOT FIREABLE(t7) AND NOT FIREABLE(t8) AND NOT FIREABLE(t9)) OR NOT FIREABLE(t20))))",
"processed_size": 239,
"rewrites": 43
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 20,
"problems": 10
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "FIREABLE(t20)",
"processed_size": 13,
"rewrites": 41
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "NOT FIREABLE(t20)",
"processed_size": 17,
"rewrites": 44
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 0
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 10,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 10,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 10
},
"processed": "(FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9))",
"processed_size": 167,
"rewrites": 41
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3564
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 11,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 11,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 11
},
"processed": "G ((FIREABLE(t20) U (FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9))))",
"processed_size": 189,
"rewrites": 43
},
"result":
{
"edges": 15,
"markings": 15,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "universal single path",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3564
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "NOT FIREABLE(t20)",
"processed_size": 17,
"rewrites": 44
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "NOT FIREABLE(t20)",
"processed_size": 17,
"rewrites": 44
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 20,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 30,
"unfir": 10,
"visible_places": 0,
"visible_transitions": 10
},
"processed": "A (((NOT FIREABLE(t10) AND NOT FIREABLE(t11) AND NOT FIREABLE(t12) AND NOT FIREABLE(t13) AND NOT FIREABLE(t14) AND NOT FIREABLE(t15) AND NOT FIREABLE(t16) AND NOT FIREABLE(t17) AND NOT FIREABLE(t18) AND NOT FIREABLE(t19)) U ((FIREABLE(t10) OR FIREABLE(t11) OR FIREABLE(t12) OR FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19)) AND (FIREABLE(t10) OR FIREABLE(t11) OR FIREABLE(t12) OR FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19)))))",
"processed_size": 587,
"rewrites": 46
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 21
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 1
},
"type": "universal_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 11,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 11,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 11
},
"processed": "E (F ((NOT FIREABLE(t0) AND NOT FIREABLE(t1) AND NOT FIREABLE(t2) AND NOT FIREABLE(t3) AND NOT FIREABLE(t4) AND NOT FIREABLE(t5) AND NOT FIREABLE(t6) AND NOT FIREABLE(t7) AND NOT FIREABLE(t8) AND NOT FIREABLE(t9) AND NOT FIREABLE(t20))))",
"processed_size": 237,
"rewrites": 42
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 11,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 69656,
"runtime": 6.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(F((A(G(**)) AND E(G(**))))) : (** AND A(G(*))) : A(G(E(F(**)))) : (A(G(**)) OR E(X(A(F(*))))) : E(X(E(G(**)))) : E(G((A(F(**)) OR **))) : (** OR A(X(E(F(**))))) : A(F(E(X(*)))) : ((A(G(**)) AND (A(G(**)) OR A(G(**)))) OR (E(G(E(X(**)))) AND (E((** U **)) OR **))) : ((* OR E(F(*))) AND (A((** U **)) AND ((A(F(**)) AND A(F(**))) OR A(F(**))))) : E(G(A(F(**)))) : A(X(A(G(**)))) : (** OR A(G(A((** U **))))) : E(F(A(G(**)))) : E(F(A(G(*)))) : (E(G(E(F(*)))) AND **)"
},
"net":
{
"arcs": 51,
"conflict_clusters": 31,
"places": 31,
"places_significant": 21,
"singleton_clusters": 0,
"transitions": 21
},
"result":
{
"preliminary_value": "no yes yes yes no no yes yes no yes yes no no no yes yes ",
"value": "no yes yes yes no no yes yes no yes yes no no 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 High-Level net
lola: Places: 31, Transitions: 21
lola: @ trans yes
lola: @ trans no
lola: @ trans start
lola: finished unfolding
lola: finished parsing
lola: closed net file model.pnml
lola: 52/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 31
lola: finding significant places
lola: 31 places, 21 transitions, 21 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: A (F ((A (G (((FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9)) AND FIREABLE(t20)))) AND E (G ((NOT FIREABLE(t10) AND NOT FIREABLE(t11) AND NOT FIREABLE(t12) AND NOT FIREABLE(t13) AND NOT FIREABLE(t14) AND NOT FIREABLE(t15) AND NOT FIREABLE(t16) AND NOT FIREABLE(t17) AND NOT FIREABLE(t18) AND NOT FIREABLE(t19))))))) : ((FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9) OR (NOT FIREABLE(t20) AND (FIREABLE(t10) OR FIREABLE(t11) OR FIREABLE(t12) OR FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19))) OR FIREABLE(t20) OR ((FIREABLE(t10) OR FIREABLE(t11) OR FIREABLE(t12) OR FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19) OR FIREABLE(t20)) AND (NOT FIREABLE(t20) OR (NOT FIREABLE(t10) AND NOT FIREABLE(t11) AND NOT FIREABLE(t12) AND NOT FIREABLE(t13) AND NOT FIREABLE(t14) AND NOT FIREABLE(t15) AND NOT FIREABLE(t16) AND NOT FIREABLE(t17) AND NOT FIREABLE(t18) AND NOT FIREABLE(t19))))) AND NOT(E (F (((FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9)) AND FIREABLE(t20)))))) : A (G (E (F ((NOT FIREABLE(t20) OR (NOT FIREABLE(t0) AND NOT FIREABLE(t1) AND NOT FIREABLE(t2) AND NOT FIREABLE(t3) AND NOT FIREABLE(t4) AND NOT FIREABLE(t5) AND NOT FIREABLE(t6) AND NOT FIREABLE(t7) AND NOT FIREABLE(t8) AND NOT FIREABLE(t9))))))) : (A (G (FIREABLE(t20))) OR NOT(A (X (E (G ((FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9)))))))) : E (X (E (G (E (G ((FIREABLE(t10) OR FIREABLE(t11) OR FIREABLE(t12) OR FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19)))))))) : E (G ((A (F ((FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9)))) OR (NOT FIREABLE(t0) AND NOT FIREABLE(t1) AND NOT FIREABLE(t2) AND NOT FIREABLE(t3) AND NOT FIREABLE(t4) AND NOT FIREABLE(t5) AND NOT FIREABLE(t6) AND NOT FIREABLE(t7) AND NOT FIREABLE(t8) AND NOT FIREABLE(t9) AND (FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9)) AND NOT FIREABLE(t20))))) : (NOT FIREABLE(t20) OR A (X (E (F ((NOT FIREABLE(t0) AND NOT FIREABLE(t1) AND NOT FIREABLE(t2) AND NOT FIREABLE(t3) AND NOT FIREABLE(t4) AND NOT FIREABLE(t5) AND NOT FIREABLE(t6) AND NOT FIREABLE(t7) AND NOT FIREABLE(t8) AND NOT FIREABLE(t9))))))) : NOT(E (G (A (X ((FIREABLE(t10) OR FIREABLE(t11) OR FIREABLE(t12) OR FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19) OR FIREABLE(t20))))))) : ((A (G (A (G ((FIREABLE(t10) OR FIREABLE(t11) OR FIREABLE(t12) OR FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19)))))) AND (A (G (FIREABLE(t20))) OR A (G ((FIREABLE(t10) OR FIREABLE(t11) OR FIREABLE(t12) OR FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19)))))) OR (E (G (E (X ((FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9)))))) AND (E (((FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9)) U FIREABLE(t20))) OR (FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9))))) : (NOT(((FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9) OR (NOT FIREABLE(t0) AND NOT FIREABLE(t1) AND NOT FIREABLE(t2) AND NOT FIREABLE(t3) AND NOT FIREABLE(t4) AND NOT FIREABLE(t5) AND NOT FIREABLE(t6) AND NOT FIREABLE(t7) AND NOT FIREABLE(t8) AND NOT FIREABLE(t9)) OR (NOT FIREABLE(t10) AND NOT FIREABLE(t11) AND NOT FIREABLE(t12) AND NOT FIREABLE(t13) AND NOT FIREABLE(t14) AND NOT FIREABLE(t15) AND NOT FIREABLE(t16) AND NOT FIREABLE(t17) AND NOT FIREABLE(t18) AND NOT FIREABLE(t19))) AND A (G ((FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9) OR FIREABLE(t20)))))) AND (A (((NOT FIREABLE(t10) AND NOT FIREABLE(t11) AND NOT FIREABLE(t12) AND NOT FIREABLE(t13) AND NOT FIREABLE(t14) AND NOT FIREABLE(t15) AND NOT FIREABLE(t16) AND NOT FIREABLE(t17) AND NOT FIREABLE(t18) AND NOT FIREABLE(t19)) U ((FIREABLE(t10) OR FIREABLE(t11) OR FIREABLE(t12) OR FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19)) AND (FIREABLE(t10) OR FIREABLE(t11) OR FIREABLE(t12) OR FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19))))) AND ((A (F (FIREABLE(t20))) AND A (F (FIREABLE(t20)))) OR A (F ((FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9) OR FIREABLE(t20))))))) : E (G (A (F (((NOT FIREABLE(t0) AND NOT FIREABLE(t1) AND NOT FIREABLE(t2) AND NOT FIREABLE(t3) AND NOT FIREABLE(t4) AND NOT FIREABLE(t5) AND NOT FIREABLE(t6) AND NOT FIREABLE(t7) AND NOT FIREABLE(t8) AND NOT FIREABLE(t9)) OR ((FIREABLE(t10) OR FIREABLE(t11) OR FIREABLE(t12) OR FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19)) AND (FIREABLE(t10) OR FIREABLE(t11) OR FIREABLE(t12) OR FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19)))))))) : NOT(NOT(A (X (A (G ((FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9)))))))) : ((FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9)) OR A (G (A ((FIREABLE(t20) U (FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9))))))) : E (F (E (G (A (G (FIREABLE(t20))))))) : NOT(A (G (E (F ((FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9) OR FIREABLE(t10) OR FIREABLE(t11) OR FIREABLE(t12) OR FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19))))))) : (NOT(A (F (A (G (FIREABLE(t20)))))) AND FIREABLE(t20))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:461
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:389
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:476
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
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: (A (G (FIREABLE(t20))) OR E (X (A (F ((NOT FIREABLE(t0) AND NOT FIREABLE(t1) AND NOT FIREABLE(t2) AND NOT FIREABLE(t3) AND NOT FIREABLE(t4) AND NOT FIREABLE(t5) AND NOT FIREABLE(t6) AND NOT FIREABLE(t7) AND NOT FIREABLE(t8) AND NOT FIREABLE(t9)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(t20)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (FIREABLE(t20)))
lola: processed formula length: 21
lola: 43 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: NOT FIREABLE(t20)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (F ((NOT FIREABLE(t0) AND NOT FIREABLE(t1) AND NOT FIREABLE(t2) AND NOT FIREABLE(t3) AND NOT FIREABLE(t4) AND NOT FIREABLE(t5) AND NOT FIREABLE(t6) AND NOT FIREABLE(t7) AND NOT FIREABLE(t8) AND NOT FIREABLE(t9))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AF((NOT FIREABLE(t0) AND NOT FIREABLE(t1) AND NOT FIREABLE(t2) AND NOT FIREABLE(t3) AND NOT FIREABLE(t4) AND NOT FIREABLE(t5) AND NOT FIREABLE(t6) AND NOT FIREABLE(t7) AND NOT FIREABLE(t8) AND NOT FIREABLE(t9))))
lola: processed formula length: 215
lola: 43 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 59049 markings, 393660 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (G ((FIREABLE(t10) OR FIREABLE(t11) OR FIREABLE(t12) OR FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19))))))
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: (FIREABLE(t10) OR FIREABLE(t11) OR FIREABLE(t12) OR FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19))
lola: processed formula length: 177
lola: 43 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: (FIREABLE(t10) OR FIREABLE(t11) OR FIREABLE(t12) OR FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 10 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.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: The predicate is not possibly preserved from any successor.
lola: 58025 markings, 383420 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(t20) OR A (X (E (F ((NOT FIREABLE(t0) AND NOT FIREABLE(t1) AND NOT FIREABLE(t2) AND NOT FIREABLE(t3) AND NOT FIREABLE(t4) AND NOT FIREABLE(t5) AND NOT FIREABLE(t6) AND NOT FIREABLE(t7) AND NOT FIREABLE(t8) AND NOT FIREABLE(t9)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(t20)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(t20)
lola: processed formula length: 17
lola: 41 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((NOT FIREABLE(t0) AND NOT FIREABLE(t1) AND NOT FIREABLE(t2) AND NOT FIREABLE(t3) AND NOT FIREABLE(t4) AND NOT FIREABLE(t5) AND NOT FIREABLE(t6) AND NOT FIREABLE(t7) AND NOT FIREABLE(t8) AND NOT FIREABLE(t9))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF((NOT FIREABLE(t0) AND NOT FIREABLE(t1) AND NOT FIREABLE(t2) AND NOT FIREABLE(t3) AND NOT FIREABLE(t4) AND NOT FIREABLE(t5) AND NOT FIREABLE(t6) AND NOT FIREABLE(t7) AND NOT FIREABLE(t8) AND NOT FIREABLE(t9))))
lola: processed formula length: 215
lola: 43 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 11 markings, 10 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (X ((NOT FIREABLE(t10) AND NOT FIREABLE(t11) AND NOT FIREABLE(t12) AND NOT FIREABLE(t13) AND NOT FIREABLE(t14) AND NOT FIREABLE(t15) AND NOT FIREABLE(t16) AND NOT FIREABLE(t17) AND NOT FIREABLE(t18) AND NOT FIREABLE(t19) AND NOT FIREABLE(t20))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EX((NOT FIREABLE(t10) AND NOT FIREABLE(t11) AND NOT FIREABLE(t12) AND NOT FIREABLE(t13) AND NOT FIREABLE(t14) AND NOT FIREABLE(t15) AND NOT FIREABLE(t16) AND NOT FIREABLE(t17) AND NOT FIREABLE(t18) AND NOT FIREABLE(t19) AND NOT FIREABLE(t20))))
lola: processed formula length: 247
lola: 43 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 58026 markings, 383421 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (G ((FIREABLE(t10) OR FIREABLE(t11) OR FIREABLE(t12) OR FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19)))) AND (A (G (FIREABLE(t20))) OR A (G ((FIREABLE(t10) OR FIREABLE(t11) OR FIREABLE(t12) OR FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(t20)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (FIREABLE(t20)))
lola: processed formula length: 21
lola: 43 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: NOT FIREABLE(t20)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: state equation: write sara problem file to CTLFireability-4-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9))
lola: processed formula length: 167
lola: 41 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 0 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: ========================================
sara: try reading problem file CTLFireability-4-0.sara.
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t10) OR FIREABLE(t11) OR FIREABLE(t12) OR FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((FIREABLE(t10) OR FIREABLE(t11) OR FIREABLE(t12) OR FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19))))
lola: processed formula length: 185
lola: 43 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
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9)) U FIREABLE(t20)))
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 (((FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9)) U FIREABLE(t20)))
lola: processed formula length: 189
lola: 44 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: FIREABLE(t20)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (X ((FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9))))))
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((FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9))))
lola: processed formula length: 175
lola: 43 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 58026 markings, 383421 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:624
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (NOT FIREABLE(t0) AND NOT FIREABLE(t1) AND NOT FIREABLE(t2) AND NOT FIREABLE(t3) AND NOT FIREABLE(t4) AND NOT FIREABLE(t5) AND NOT FIREABLE(t6) AND NOT FIREABLE(t7) AND NOT FIREABLE(t8) AND NOT FIREABLE(t9))
lola: processed formula length: 207
lola: 44 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 /EXEF)
lola: state space: using reachability graph (EXef 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: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (NOT FIREABLE(t0) AND NOT FIREABLE(t1) AND NOT FIREABLE(t2) AND NOT FIREABLE(t3) AND NOT FIREABLE(t4) AND NOT FIREABLE(t5) AND NOT FIREABLE(t6) AND NOT FIREABLE(t7) AND NOT FIREABLE(t8) AND NOT FIREABLE(t9))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (FIREABLE(t20)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: NOT FIREABLE(t20)
lola: processed formula length: 17
lola: 45 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
lola: using tscc preserving stubborn set method (--stubborn)
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: FIREABLE(t20)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: NOT FIREABLE(t20)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-6-0.sara
lola: state equation: write sara problem file to CTLFireability-6-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-6-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara

sara: try reading problem file CTLFireability-6-1.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 59050 markings, 393661 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((NOT FIREABLE(t20) OR (NOT FIREABLE(t0) AND NOT FIREABLE(t1) AND NOT FIREABLE(t2) AND NOT FIREABLE(t3) AND NOT FIREABLE(t4) AND NOT FIREABLE(t5) AND NOT FIREABLE(t6) AND NOT FIREABLE(t7) AND NOT FIREABLE(t8) AND NOT FIREABLE(t9)))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (NOT FIREABLE(t20) OR (NOT FIREABLE(t0) AND NOT FIREABLE(t1) AND NOT FIREABLE(t2) AND NOT FIREABLE(t3) AND NOT FIREABLE(t4) AND NOT FIREABLE(t5) AND NOT FIREABLE(t6) AND NOT FIREABLE(t7) AND NOT FIREABLE(t8) AND NOT FIREABLE(t9)))
lola: processed formula length: 231
lola: 44 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
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FIREABLE(t20) AND (FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9)))
lola: formula 1: (NOT FIREABLE(t20) OR (NOT FIREABLE(t0) AND NOT FIREABLE(t1) AND NOT FIREABLE(t2) AND NOT FIREABLE(t3) AND NOT FIREABLE(t4) AND NOT FIREABLE(t5) AND NOT FIREABLE(t6) AND NOT FIREABLE(t7) AND NOT FIREABLE(t8) AND NOT FIREABLE(t9)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 20 literals and 10 conjunctive subformulas
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 11 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-7-1.sara
lola: state equation: write sara problem file to CTLFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-7-1.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara

sara: try reading problem file CTLFireability-7-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 1: solution produced
lola: state equation: solution impossible
lola: SUBRESULT
lola: Quick check says:
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((NOT FIREABLE(t0) AND NOT FIREABLE(t1) AND NOT FIREABLE(t2) AND NOT FIREABLE(t3) AND NOT FIREABLE(t4) AND NOT FIREABLE(t5) AND NOT FIREABLE(t6) AND NOT FIREABLE(t7) AND NOT FIREABLE(t8) AND NOT FIREABLE(t9) AND NOT FIREABLE(t10) AND NOT FIREABLE(t11) AND NOT FIREABLE(t12) AND NOT FIREABLE(t13) AND NOT FIREABLE(t14) AND NOT FIREABLE(t15) AND NOT FIREABLE(t16) AND NOT FIREABLE(t17) AND N... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9) OR FIREABLE(t10) OR FIREABLE(t11) OR FIREABLE(t12) OR FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19))
lola: processed formula length: 347
lola: 45 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
lola: using tscc preserving stubborn set method (--stubborn)
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: SUBRESULT
lola: result: yes
lola: produced by: parallel
lola: The predicate is possibly invariant.
lola: 12 markings, 11 edges
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((A (F ((FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9)))) OR (NOT FIREABLE(t0) AND NOT FIREABLE(t1) AND NOT FIREABLE(t2) AND NOT FIREABLE(t3) AND NOT FIREABLE(t4) AND NOT FIREABLE(t5) AND NOT FIREABLE(t6) AND NOT FIREABLE(t7) AND NOT FIREABLE(t8) AND NOT FIREABLE(t9) AND (FI... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((AF((FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9))) OR (NOT FIREABLE(t0) AND NOT FIREABLE(t1) AND NOT FIREABLE(t2) AND NOT FIREABLE(t3) AND NOT FIREABLE(t4) AND NOT FIREABLE(t5) AND NOT FIREABLE(t6) AND NOT FIREABLE(t7) AND NOT FIREABLE(t8) AND NOT FIREABLE(t9) AND (FIREABLE(... (shortened)
lola: processed formula length: 582
lola: 43 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 59050 markings, 452712 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (((NOT FIREABLE(t0) AND NOT FIREABLE(t1) AND NOT FIREABLE(t2) AND NOT FIREABLE(t3) AND NOT FIREABLE(t4) AND NOT FIREABLE(t5) AND NOT FIREABLE(t6) AND NOT FIREABLE(t7) AND NOT FIREABLE(t8) AND NOT FIREABLE(t9)) OR ((FIREABLE(t10) OR FIREABLE(t11) OR FIREABLE(t12) OR FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AF(((NOT FIREABLE(t0) AND NOT FIREABLE(t1) AND NOT FIREABLE(t2) AND NOT FIREABLE(t3) AND NOT FIREABLE(t4) AND NOT FIREABLE(t5) AND NOT FIREABLE(t6) AND NOT FIREABLE(t7) AND NOT FIREABLE(t8) AND NOT FIREABLE(t9)) OR ((FIREABLE(t10) OR FIREABLE(t11) OR FIREABLE(t12) OR FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19)) AN... (shortened)
lola: processed formula length: 583
lola: 43 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 12 markings, 23 edges
lola: ========================================
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G (((FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9)) AND FIREABLE(t20)))) AND E (G ((NOT FIREABLE(t10) AND NOT FIREABLE(t11) AND NOT FIREABLE(t12) AND NOT FIREABLE(t13) AND NOT FIREABLE(t14) AND NOT FIREABLE(t15) AND NOT FIREABLE(t16) AND NOT FIREABLE(t17) AND NOT FIREAB... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((AG(((FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9)) AND FIREABLE(t20))) AND EG((NOT FIREABLE(t10) AND NOT FIREABLE(t11) AND NOT FIREABLE(t12) AND NOT FIREABLE(t13) AND NOT FIREABLE(t14) AND NOT FIREABLE(t15) AND NOT FIREABLE(t16) AND NOT FIREABLE(t17) AND NOT FIREABLE(t18) AN... (shortened)
lola: processed formula length: 423
lola: 44 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 12 markings, 23 edges
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9) OR (NOT FIREABLE(t20) AND (FIREABLE(t10) OR FIREABLE(t11) OR FIREABLE(t12) OR FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19))) OR FIREABLE(t20) OR ((FI... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9) OR (NOT FIREABLE(t20) AND (FIREABLE(t10) OR FIREABLE(t11) OR FIREABLE(t12) OR FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19))) OR FIREABLE(t20) OR ((FIR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9) OR (NOT FIREABLE(t20) AND (FIREABLE(t10) OR FIREABLE(t11) OR FIREABLE(t12) OR FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19))) OR FIREABLE(t20) OR ((FIR... (shortened)
lola: processed formula length: 839
lola: 41 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t0) AND NOT FIREABLE(t1) AND NOT FIREABLE(t2) AND NOT FIREABLE(t3) AND NOT FIREABLE(t4) AND NOT FIREABLE(t5) AND NOT FIREABLE(t6) AND NOT FIREABLE(t7) AND NOT FIREABLE(t8) AND NOT FIREABLE(t9)) OR NOT FIREABLE(t20))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G (((NOT FIREABLE(t0) AND NOT FIREABLE(t1) AND NOT FIREABLE(t2) AND NOT FIREABLE(t3) AND NOT FIREABLE(t4) AND NOT FIREABLE(t5) AND NOT FIREABLE(t6) AND NOT FIREABLE(t7) AND NOT FIREABLE(t8) AND NOT FIREABLE(t9)) OR NOT FIREABLE(t20))))
lola: processed formula length: 239
lola: 43 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9)) AND FIREABLE(t20))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 20 literals and 10 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (E (F (NOT FIREABLE(t20))))) AND FIREABLE(t20))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t20)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t20)
lola: processed formula length: 13
lola: 41 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (NOT FIREABLE(t20)))))
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: NOT FIREABLE(t20)
lola: processed formula length: 17
lola: 44 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: FIREABLE(t20)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: NOT FIREABLE(t20)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: Reachability of the predicate is possibly preserved.
lola: 12 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9)) OR A (G (A ((FIREABLE(t20) U (FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9))
lola: processed formula length: 167
lola: 41 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 0 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 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A ((FIREABLE(t20) U (FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9))))))
lola: ========================================
lola: SUBTASK
lola: checking a universal CTL formula with single counterexample path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((FIREABLE(t20) U (FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9))))
lola: processed formula length: 189
lola: 43 rewrites
lola: closed formula file CTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The universal single path CTL formula does not hold.
lola: 15 markings, 15 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((NOT FIREABLE(t0) AND NOT FIREABLE(t1) AND NOT FIREABLE(t2) AND NOT FIREABLE(t3) AND NOT FIREABLE(t4) AND NOT FIREABLE(t5) AND NOT FIREABLE(t6) AND NOT FIREABLE(t7) AND NOT FIREABLE(t8) AND NOT FIREABLE(t9) AND (FIREABLE(t0) OR FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9)) AND (FIREABLE(t10) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t20)))
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: NOT FIREABLE(t20)
lola: processed formula length: 17
lola: 44 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 eventually occurs.
lola: 1 markings, 0 edges
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: FIREABLE(t20)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
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: A (F (FIREABLE(t20)))
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: NOT FIREABLE(t20)
lola: processed formula length: 17
lola: 44 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: FIREABLE(t20)
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 18 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((NOT FIREABLE(t10) AND NOT FIREABLE(t11) AND NOT FIREABLE(t12) AND NOT FIREABLE(t13) AND NOT FIREABLE(t14) AND NOT FIREABLE(t15) AND NOT FIREABLE(t16) AND NOT FIREABLE(t17) AND NOT FIREABLE(t18) AND NOT FIREABLE(t19)) U ((FIREABLE(t10) OR FIREABLE(t11) OR FIREABLE(t12) OR FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((NOT FIREABLE(t10) AND NOT FIREABLE(t11) AND NOT FIREABLE(t12) AND NOT FIREABLE(t13) AND NOT FIREABLE(t14) AND NOT FIREABLE(t15) AND NOT FIREABLE(t16) AND NOT FIREABLE(t17) AND NOT FIREABLE(t18) AND NOT FIREABLE(t19)) U ((FIREABLE(t10) OR FIREABLE(t11) OR FIREABLE(t12) OR FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19... (shortened)
lola: processed formula length: 587
lola: 46 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: 0
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: formula 0: (NOT FIREABLE(t10) AND NOT FIREABLE(t11) AND NOT FIREABLE(t12) AND NOT FIREABLE(t13) AND NOT FIREABLE(t14) AND NOT FIREABLE(t15) AND NOT FIREABLE(t16) AND NOT FIREABLE(t17) AND NOT FIREABLE(t18) AND NOT FIREABLE(t19))
lola: 1 markings, 0 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 19 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t0) AND NOT FIREABLE(t1) AND NOT FIREABLE(t2) AND NOT FIREABLE(t3) AND NOT FIREABLE(t4) AND NOT FIREABLE(t5) AND NOT FIREABLE(t6) AND NOT FIREABLE(t7) AND NOT FIREABLE(t8) AND NOT FIREABLE(t9) AND NOT FIREABLE(t20))))
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 ((NOT FIREABLE(t0) AND NOT FIREABLE(t1) AND NOT FIREABLE(t2) AND NOT FIREABLE(t3) AND NOT FIREABLE(t4) AND NOT FIREABLE(t5) AND NOT FIREABLE(t6) AND NOT FIREABLE(t7) AND NOT FIREABLE(t8) AND NOT FIREABLE(t9) AND NOT FIREABLE(t20))))
lola: processed formula length: 237
lola: 42 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (NOT FIREABLE(t0) AND NOT FIREABLE(t1) AND NOT FIREABLE(t2) AND NOT FIREABLE(t3) AND NOT FIREABLE(t4) AND NOT FIREABLE(t5) AND NOT FIREABLE(t6) AND NOT FIREABLE(t7) AND NOT FIREABLE(t8) AND NOT FIREABLE(t9) AND NOT FIREABLE(t20))
lola: SUBRESULT
lola: state equation task get result unparse finished id 0
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: state equation: Generated DNF with 11 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes yes no no yes yes no yes yes no no no yes yes
lola:
preliminary result: no yes yes yes no no yes yes no yes yes no no no yes yes
lola: memory consumption: 69656 KB
lola: time consumption: 6 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished

BK_STOP 1552965861732

--------------------
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="Referendum-COL-0010"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3957"
echo " Executing tool lola"
echo " Input is Referendum-COL-0010, 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 r137-smll-155284909500131"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Referendum-COL-0010.tgz
mv Referendum-COL-0010 execution
cd execution
if [ "CTLFireability" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "CTLFireability" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "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
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 ;