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.r115-smll-155272315400058.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 PhilosophersDyn-PT-10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r115-smll-155272315400058
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.7M
-rw-r--r-- 1 mcc users 20K Feb 12 09:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 12 09:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 81K Feb 8 08:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 303K Feb 8 08:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 108 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 346 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 12K Feb 5 00:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Feb 5 00:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 82K Feb 4 22:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 295K Feb 4 22:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 22K Feb 4 12:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 4 12:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 251K Feb 1 07:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 952K Feb 1 07:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Feb 4 22:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.1K Feb 4 22:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 2.5M 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 PhilosophersDyn-PT-10-CTLCardinality-00
FORMULA_NAME PhilosophersDyn-PT-10-CTLCardinality-01
FORMULA_NAME PhilosophersDyn-PT-10-CTLCardinality-02
FORMULA_NAME PhilosophersDyn-PT-10-CTLCardinality-03
FORMULA_NAME PhilosophersDyn-PT-10-CTLCardinality-04
FORMULA_NAME PhilosophersDyn-PT-10-CTLCardinality-05
FORMULA_NAME PhilosophersDyn-PT-10-CTLCardinality-06
FORMULA_NAME PhilosophersDyn-PT-10-CTLCardinality-07
FORMULA_NAME PhilosophersDyn-PT-10-CTLCardinality-08
FORMULA_NAME PhilosophersDyn-PT-10-CTLCardinality-09
FORMULA_NAME PhilosophersDyn-PT-10-CTLCardinality-10
FORMULA_NAME PhilosophersDyn-PT-10-CTLCardinality-11
FORMULA_NAME PhilosophersDyn-PT-10-CTLCardinality-12
FORMULA_NAME PhilosophersDyn-PT-10-CTLCardinality-13
FORMULA_NAME PhilosophersDyn-PT-10-CTLCardinality-14
FORMULA_NAME PhilosophersDyn-PT-10-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552814449039

info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ PhilosophersDyn-PT-10 @ 3570 seconds
check_solution: Constraint R140 = 0 is above its equality of -1
check_solution: Constraint R141 = 0 is above its equality of -1
check_solution: Constraint R142 = 0 is above its equality of -1
check_solution: Constraint R144 = 0 is above its equality of -1
check_solution: Constraint R145 = 0 is above its equality of -1
check_solution: Constraint R146 = 0 is above its equality of -1
check_solution: Constraint R147 = 0 is above its equality of -1
check_solution: Constraint R148 = 0 is above its equality of -1
check_solution: Constraint R149 = 0 is above its equality of -1
check_solution: Constraint R150 = 0 is above its equality of -1

Seriously low accuracy found ||*|| = 1 (rel. error 1)
check_solution: Variable C500 = -1 is below its lower bound 0
check_solution: Variable C821 = -1 is below its lower bound 0
check_solution: Variable C861 = -1 is below its lower bound 0
check_solution: Variable C1159 = -1 is below its lower bound 0
check_solution: Variable C1247 = -1 is below its lower bound 0
check_solution: Variable C1324 = -1 is below its lower bound 0
check_solution: Variable C1333 = -1 is below its lower bound 0
check_solution: Variable C1384 = -1 is below its lower bound 0
check_solution: Variable C1414 = -1 is below its lower bound 0
check_solution: Variable C1510 = -1 is below its lower bound 0

Seriously low accuracy found ||*|| = 10.2793 (rel. error 1.32245)
check_solution: Variable C2318 = -1 is below its lower bound 0
check_solution: Variable C2320 = -1 is below its lower bound 0
check_solution: Variable C2322 = -1 is below its lower bound 0
check_solution: Variable C2324 = -1 is below its lower bound 0
check_solution: Variable C2325 = -1 is below its lower bound 0
check_solution: Variable C2327 = -1 is below its lower bound 0
check_solution: Variable C2336 = -1 is below its lower bound 0
check_solution: Variable C2337 = -1 is below its lower bound 0
check_solution: Variable C2338 = -1 is below its lower bound 0
check_solution: Variable C2339 = -1 is below its lower bound 0

Seriously low accuracy found ||*|| = 2 (rel. error 1)

FORMULA PhilosophersDyn-PT-10-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-10-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-10-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-10-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-10-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-10-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-10-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-10-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-10-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-10-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-10-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-10-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-10-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-10-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-10-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-10-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3313
rslt: Output for CTLCardinality @ PhilosophersDyn-PT-10

{
"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=CTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sun Mar 17 09:20:49 2019
",
"timelimit": 3570
},
"child":
[

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

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 286
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "E (X (E (((HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9 + HasRight_10 <= Forks_1 + Forks_2 + Forks_3 + Forks_4 + Forks_5 + Forks_6 + Forks_7 + Forks_8 + Forks_9 + Forks_10) U (3 <= Forks_1 + Forks_2 + Forks_3 + Forks_4 + Forks_5 + Forks_6 + Forks_7 + Forks_8 + Forks_9 + Forks_10)))))",
"processed_size": 354,
"rewrites": 42
},
"result":
{
"edges": 479549,
"markings": 159755,
"produced_by": "state space / EXEU",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 2110
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_until_from_successors"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 310
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((Neighbourhood_10_5 <= Neighbourhood_7_6)))",
"processed_size": 49,
"rewrites": 41
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"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": 341
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "E (F ((Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_10 + Think_9 + 1 <= HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9 + HasRight_10)))",
"processed_size": 244,
"rewrites": 40
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 426
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 160,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 140,
"visible_transitions": 0
},
"processed": "E (G ((((1 <= Neighbourhood_9_1 + Neighbourhood_9_2 + Neighbourhood_9_3 + Neighbourhood_9_4 + Neighbourhood_9_5 + Neighbourhood_9_6 + Neighbourhood_9_7 + Neighbourhood_9_8 + Neighbourhood_9_9 + Neighbourhood_9_10 + Neighbourhood_8_10 + Neighbourhood_7_10 + Neighbourhood_6_10 + Neighbourhood_10_1 + Neighbourhood_10_2 + Neighbourhood_10_3 + Neighbourhood_10_4 + Neighbourhood_10_5 + Neighbourhood_10_6 + Neighbourhood_10_7 + Neighbourhood_10_8 + Neighbourhood_10_9 + Neighbourhood_7_8 + Neighbourhood_5_10 + Neighbourhood_10_10 + Neighbourhood_7_7 + Neighbourhood_7_6 + Neighbourhood_7_5 + Neighbourhood_7_4 + Neighbourhood_7_3 + Neighbourhood_7_2 + Neighbourhood_7_1 + Neighbourhood_6_8 + Neighbourhood_6_7 + Neighbourhood_6_6 + Neighbourhood_4_10 + Neighbourhood_3_10 + Neighbourhood_2_10 + Neighbourhood_6_5 + Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_1_4 + Neighbourhood_1_5 + Neighbourhood_1_6 + Neighbourhood_1_7 + Neighbourhood_1_8 + Neighbourhood_6_4 + Neighbourhood_6_3 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_2_4 + Neighbourhood_2_5 + Neighbourhood_2_6 + Neighbourhood_2_7 + Neighbourhood_2_8 + Neighbourhood_6_2 + Neighbourhood_6_1 + Neighbourhood_3_1 + Neighbourhood_3_2 + Neighbourhood_3_3 + Neighbourhood_3_4 + Neighbourhood_3_5 + Neighbourhood_3_6 + Neighbourhood_3_7 + Neighbourhood_3_8 + Neighbourhood_5_8 + Neighbourhood_4_1 + Neighbourhood_4_2 + Neighbourhood_4_3 + Neighbourhood_4_4 + Neighbourhood_4_5 + Neighbourhood_4_6 + Neighbourhood_4_7 + Neighbourhood_4_8 + Neighbourhood_5_7 + Neighbourhood_5_1 + Neighbourhood_5_2 + Neighbourhood_5_3 + Neighbourhood_5_4 + Neighbourhood_5_5 + Neighbourhood_5_6 + Neighbourhood_4_9 + Neighbourhood_3_9 + Neighbourhood_5_9 + Neighbourhood_1_10 + Neighbourhood_2_9 + Neighbourhood_1_9 + Neighbourhood_6_9 + Neighbourhood_7_9 + Neighbourhood_8_1 + Neighbourhood_8_2 + Neighbourhood_8_3 + Neighbourhood_8_4 + Neighbourhood_8_5 + Neighbourhood_8_6 + Neighbourhood_8_7 + Neighbourhood_8_8 + Neighbourhood_8_9) OR (Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_10 + Think_9 <= Outside_10 + Outside_9 + Outside_8 + Outside_7 + Outside_6 + Outside_5 + Outside_4 + Outside_3 + Outside_2 + Outside_1)) AND ((HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9 + HasRight_10 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_10 + Think_9) OR ((2 <= WaitRight_10 + WaitRight_1 + WaitRight_2 + WaitRight_3 + WaitRight_4 + WaitRight_5 + WaitRight_6 + WaitRight_7 + WaitRight_8 + WaitRight_9) AND (1 <= Outside_10 + Outside_9 + Outside_8 + Outside_7 + Outside_6 + Outside_5 + Outside_4 + Outside_3 + Outside_2 + Outside_1))))))",
"processed_size": 2784,
"rewrites": 40
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2300
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 3
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 487
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "EG((AF((WaitLeft_6 <= Neighbourhood_1_5)) OR ((Neighbourhood_1_10 <= 1))))",
"processed_size": 74,
"rewrites": 41
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 15,
"markings": 8,
"produced_by": "CTL model checker",
"value": true
},
"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": 568
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A(((Neighbourhood_10_8 + 1 <= Neighbourhood_9_2) AND (HasLeft_10 <= Neighbourhood_2_4)) U EG((Neighbourhood_8_6 <= WaitLeft_10)))",
"processed_size": 129,
"rewrites": 41
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 8,
"markings": 8,
"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": 682
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (((Neighbourhood_5_5 <= Think_7) U ((Neighbourhood_6_6 + 1 <= Neighbourhood_9_3) AND (Outside_4 + 1 <= Neighbourhood_7_10))))",
"processed_size": 127,
"rewrites": 42
},
"result":
{
"edges": 617301,
"markings": 199045,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 131
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "existential_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 842
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "E (((2 <= Outside_10 + Outside_9 + Outside_8 + Outside_7 + Outside_6 + Outside_5 + Outside_4 + Outside_3 + Outside_2 + Outside_1) U (Outside_10 + Outside_9 + Outside_8 + Outside_7 + Outside_6 + Outside_5 + Outside_4 + Outside_3 + Outside_2 + Outside_1 <= HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9 + HasRight_10)))",
"processed_size": 386,
"rewrites": 42
},
"result":
{
"edges": 617350,
"markings": 199051,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 1090
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1110
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 40,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "G ((F ((WaitRight_10 + WaitRight_1 + WaitRight_2 + WaitRight_3 + WaitRight_4 + WaitRight_5 + WaitRight_6 + WaitRight_7 + WaitRight_8 + WaitRight_9 <= Outside_10 + Outside_9 + Outside_8 + Outside_7 + Outside_6 + Outside_5 + Outside_4 + Outside_3 + Outside_2 + Outside_1)) OR (WaitRight_10 + WaitRight_1 + WaitRight_2 + WaitRight_3 + WaitRight_4 + WaitRight_5 + WaitRight_6 + WaitRight_7 + WaitRight_8 + WaitRight_9 <= HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9 + HasRight_10)))",
"processed_size": 548,
"rewrites": 41
},
"result":
{
"edges": 631375,
"markings": 199051,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "universal single path",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1656
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 100,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 100,
"visible_transitions": 0
},
"processed": "A (G ((Neighbourhood_9_1 + Neighbourhood_9_2 + Neighbourhood_9_3 + Neighbourhood_9_4 + Neighbourhood_9_5 + Neighbourhood_9_6 + Neighbourhood_9_7 + Neighbourhood_9_8 + Neighbourhood_9_9 + Neighbourhood_9_10 + Neighbourhood_8_10 + Neighbourhood_7_10 + Neighbourhood_6_10 + Neighbourhood_10_1 + Neighbourhood_10_2 + Neighbourhood_10_3 + Neighbourhood_10_4 + Neighbourhood_10_5 + Neighbourhood_10_6 + Neighbourhood_10_7 + Neighbourhood_10_8 + Neighbourhood_10_9 + Neighbourhood_7_8 + Neighbourhood_5_10 + Neighbourhood_10_10 + Neighbourhood_7_7 + Neighbourhood_7_6 + Neighbourhood_7_5 + Neighbourhood_7_4 + Neighbourhood_7_3 + Neighbourhood_7_2 + Neighbourhood_7_1 + Neighbourhood_6_8 + Neighbourhood_6_7 + Neighbourhood_6_6 + Neighbourhood_4_10 + Neighbourhood_3_10 + Neighbourhood_2_10 + Neighbourhood_6_5 + Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_1_4 + Neighbourhood_1_5 + Neighbourhood_1_6 + Neighbourhood_1_7 + Neighbourhood_1_8 + Neighbourhood_6_4 + Neighbourhood_6_3 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_2_4 + Neighbourhood_2_5 + Neighbourhood_2_6 + Neighbourhood_2_7 + Neighbourhood_2_8 + Neighbourhood_6_2 + Neighbourhood_6_1 + Neighbourhood_3_1 + Neighbourhood_3_2 + Neighbourhood_3_3 + Neighbourhood_3_4 + Neighbourhood_3_5 + Neighbourhood_3_6 + Neighbourhood_3_7 + Neighbourhood_3_8 + Neighbourhood_5_8 + Neighbourhood_4_1 + Neighbourhood_4_2 + Neighbourhood_4_3 + Neighbourhood_4_4 + Neighbourhood_4_5 + Neighbourhood_4_6 + Neighbourhood_4_7 + Neighbourhood_4_8 + Neighbourhood_5_7 + Neighbourhood_5_1 + Neighbourhood_5_2 + Neighbourhood_5_3 + Neighbourhood_5_4 + Neighbourhood_5_5 + Neighbourhood_5_6 + Neighbourhood_4_9 + Neighbourhood_3_9 + Neighbourhood_5_9 + Neighbourhood_1_10 + Neighbourhood_2_9 + Neighbourhood_1_9 + Neighbourhood_6_9 + Neighbourhood_7_9 + Neighbourhood_8_1 + Neighbourhood_8_2 + Neighbourhood_8_3 + Neighbourhood_8_4 + Neighbourhood_8_5 + Neighbourhood_8_6 + Neighbourhood_8_7 + Neighbourhood_8_8 + Neighbourhood_8_9 <= 2)))",
"processed_size": 2032,
"rewrites": 41
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3313
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 100,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 100,
"visible_transitions": 0
},
"processed": "(3 <= Neighbourhood_9_1 + Neighbourhood_9_2 + Neighbourhood_9_3 + Neighbourhood_9_4 + Neighbourhood_9_5 + Neighbourhood_9_6 + Neighbourhood_9_7 + Neighbourhood_9_8 + Neighbourhood_9_9 + Neighbourhood_9_10 + Neighbourhood_8_10 + Neighbourhood_7_10 + Neighbourhood_6_10 + Neighbourhood_10_1 + Neighbourhood_10_2 + Neighbourhood_10_3 + Neighbourhood_10_4 + Neighbourhood_10_5 + Neighbourhood_10_6 + Neighbourhood_10_7 + Neighbourhood_10_8 + Neighbourhood_10_9 + Neighbourhood_7_8 + Neighbourhood_5_10 + Neighbourhood_10_10 + Neighbourhood_7_7 + Neighbourhood_7_6 + Neighbourhood_7_5 + Neighbourhood_7_4 + Neighbourhood_7_3 + Neighbourhood_7_2 + Neighbourhood_7_1 + Neighbourhood_6_8 + Neighbourhood_6_7 + Neighbourhood_6_6 + Neighbourhood_4_10 + Neighbourhood_3_10 + Neighbourhood_2_10 + Neighbourhood_6_5 + Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_1_4 + Neighbourhood_1_5 + Neighbourhood_1_6 + Neighbourhood_1_7 + Neighbourhood_1_8 + Neighbourhood_6_4 + Neighbourhood_6_3 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_2_4 + Neighbourhood_2_5 + Neighbourhood_2_6 + Neighbourhood_2_7 + Neighbourhood_2_8 + Neighbourhood_6_2 + Neighbourhood_6_1 + Neighbourhood_3_1 + Neighbourhood_3_2 + Neighbourhood_3_3 + Neighbourhood_3_4 + Neighbourhood_3_5 + Neighbourhood_3_6 + Neighbourhood_3_7 + Neighbourhood_3_8 + Neighbourhood_5_8 + Neighbourhood_4_1 + Neighbourhood_4_2 + Neighbourhood_4_3 + Neighbourhood_4_4 + Neighbourhood_4_5 + Neighbourhood_4_6 + Neighbourhood_4_7 + Neighbourhood_4_8 + Neighbourhood_5_7 + Neighbourhood_5_1 + Neighbourhood_5_2 + Neighbourhood_5_3 + Neighbourhood_5_4 + Neighbourhood_5_5 + Neighbourhood_5_6 + Neighbourhood_4_9 + Neighbourhood_3_9 + Neighbourhood_5_9 + Neighbourhood_1_10 + Neighbourhood_2_9 + Neighbourhood_1_9 + Neighbourhood_6_9 + Neighbourhood_7_9 + Neighbourhood_8_1 + Neighbourhood_8_2 + Neighbourhood_8_3 + Neighbourhood_8_4 + Neighbourhood_8_5 + Neighbourhood_8_6 + Neighbourhood_8_7 + Neighbourhood_8_8 + Neighbourhood_8_9)",
"processed_size": 2024,
"rewrites": 42
},
"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": 2290
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3313
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "A (G ((WaitLeft_10 + WaitLeft_1 + WaitLeft_2 + WaitLeft_3 + WaitLeft_4 + WaitLeft_5 + WaitLeft_6 + WaitLeft_7 + WaitLeft_8 + WaitLeft_9 <= 2)))",
"processed_size": 143,
"rewrites": 41
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"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": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 100,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 100,
"visible_transitions": 0
},
"processed": "(2 <= Neighbourhood_9_1 + Neighbourhood_9_2 + Neighbourhood_9_3 + Neighbourhood_9_4 + Neighbourhood_9_5 + Neighbourhood_9_6 + Neighbourhood_9_7 + Neighbourhood_9_8 + Neighbourhood_9_9 + Neighbourhood_9_10 + Neighbourhood_8_10 + Neighbourhood_7_10 + Neighbourhood_6_10 + Neighbourhood_10_1 + Neighbourhood_10_2 + Neighbourhood_10_3 + Neighbourhood_10_4 + Neighbourhood_10_5 + Neighbourhood_10_6 + Neighbourhood_10_7 + Neighbourhood_10_8 + Neighbourhood_10_9 + Neighbourhood_7_8 + Neighbourhood_5_10 + Neighbourhood_10_10 + Neighbourhood_7_7 + Neighbourhood_7_6 + Neighbourhood_7_5 + Neighbourhood_7_4 + Neighbourhood_7_3 + Neighbourhood_7_2 + Neighbourhood_7_1 + Neighbourhood_6_8 + Neighbourhood_6_7 + Neighbourhood_6_6 + Neighbourhood_4_10 + Neighbourhood_3_10 + Neighbourhood_2_10 + Neighbourhood_6_5 + Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_1_4 + Neighbourhood_1_5 + Neighbourhood_1_6 + Neighbourhood_1_7 + Neighbourhood_1_8 + Neighbourhood_6_4 + Neighbourhood_6_3 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_2_4 + Neighbourhood_2_5 + Neighbourhood_2_6 + Neighbourhood_2_7 + Neighbourhood_2_8 + Neighbourhood_6_2 + Neighbourhood_6_1 + Neighbourhood_3_1 + Neighbourhood_3_2 + Neighbourhood_3_3 + Neighbourhood_3_4 + Neighbourhood_3_5 + Neighbourhood_3_6 + Neighbourhood_3_7 + Neighbourhood_3_8 + Neighbourhood_5_8 + Neighbourhood_4_1 + Neighbourhood_4_2 + Neighbourhood_4_3 + Neighbourhood_4_4 + Neighbourhood_4_5 + Neighbourhood_4_6 + Neighbourhood_4_7 + Neighbourhood_4_8 + Neighbourhood_5_7 + Neighbourhood_5_1 + Neighbourhood_5_2 + Neighbourhood_5_3 + Neighbourhood_5_4 + Neighbourhood_5_5 + Neighbourhood_5_6 + Neighbourhood_4_9 + Neighbourhood_3_9 + Neighbourhood_5_9 + Neighbourhood_1_10 + Neighbourhood_2_9 + Neighbourhood_1_9 + Neighbourhood_6_9 + Neighbourhood_7_9 + Neighbourhood_8_1 + Neighbourhood_8_2 + Neighbourhood_8_3 + Neighbourhood_8_4 + Neighbourhood_8_5 + Neighbourhood_8_6 + Neighbourhood_8_7 + Neighbourhood_8_8 + Neighbourhood_8_9)",
"processed_size": 2024,
"rewrites": 39
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 17,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 110896,
"runtime": 257.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E((** U **)) : E(G(**)) : E(X(E((** U **)))) : TRUE : A(G((A(F(**)) OR **))) : (A(F(*)) OR A(G(*))) : ((A((** U **)) AND **) OR A(G(*))) : (A(G(E(X(**)))) AND A(X(E(X(**))))) : E(X(E(F(*)))) : E((** U **)) : A(F(**)) : TRUE : A(G(**)) : A((** U E(G(**)))) : E(G((A(F(**)) OR **)))"
},
"net":
{
"arcs": 18190,
"conflict_clusters": 1,
"places": 170,
"places_significant": 131,
"singleton_clusters": 0,
"transitions": 2310
},
"result":
{
"preliminary_value": "yes no yes no yes yes yes no no yes no no yes no yes yes ",
"value": "yes no yes no yes yes yes no no yes no no yes no yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 2480/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 5440
lola: finding significant places
lola: 170 places, 2310 transitions, 131 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 CTLCardinality.xml
lola: LP says that atomic proposition is always true: (WaitRight_10 + WaitRight_1 + WaitRight_2 + WaitRight_3 + WaitRight_4 + WaitRight_5 + WaitRight_6 + WaitRight_7 + WaitRight_8 + WaitRight_9 <= Neighbourhood_9_1 + Neighbourhood_9_2 + Neighbourhood_9_3 + Neighbourhood_9_4 + Neighbourhood_9_5 + Neighbourhood_9_6 + Neighbourhood_9_7 + Neighbourhood_9_8 + Neighbourhood_9_9 + Neighbourhood_9_10 + Neighbourhood_8_10 + Neighbourhood_7_10 + Neighbourhood_6_10 + Neighbourhood_10_1 + Neighbourhood_10_2 + Neighbourhood_10_3 + Neighbourhood_10_4 + Neighbourhood_10_5 + Neighbourhood_10_6 + Neighbourhood_10_7 + Neighbourhood_10_8 + Neighbourhood_10_9 + Neighbourhood_7_8 + Neighbourhood_5_10 + Neighbourhood_10_10 + Neighbourhood_7_7 + Neighbourhood_7_6 + Neighbourhood_7_5 + Neighbourhood_7_4 + Neighbourhood_7_3 + Neighbourhood_7_2 + Neighbourhood_7_1 + Neighbourhood_6_8 + Neighbourhood_6_7 + Neighbourhood_6_6 + Neighbourhood_4_10 + Neighbourhood_3_10 + Neighbourhood_2_10 + Neighbourhood_6_5 + Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_1_4 + Neighbourhood_1_5 + Neighbourhood_1_6 + Neighbourhood_1_7 + Neighbourhood_1_8 + Neighbourhood_6_4 + Neighbourhood_6_3 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_2_4 + Neighbourhood_2_5 + Neighbourhood_2_6 + Neighbourhood_2_7 + Neighbourhood_2_8 + Neighbourhood_6_2 + Neighbourhood_6_1 + Neighbourhood_3_1 + Neighbourhood_3_2 + Neighbourhood_3_3 + Neighbourhood_3_4 + Neighbourhood_3_5 + Neighbourhood_3_6 + Neighbourhood_3_7 + Neighbourhood_3_8 + Neighbourhood_5_8 + Neighbourhood_4_1 + Neighbourhood_4_2 + Neighbourhood_4_3 + Neighbourhood_4_4 + Neighbourhood_4_5 + Neighbourhood_4_6 + Neighbourhood_4_7 + Neighbourhood_4_8 + Neighbourhood_5_7 + Neighbourhood_5_1 + Neighbourhood_5_2 + Neighbourhood_5_3 + Neighbourhood_5_4 + Neighbourhood_5_5 + Neighbourhood_5_6 + Neighbourhood_4_9 + Neighbourhood_3_9 + Neighbourhood_5_9 + Neighbourhood_1_10 + Neighbourhood_2_9 + Neighbourhood_1_9 + Neighbourhood_6_9 + Neighbourhood_7_9 + Neighbourhood_8_1 + Neighbourhood_8_2 + Neighbourhood_8_3 + Neighbourhood_8_4 + Neighbourhood_8_5 + Neighbourhood_8_6 + Neighbourhood_8_7 + Neighbourhood_8_8 + Neighbourhood_8_9)
lola: LP says that atomic proposition is always true: (WaitLeft_10 + WaitLeft_1 + WaitLeft_2 + WaitLeft_3 + WaitLeft_4 + WaitLeft_5 + WaitLeft_6 + WaitLeft_7 + WaitLeft_8 + WaitLeft_9 <= Neighbourhood_9_1 + Neighbourhood_9_2 + Neighbourhood_9_3 + Neighbourhood_9_4 + Neighbourhood_9_5 + Neighbourhood_9_6 + Neighbourhood_9_7 + Neighbourhood_9_8 + Neighbourhood_9_9 + Neighbourhood_9_10 + Neighbourhood_8_10 + Neighbourhood_7_10 + Neighbourhood_6_10 + Neighbourhood_10_1 + Neighbourhood_10_2 + Neighbourhood_10_3 + Neighbourhood_10_4 + Neighbourhood_10_5 + Neighbourhood_10_6 + Neighbourhood_10_7 + Neighbourhood_10_8 + Neighbourhood_10_9 + Neighbourhood_7_8 + Neighbourhood_5_10 + Neighbourhood_10_10 + Neighbourhood_7_7 + Neighbourhood_7_6 + Neighbourhood_7_5 + Neighbourhood_7_4 + Neighbourhood_7_3 + Neighbourhood_7_2 + Neighbourhood_7_1 + Neighbourhood_6_8 + Neighbourhood_6_7 + Neighbourhood_6_6 + Neighbourhood_4_10 + Neighbourhood_3_10 + Neighbourhood_2_10 + Neighbourhood_6_5 + Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_1_4 + Neighbourhood_1_5 + Neighbourhood_1_6 + Neighbourhood_1_7 + Neighbourhood_1_8 + Neighbourhood_6_4 + Neighbourhood_6_3 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_2_4 + Neighbourhood_2_5 + Neighbourhood_2_6 + Neighbourhood_2_7 + Neighbourhood_2_8 + Neighbourhood_6_2 + Neighbourhood_6_1 + Neighbourhood_3_1 + Neighbourhood_3_2 + Neighbourhood_3_3 + Neighbourhood_3_4 + Neighbourhood_3_5 + Neighbourhood_3_6 + Neighbourhood_3_7 + Neighbourhood_3_8 + Neighbourhood_5_8 + Neighbourhood_4_1 + Neighbourhood_4_2 + Neighbourhood_4_3 + Neighbourhood_4_4 + Neighbourhood_4_5 + Neighbourhood_4_6 + Neighbourhood_4_7 + Neighbourhood_4_8 + Neighbourhood_5_7 + Neighbourhood_5_1 + Neighbourhood_5_2 + Neighbourhood_5_3 + Neighbourhood_5_4 + Neighbourhood_5_5 + Neighbourhood_5_6 + Neighbourhood_4_9 + Neighbourhood_3_9 + Neighbourhood_5_9 + Neighbourhood_1_10 + Neighbourhood_2_9 + Neighbourhood_1_9 + Neighbourhood_6_9 + Neighbourhood_7_9 + Neighbourhood_8_1 + Neighbourhood_8_2 + Neighbourhood_8_3 + Neighbourhood_8_4 + Neighbourhood_8_5 + Neighbourhood_8_6 + Neighbourhood_8_7 + Neighbourhood_8_8 + Neighbourhood_8_9)
lola: LP says that atomic proposition is always false: (3 <= Neighbourhood_3_4)
lola: LP says that atomic proposition is always false: (3 <= HasLeft_8)
lola: LP says that atomic proposition is always false: (3 <= HasRight_9)
lola: NOT(NOT(E (F ((Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_10 + Think_9 + 1 <= HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9 + HasRight_10))))) : E (((2 <= Outside_10 + Outside_9 + Outside_8 + Outside_7 + Outside_6 + Outside_5 + Outside_4 + Outside_3 + Outside_2 + Outside_1) U (Outside_10 + Outside_9 + Outside_8 + Outside_7 + Outside_6 + Outside_5 + Outside_4 + Outside_3 + Outside_2 + Outside_1 <= HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9 + HasRight_10))) : E (G ((((1 <= Neighbourhood_9_1 + Neighbourhood_9_2 + Neighbourhood_9_3 + Neighbourhood_9_4 + Neighbourhood_9_5 + Neighbourhood_9_6 + Neighbourhood_9_7 + Neighbourhood_9_8 + Neighbourhood_9_9 + Neighbourhood_9_10 + Neighbourhood_8_10 + Neighbourhood_7_10 + Neighbourhood_6_10 + Neighbourhood_10_1 + Neighbourhood_10_2 + Neighbourhood_10_3 + Neighbourhood_10_4 + Neighbourhood_10_5 + Neighbourhood_10_6 + Neighbourhood_10_7 + Neighbourhood_10_8 + Neighbourhood_10_9 + Neighbourhood_7_8 + Neighbourhood_5_10 + Neighbourhood_10_10 + Neighbourhood_7_7 + Neighbourhood_7_6 + Neighbourhood_7_5 + Neighbourhood_7_4 + Neighbourhood_7_3 + Neighbourhood_7_2 + Neighbourhood_7_1 + Neighbourhood_6_8 + Neighbourhood_6_7 + Neighbourhood_6_6 + Neighbourhood_4_10 + Neighbourhood_3_10 + Neighbourhood_2_10 + Neighbourhood_6_5 + Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_1_4 + Neighbourhood_1_5 + Neighbourhood_1_6 + Neighbourhood_1_7 + Neighbourhood_1_8 + Neighbourhood_6_4 + Neighbourhood_6_3 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_2_4 + Neighbourhood_2_5 + Neighbourhood_2_6 + Neighbourhood_2_7 + Neighbourhood_2_8 + Neighbourhood_6_2 + Neighbourhood_6_1 + Neighbourhood_3_1 + Neighbourhood_3_2 + Neighbourhood_3_3 + Neighbourhood_3_4 + Neighbourhood_3_5 + Neighbourhood_3_6 + Neighbourhood_3_7 + Neighbourhood_3_8 + Neighbourhood_5_8 + Neighbourhood_4_1 + Neighbourhood_4_2 + Neighbourhood_4_3 + Neighbourhood_4_4 + Neighbourhood_4_5 + Neighbourhood_4_6 + Neighbourhood_4_7 + Neighbourhood_4_8 + Neighbourhood_5_7 + Neighbourhood_5_1 + Neighbourhood_5_2 + Neighbourhood_5_3 + Neighbourhood_5_4 + Neighbourhood_5_5 + Neighbourhood_5_6 + Neighbourhood_4_9 + Neighbourhood_3_9 + Neighbourhood_5_9 + Neighbourhood_1_10 + Neighbourhood_2_9 + Neighbourhood_1_9 + Neighbourhood_6_9 + Neighbourhood_7_9 + Neighbourhood_8_1 + Neighbourhood_8_2 + Neighbourhood_8_3 + Neighbourhood_8_4 + Neighbourhood_8_5 + Neighbourhood_8_6 + Neighbourhood_8_7 + Neighbourhood_8_8 + Neighbourhood_8_9) OR (Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_10 + Think_9 <= Outside_10 + Outside_9 + Outside_8 + Outside_7 + Outside_6 + Outside_5 + Outside_4 + Outside_3 + Outside_2 + Outside_1)) AND ((HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9 + HasRight_10 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_10 + Think_9) OR ((2 <= WaitRight_10 + WaitRight_1 + WaitRight_2 + WaitRight_3 + WaitRight_4 + WaitRight_5 + WaitRight_6 + WaitRight_7 + WaitRight_8 + WaitRight_9) AND (1 <= Outside_10 + Outside_9 + Outside_8 + Outside_7 + Outside_6 + Outside_5 + Outside_4 + Outside_3 + Outside_2 + Outside_1)))))) : E (X (E (((HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9 + HasRight_10 <= Forks_1 + Forks_2 + Forks_3 + Forks_4 + Forks_5 + Forks_6 + Forks_7 + Forks_8 + Forks_9 + Forks_10) U (3 <= Forks_1 + Forks_2 + Forks_3 + Forks_4 + Forks_5 + Forks_6 + Forks_7 + Forks_8 + Forks_9 + Forks_10))))) : A (G (A (G (())))) : A (G ((A (F ((WaitRight_10 + WaitRight_1 + WaitRight_2 + WaitRight_3 + WaitRight_4 + WaitRight_5 + WaitRight_6 + WaitRight_7 + WaitRight_8 + WaitRight_9 <= Outside_10 + Outside_9 + Outside_8 + Outside_7 + Outside_6 + Outside_5 + Outside_4 + Outside_3 + Outside_2 + Outside_1))) OR (WaitRight_10 + WaitRight_1 + WaitRight_2 + WaitRight_3 + WaitRight_4 + WaitRight_5 + WaitRight_6 + WaitRight_7 + WaitRight_8 + WaitRight_9 <= HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9 + HasRight_10)))) : (NOT((E (G ((3 <= Neighbourhood_9_1 + Neighbourhood_9_2 + Neighbourhood_9_3 + Neighbourhood_9_4 + Neighbourhood_9_5 + Neighbourhood_9_6 + Neighbourhood_9_7 + Neighbourhood_9_8 + Neighbourhood_9_9 + Neighbourhood_9_10 + Neighbourhood_8_10 + Neighbourhood_7_10 + Neighbourhood_6_10 + Neighbourhood_10_1 + Neighbourhood_10_2 + Neighbourhood_10_3 + Neighbourhood_10_4 + Neighbourhood_10_5 + Neighbourhood_10_6 + Neighbourhood_10_7 + Neighbourhood_10_8 + Neighbourhood_10_9 + Neighbourhood_7_8 + Neighbourhood_5_10 + Neighbourhood_10_10 + Neighbourhood_7_7 + Neighbourhood_7_6 + Neighbourhood_7_5 + Neighbourhood_7_4 + Neighbourhood_7_3 + Neighbourhood_7_2 + Neighbourhood_7_1 + Neighbourhood_6_8 + Neighbourhood_6_7 + Neighbourhood_6_6 + Neighbourhood_4_10 + Neighbourhood_3_10 + Neighbourhood_2_10 + Neighbourhood_6_5 + Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_1_4 + Neighbourhood_1_5 + Neighbourhood_1_6 + Neighbourhood_1_7 + Neighbourhood_1_8 + Neighbourhood_6_4 + Neighbourhood_6_3 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_2_4 + Neighbourhood_2_5 + Neighbourhood_2_6 + Neighbourhood_2_7 + Neighbourhood_2_8 + Neighbourhood_6_2 + Neighbourhood_6_1 + Neighbourhood_3_1 + Neighbourhood_3_2 + Neighbourhood_3_3 + Neighbourhood_3_4 + Neighbourhood_3_5 + Neighbourhood_3_6 + Neighbourhood_3_7 + Neighbourhood_3_8 + Neighbourhood_5_8 + Neighbourhood_4_1 + Neighbourhood_4_2 + Neighbourhood_4_3 + Neighbourhood_4_4 + Neighbourhood_4_5 + Neighbourhood_4_6 + Neighbourhood_4_7 + Neighbourhood_4_8 + Neighbourhood_5_7 + Neighbourhood_5_1 + Neighbourhood_5_2 + Neighbourhood_5_3 + Neighbourhood_5_4 + Neighbourhood_5_5 + Neighbourhood_5_6 + Neighbourhood_4_9 + Neighbourhood_3_9 + Neighbourhood_5_9 + Neighbourhood_1_10 + Neighbourhood_2_9 + Neighbourhood_1_9 + Neighbourhood_6_9 + Neighbourhood_7_9 + Neighbourhood_8_1 + Neighbourhood_8_2 + Neighbourhood_8_3 + Neighbourhood_8_4 + Neighbourhood_8_5 + Neighbourhood_8_6 + Neighbourhood_8_7 + Neighbourhood_8_8 + Neighbourhood_8_9))) AND E (F ((3 <= Neighbourhood_9_1 + Neighbourhood_9_2 + Neighbourhood_9_3 + Neighbourhood_9_4 + Neighbourhood_9_5 + Neighbourhood_9_6 + Neighbourhood_9_7 + Neighbourhood_9_8 + Neighbourhood_9_9 + Neighbourhood_9_10 + Neighbourhood_8_10 + Neighbourhood_7_10 + Neighbourhood_6_10 + Neighbourhood_10_1 + Neighbourhood_10_2 + Neighbourhood_10_3 + Neighbourhood_10_4 + Neighbourhood_10_5 + Neighbourhood_10_6 + Neighbourhood_10_7 + Neighbourhood_10_8 + Neighbourhood_10_9 + Neighbourhood_7_8 + Neighbourhood_5_10 + Neighbourhood_10_10 + Neighbourhood_7_7 + Neighbourhood_7_6 + Neighbourhood_7_5 + Neighbourhood_7_4 + Neighbourhood_7_3 + Neighbourhood_7_2 + Neighbourhood_7_1 + Neighbourhood_6_8 + Neighbourhood_6_7 + Neighbourhood_6_6 + Neighbourhood_4_10 + Neighbourhood_3_10 + Neighbourhood_2_10 + Neighbourhood_6_5 + Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_1_4 + Neighbourhood_1_5 + Neighbourhood_1_6 + Neighbourhood_1_7 + Neighbourhood_1_8 + Neighbourhood_6_4 + Neighbourhood_6_3 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_2_4 + Neighbourhood_2_5 + Neighbourhood_2_6 + Neighbourhood_2_7 + Neighbourhood_2_8 + Neighbourhood_6_2 + Neighbourhood_6_1 + Neighbourhood_3_1 + Neighbourhood_3_2 + Neighbourhood_3_3 + Neighbourhood_3_4 + Neighbourhood_3_5 + Neighbourhood_3_6 + Neighbourhood_3_7 + Neighbourhood_3_8 + Neighbourhood_5_8 + Neighbourhood_4_1 + Neighbourhood_4_2 + Neighbourhood_4_3 + Neighbourhood_4_4 + Neighbourhood_4_5 + Neighbourhood_4_6 + Neighbourhood_4_7 + Neighbourhood_4_8 + Neighbourhood_5_7 + Neighbourhood_5_1 + Neighbourhood_5_2 + Neighbourhood_5_3 + Neighbourhood_5_4 + Neighbourhood_5_5 + Neighbourhood_5_6 + Neighbourhood_4_9 + Neighbourhood_3_9 + Neighbourhood_5_9 + Neighbourhood_1_10 + Neighbourhood_2_9 + Neighbourhood_1_9 + Neighbourhood_6_9 + Neighbourhood_7_9 + Neighbourhood_8_1 + Neighbourhood_8_2 + Neighbourhood_8_3 + Neighbourhood_8_4 + Neighbourhood_8_5 + Neighbourhood_8_6 + Neighbourhood_8_7 + Neighbourhood_8_8 + Neighbourhood_8_9))))) AND A (G ((0 <= 0)))) : ((A (((3 <= Forks_1 + Forks_2 + Forks_3 + Forks_4 + Forks_5 + Forks_6 + Forks_7 + Forks_8 + Forks_9 + Forks_10) U (2 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_10 + Think_9))) AND (2 <= Neighbourhood_9_1 + Neighbourhood_9_2 + Neighbourhood_9_3 + Neighbourhood_9_4 + Neighbourhood_9_5 + Neighbourhood_9_6 + Neighbourhood_9_7 + Neighbourhood_9_8 + Neighbourhood_9_9 + Neighbourhood_9_10 + Neighbourhood_8_10 + Neighbourhood_7_10 + Neighbourhood_6_10 + Neighbourhood_10_1 + Neighbourhood_10_2 + Neighbourhood_10_3 + Neighbourhood_10_4 + Neighbourhood_10_5 + Neighbourhood_10_6 + Neighbourhood_10_7 + Neighbourhood_10_8 + Neighbourhood_10_9 + Neighbourhood_7_8 + Neighbourhood_5_10 + Neighbourhood_10_10 + Neighbourhood_7_7 + Neighbourhood_7_6 + Neighbourhood_7_5 + Neighbourhood_7_4 + Neighbourhood_7_3 + Neighbourhood_7_2 + Neighbourhood_7_1 + Neighbourhood_6_8 + Neighbourhood_6_7 + Neighbourhood_6_6 + Neighbourhood_4_10 + Neighbourhood_3_10 + Neighbourhood_2_10 + Neighbourhood_6_5 + Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_1_4 + Neighbourhood_1_5 + Neighbourhood_1_6 + Neighbourhood_1_7 + Neighbourhood_1_8 + Neighbourhood_6_4 + Neighbourhood_6_3 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_2_4 + Neighbourhood_2_5 + Neighbourhood_2_6 + Neighbourhood_2_7 + Neighbourhood_2_8 + Neighbourhood_6_2 + Neighbourhood_6_1 + Neighbourhood_3_1 + Neighbourhood_3_2 + Neighbourhood_3_3 + Neighbourhood_3_4 + Neighbourhood_3_5 + Neighbourhood_3_6 + Neighbourhood_3_7 + Neighbourhood_3_8 + Neighbourhood_5_8 + Neighbourhood_4_1 + Neighbourhood_4_2 + Neighbourhood_4_3 + Neighbourhood_4_4 + Neighbourhood_4_5 + Neighbourhood_4_6 + Neighbourhood_4_7 + Neighbourhood_4_8 + Neighbourhood_5_7 + Neighbourhood_5_1 + Neighbourhood_5_2 + Neighbourhood_5_3 + Neighbourhood_5_4 + Neighbourhood_5_5 + Neighbourhood_5_6 + Neighbourhood_4_9 + Neighbourhood_3_9 + Neighbourhood_5_9 + Neighbourhood_1_10 + Neighbourhood_2_9 + Neighbourhood_1_9 + Neighbourhood_6_9 + Neighbourhood_7_9 + Neighbourhood_8_1 + Neighbourhood_8_2 + Neighbourhood_8_3 + Neighbourhood_8_4 + Neighbourhood_8_5 + Neighbourhood_8_6 + Neighbourhood_8_7 + Neighbourhood_8_8 + Neighbourhood_8_9)) OR NOT(E (((WaitLeft_10 + WaitLeft_1 + WaitLeft_2 + WaitLeft_3 + WaitLeft_4 + WaitLeft_5 + WaitLeft_6 + WaitLeft_7 + WaitLeft_8 + WaitLeft_9 <= Neighbourhood_9_1 + Neighbourhood_9_2 + Neighbourhood_9_3 + Neighbourhood_9_4 + Neighbourhood_9_5 + Neighbourhood_9_6 + Neighbourhood_9_7 + Neighbourhood_9_8 + Neighbourhood_9_9 + Neighbourhood_9_10 + Neighbourhood_8_10 + Neighbourhood_7_10 + Neighbourhood_6_10 + Neighbourhood_10_1 + Neighbourhood_10_2 + Neighbourhood_10_3 + Neighbourhood_10_4 + Neighbourhood_10_5 + Neighbourhood_10_6 + Neighbourhood_10_7 + Neighbourhood_10_8 + Neighbourhood_10_9 + Neighbourhood_7_8 + Neighbourhood_5_10 + Neighbourhood_10_10 + Neighbourhood_7_7 + Neighbourhood_7_6 + Neighbourhood_7_5 + Neighbourhood_7_4 + Neighbourhood_7_3 + Neighbourhood_7_2 + Neighbourhood_7_1 + Neighbourhood_6_8 + Neighbourhood_6_7 + Neighbourhood_6_6 + Neighbourhood_4_10 + Neighbourhood_3_10 + Neighbourhood_2_10 + Neighbourhood_6_5 + Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_1_4 + Neighbourhood_1_5 + Neighbourhood_1_6 + Neighbourhood_1_7 + Neighbourhood_1_8 + Neighbourhood_6_4 + Neighbourhood_6_3 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_2_4 + Neighbourhood_2_5 + Neighbourhood_2_6 + Neighbourhood_2_7 + Neighbourhood_2_8 + Neighbourhood_6_2 + Neighbourhood_6_1 + Neighbourhood_3_1 + Neighbourhood_3_2 + Neighbourhood_3_3 + Neighbourhood_3_4 + Neighbourhood_3_5 + Neighbourhood_3_6 + Neighbourhood_3_7 + Neighbourhood_3_8 + Neighbourhood_5_8 + Neighbourhood_4_1 + Neighbourhood_4_2 + Neighbourhood_4_3 + Neighbourhood_4_4 + Neighbourhood_4_5 + Neighbourhood_4_6 + Neighbourhood_4_7 + Neighbourhood_4_8 + Neighbourhood_5_7 + Neighbourhood_5_1 + Neighbourhood_5_2 + Neighbourhood_5_3 + Neighbourhood_5_4 + Neighbourhood_5_5 + Neighbourhood_5_6 + Neighbourhood_4_9 + Neighbourhood_3_9 + Neighbourhood_5_9 + Neighbourhood_1_10 + Neighbourhood_2_9 + Neighbourhood_1_9 + Neighbourhood_6_9 + Neighbourhood_7_9 + Neighbourhood_8_1 + Neighbourhood_8_2 + Neighbourhood_8_3 + Neighbourhood_8_4 + Neighbourhood_8_5 + Neighbourhood_8_6 + Neighbourhood_8_7 + Neighbourhood_8_8 + Neighbourhood_8_9) U (3 <= WaitLeft_10 + WaitLeft_1 + WaitLeft_2 + WaitLeft_3 + WaitLeft_4 + WaitLeft_5 + WaitLeft_6 + WaitLeft_7 + WaitLeft_8 + WaitLeft_9))))) : (A (G (E (X ((Neighbourhood_1_7 <= HasLeft_5))))) AND A (X (E (X ((HasLeft_3 <= HasRight_2)))))) : E (F (NOT(A (X ((HasLeft_10 <= Neighbourhood_1_4)))))) : E (((Neighbourhood_5_5 <= Think_7) U ((Neighbourhood_6_6 + 1 <= Neighbourhood_9_3) AND (Outside_4 + 1 <= Neighbourhood_7_10)))) : A (F ((Outside_8 <= HasRight_7))) : NOT(A (F (()))) : A (G ((E (F ((3 <= HasLeft_8))) OR (Neighbourhood_10_5 <= Neighbourhood_7_6)))) : A ((((Neighbourhood_10_8 + 1 <= Neighbourhood_9_2) AND (HasLeft_10 <= Neighbourhood_2_4)) U E (G ((Neighbourhood_8_6 <= WaitLeft_10))))) : E (G ((A (F ((WaitLeft_6 <= Neighbourhood_1_5))) OR ((Neighbourhood_1_10 <= 1)))))
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 215 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 39 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 230 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 39 rewrites
lola: closed formula file CTLCardinality.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 2 will run for 246 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (E (X ((Neighbourhood_1_7 <= HasLeft_5))))) AND A (X (E (X ((HasLeft_3 <= HasRight_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 246 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((Neighbourhood_1_7 <= HasLeft_5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX((Neighbourhood_1_7 <= HasLeft_5)))
lola: processed formula length: 40
lola: 41 rewrites
lola: closed formula file CTLCardinality.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: 5 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 265 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((Neighbourhood_1_4 + 1 <= HasLeft_10)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: (Neighbourhood_1_4 + 1 <= HasLeft_10)
lola: processed formula length: 37
lola: 41 rewrites
lola: closed formula file CTLCardinality.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: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (Neighbourhood_1_4 + 1 <= HasLeft_10)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-3-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || 26746 markings, 62676 edges, 5349 markings/sec, 0 secs
lola: sara is running 5 secs || 54739 markings, 133440 edges, 5599 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 57229 markings, 139748 edges
lola: ========================================
lola: subprocess 4 will run for 286 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (((HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9 + HasRight_10 <= Forks_1 + Forks_2 + Forks_3 + Forks_4 + Forks_5 + Forks_6 + Forks_7 + Forks_8 + Forks_9 + Forks_10) U (3 <= Forks_1 + Forks_2 + Forks_3 + Forks_4 + Forks_5 + Forks_6 + Forks_7 + Forks_8 + Forks_9 + Forks_10)))))
lola: ========================================
lola: SUBTASK
lola: checking existential until from successors
lola: rewrite Frontend/Parser/formula_rewrite.k:688
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:716
lola: rewrite Frontend/Parser/formula_rewrite.k:688
lola: processed formula: E (X (E (((HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9 + HasRight_10 <= Forks_1 + Forks_2 + Forks_3 + Forks_4 + Forks_5 + Forks_6 + Forks_7 + Forks_8 + Forks_9 + Forks_10) U (3 <= Forks_1 + Forks_2 + Forks_3 + Forks_4 + Forks_5 + Forks_6 + Forks_7 + Forks_8 + Forks_9 + Forks_10)))))
lola: processed formula length: 354
lola: 42 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EXEU)
lola: state space: using reachability graph (EXEU 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: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= Forks_1 + Forks_2 + Forks_3 + Forks_4 + Forks_5 + Forks_6 + Forks_7 + Forks_8 + Forks_9 + Forks_10)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-4-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 24344 markings, 67933 edges, 4869 markings/sec, 0 secs
lola: sara is running 5 secs || 48266 markings, 138813 edges, 4784 markings/sec, 5 secs
lola: sara is running 10 secs || 72762 markings, 212782 edges, 4899 markings/sec, 10 secs
lola: sara is running 15 secs || 98112 markings, 289556 edges, 5070 markings/sec, 15 secs
lola: sara is running 20 secs || 123227 markings, 367349 edges, 5023 markings/sec, 20 secs
lola: sara is running 25 secs || 148374 markings, 443477 edges, 5029 markings/sec, 25 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EXEU
lola: There is no path where Predicate Phi holds until Predicate Psi from any successor.
lola: 159755 markings, 479549 edges
lola: ========================================
lola: subprocess 5 will run for 310 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((Neighbourhood_10_5 <= Neighbourhood_7_6)))
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 ((Neighbourhood_10_5 <= Neighbourhood_7_6)))
lola: processed formula length: 49
lola: 41 rewrites
lola: closed formula file CTLCardinality.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: (Neighbourhood_7_6 + 1 <= Neighbourhood_10_5)
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 6 will run for 341 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_10 + Think_9 + 1 <= HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9 + HasRight_10)))
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 ((Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_10 + Think_9 + 1 <= HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9 + HasRight_10)))
lola: processed formula length: 244
lola: 40 rewrites
lola: closed formula file CTLCardinality.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: (Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_10 + Think_9 + 1 <= HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9 + HasRight_10)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 7 will run for 379 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((Outside_8 <= HasRight_7)))
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: (HasRight_7 + 1 <= Outside_8)
lola: processed formula length: 29
lola: 42 rewrites
lola: closed formula file CTLCardinality.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: (Outside_8 <= HasRight_7)
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 / EG
lola: The predicate does not eventually occur.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 8 will run for 426 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((1 <= Neighbourhood_9_1 + Neighbourhood_9_2 + Neighbourhood_9_3 + Neighbourhood_9_4 + Neighbourhood_9_5 + Neighbourhood_9_6 + Neighbourhood_9_7 + Neighbourhood_9_8 + Neighbourhood_9_9 + Neighbourhood_9_10 + Neighbourhood_8_10 + Neighbourhood_7_10 + Neighbourhood_6_10 + Neighbourhood_10_1 + Neighbourhood_10_2 + Neighbourhood_10_3 + Neighbourhood_10_4 + Neighbourhood_10_5 + Neighbourhood_10_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((1 <= Neighbourhood_9_1 + Neighbourhood_9_2 + Neighbourhood_9_3 + Neighbourhood_9_4 + Neighbourhood_9_5 + Neighbourhood_9_6 + Neighbourhood_9_7 + Neighbourhood_9_8 + Neighbourhood_9_9 + Neighbourhood_9_10 + Neighbourhood_8_10 + Neighbourhood_7_10 + Neighbourhood_6_10 + Neighbourhood_10_1 + Neighbourhood_10_2 + Neighbourhood_10_3 + Neighbourhood_10_4 + Neighbourhood_10_5 + Neighbourhood_10_... (shortened)
lola: processed formula length: 2784
lola: 40 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((Neighbourhood_9_1 + Neighbourhood_9_2 + Neighbourhood_9_3 + Neighbourhood_9_4 + Neighbourhood_9_5 + Neighbourhood_9_6 + Neighbourhood_9_7 + Neighbourhood_9_8 + Neighbourhood_9_9 + Neighbourhood_9_10 + Neighbourhood_8_10 + Neighbourhood_7_10 + Neighbourhood_6_10 + Neighbourhood_10_1 + Neighbourhood_10_2 + Neighbourhood_10_3 + Neighbourhood_10_4 + Neighbourhood_10_5 + Neighbourhood_10_6 + Neighbourhood_10_7 + Neighbourhood_10_8 + Neighbourhood_10_9 + Neighbourhood_7_8 + Neighbourhood_5_10 + Neighbourhood_10_10 + Neighbourhood_7_7 + Neighbourhood_7_6 + Neighbourhood_7_5 + Neighbourhood_7_4 + Neighbourhood_7_3 + Neighbourhood_7_2 + Neighbourhood_7_1 + Neighbourhood_6_8 + Neighbourhood_6_7 + Neighbourhood_6_6 + Neighbourhood_4_10 + Neighbourhood_3_10 + Neighbourhood_2_10 + Neighbourhood_6_5 + Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_1_4 + Neighbourhood_1_5 + Neighbourhood_1_6 + Neighbourhood_1_7 + Neighbourhood_1_8 + Neighbourhood_6_4 + Neighbourhood_6_3 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_2_4 + Neighbourhood_2_5 + Neighbourhood_2_6 + Neighbourhood_2_7 + Neighbourhood_2_8 + Neighbourhood_6_2 + Neighbourhood_6_1 + Neighbourhood_3_1 + Neighbourhood_3_2 + Neighbourhood_3_3 + Neighbourhood_3_4 + Neighbourhood_3_5 + Neighbourhood_3_6 + Neighbourhood_3_7 + Neighbourhood_3_8 + Neighbourhood_5_8 + Neighbourhood_4_1 + Neighbourhood_4_2 + Neighbourhood_4_3 + Neighbourhood_4_4 + Neighbourhood_4_5 + Neighbourhood_4_6 + Neighbourhood_4_7 + Neighbourhood_4_8 + Neighbourhood_5_7 + Neighbourhood_5_1 + Neighbourhood_5_2 + Neighbourhood_5_3 + Neighbourhood_5_4 + Neighbourhood_5_5 + Neighbourhood_5_6 + Neighbourhood_4_9 + Neighbourhood_3_9 + Neighbourhood_5_9 + Neighbourhood_1_10 + Neighbourhood_2_9 + Neighbourhood_1_9 + Neighbourhood_6_9 + Neighbourhood_7_9 + Neighbourhood_8_1 + Neighbourhood_8_2 + Neighbourhood_8_3 + Neighbourhood_8_4 + Neighbourhood_8_5 + Neighbourhood_8_6 + Neighbourhood_8_7 + Neighbourhood_8_8 + Neighbourhood_8_9 <= 0) AND (Outside_10 + Outside_9 + Outside_8 + Outside_7 + Outside_6 + Outside_5 + Outside_4 + Outside_3 + Outside_2 + Outside_1 + 1 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_10 + Think_9)) OR ((Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_10 + Think_9 + 1 <= HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9 + HasRight_10) AND ((WaitRight_10 + WaitRight_1 + WaitRight_2 + WaitRight_3 + WaitRight_4 + WaitRight_5 + WaitRight_6 + WaitRight_7 + WaitRight_8 + WaitRight_9 <= 1) OR (Outside_10 + Outside_9 + Outside_8 + Outside_7 + Outside_6 + Outside_5 + Outside_4 + Outside_3 + Outside_2 + Outside_1 <= 0))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 9 will run for 487 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((A (F ((WaitLeft_6 <= Neighbourhood_1_5))) OR ((Neighbourhood_1_10 <= 1)))))
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((WaitLeft_6 <= Neighbourhood_1_5)) OR ((Neighbourhood_1_10 <= 1))))
lola: processed formula length: 74
lola: 41 rewrites
lola: closed formula file CTLCardinality.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: 8 markings, 15 edges
lola: ========================================
lola: subprocess 10 will run for 568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((Neighbourhood_10_8 + 1 <= Neighbourhood_9_2) AND (HasLeft_10 <= Neighbourhood_2_4)) U E (G ((Neighbourhood_8_6 <= WaitLeft_10)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(((Neighbourhood_10_8 + 1 <= Neighbourhood_9_2) AND (HasLeft_10 <= Neighbourhood_2_4)) U EG((Neighbourhood_8_6 <= WaitLeft_10)))
lola: processed formula length: 129
lola: 41 rewrites
lola: closed formula file CTLCardinality.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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 11 will run for 682 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((Neighbourhood_5_5 <= Think_7) U ((Neighbourhood_6_6 + 1 <= Neighbourhood_9_3) AND (Outside_4 + 1 <= Neighbourhood_7_10))))
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 (((Neighbourhood_5_5 <= Think_7) U ((Neighbourhood_6_6 + 1 <= Neighbourhood_9_3) AND (Outside_4 + 1 <= Neighbourhood_7_10))))
lola: processed formula length: 127
lola: 42 rewrites
lola: closed formula file CTLCardinality.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: ((Neighbourhood_6_6 + 1 <= Neighbourhood_9_3) AND (Outside_4 + 1 <= Neighbourhood_7_10))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-11-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 24332 markings, 69370 edges, 4866 markings/sec, 0 secs
lola: sara is running 5 secs || 50337 markings, 147336 edges, 5201 markings/sec, 5 secs
lola: sara is running 10 secs || 75858 markings, 226496 edges, 5104 markings/sec, 10 secs
lola: sara is running 15 secs || 101153 markings, 306094 edges, 5059 markings/sec, 15 secs
lola: sara is running 20 secs || 126531 markings, 386567 edges, 5076 markings/sec, 20 secs
lola: sara is running 25 secs || 151950 markings, 467104 edges, 5084 markings/sec, 25 secs
lola: sara is running 30 secs || 177156 markings, 547231 edges, 5041 markings/sec, 30 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 199045 markings, 617301 edges
lola: ========================================
lola: subprocess 12 will run for 842 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((2 <= Outside_10 + Outside_9 + Outside_8 + Outside_7 + Outside_6 + Outside_5 + Outside_4 + Outside_3 + Outside_2 + Outside_1) U (Outside_10 + Outside_9 + Outside_8 + Outside_7 + Outside_6 + Outside_5 + Outside_4 + Outside_3 + Outside_2 + Outside_1 <= HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9 + HasRight_10)))
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 (((2 <= Outside_10 + Outside_9 + Outside_8 + Outside_7 + Outside_6 + Outside_5 + Outside_4 + Outside_3 + Outside_2 + Outside_1) U (Outside_10 + Outside_9 + Outside_8 + Outside_7 + Outside_6 + Outside_5 + Outside_4 + Outside_3 + Outside_2 + Outside_1 <= HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9 + HasRight_10)))
lola: processed formula length: 386
lola: 42 rewrites
lola: closed formula file CTLCardinality.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: (Outside_10 + Outside_9 + Outside_8 + Outside_7 + Outside_6 + Outside_5 + Outside_4 + Outside_3 + Outside_2 + Outside_1 <= HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9 + HasRight_10)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-12-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 25360 markings, 72713 edges, 5072 markings/sec, 0 secs
lola: sara is running 5 secs || 50322 markings, 147287 edges, 4992 markings/sec, 5 secs
lola: sara is running 10 secs || 74913 markings, 223952 edges, 4918 markings/sec, 10 secs
lola: sara is running 15 secs || 99309 markings, 300581 edges, 4879 markings/sec, 15 secs
lola: sara is running 20 secs || 123783 markings, 377882 edges, 4895 markings/sec, 20 secs
lola: sara is running 25 secs || 148365 markings, 455687 edges, 4916 markings/sec, 25 secs
lola: sara is running 30 secs || 172955 markings, 533932 edges, 4918 markings/sec, 30 secs
lola: sara is running 35 secs || 197453 markings, 611850 edges, 4900 markings/sec, 35 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 199051 markings, 617350 edges
lola: ========================================
lola: subprocess 13 will run for 1110 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((A (F ((WaitRight_10 + WaitRight_1 + WaitRight_2 + WaitRight_3 + WaitRight_4 + WaitRight_5 + WaitRight_6 + WaitRight_7 + WaitRight_8 + WaitRight_9 <= Outside_10 + Outside_9 + Outside_8 + Outside_7 + Outside_6 + Outside_5 + Outside_4 + Outside_3 + Outside_2 + Outside_1))) OR (WaitRight_10 + WaitRight_1 + WaitRight_2 + WaitRight_3 + WaitRight_4 + WaitRight_5 + WaitRight_6 + WaitRight_7 + WaitR... (shortened)
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 ((F ((WaitRight_10 + WaitRight_1 + WaitRight_2 + WaitRight_3 + WaitRight_4 + WaitRight_5 + WaitRight_6 + WaitRight_7 + WaitRight_8 + WaitRight_9 <= Outside_10 + Outside_9 + Outside_8 + Outside_7 + Outside_6 + Outside_5 + Outside_4 + Outside_3 + Outside_2 + Outside_1)) OR (WaitRight_10 + WaitRight_1 + WaitRight_2 + WaitRight_3 + WaitRight_4 + WaitRight_5 + WaitRight_6 + WaitRight_7 + WaitRight_8 ... (shortened)
lola: processed formula length: 548
lola: 41 rewrites
lola: closed formula file CTLCardinality.xml
lola: the resulting Büchi automaton has 2 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: 69980 markings, 214041 edges, 13996 markings/sec, 0 secs
lola: 118618 markings, 370168 edges, 9728 markings/sec, 5 secs
lola: 157251 markings, 495135 edges, 7727 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The universal single path CTL formula holds.
lola: 199051 markings, 631375 edges
lola: ========================================
lola: subprocess 14 will run for 1656 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((Neighbourhood_9_1 + Neighbourhood_9_2 + Neighbourhood_9_3 + Neighbourhood_9_4 + Neighbourhood_9_5 + Neighbourhood_9_6 + Neighbourhood_9_7 + Neighbourhood_9_8 + Neighbourhood_9_9 + Neighbourhood_9_10 + Neighbourhood_8_10 + Neighbourhood_7_10 + Neighbourhood_6_10 + Neighbourhood_10_1 + Neighbourhood_10_2 + Neighbourhood_10_3 + Neighbourhood_10_4 + Neighbourhood_10_5 + Neighbourhood_10_6 + Ne... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1656 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((Neighbourhood_9_1 + Neighbourhood_9_2 + Neighbourhood_9_3 + Neighbourhood_9_4 + Neighbourhood_9_5 + Neighbourhood_9_6 + Neighbourhood_9_7 + Neighbourhood_9_8 + Neighbourhood_9_9 + Neighbourhood_9_10 + Neighbourhood_8_10 + Neighbourhood_7_10 + Neighbourhood_6_10 + Neighbourhood_10_1 + Neighbourhood_10_2 + Neighbourhood_10_3 + Neighbourhood_10_4 + Neighbourhood_10_5 + Neighbourhood_10_6 + Nei... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((Neighbourhood_9_1 + Neighbourhood_9_2 + Neighbourhood_9_3 + Neighbourhood_9_4 + Neighbourhood_9_5 + Neighbourhood_9_6 + Neighbourhood_9_7 + Neighbourhood_9_8 + Neighbourhood_9_9 + Neighbourhood_9_10 + Neighbourhood_8_10 + Neighbourhood_7_10 + Neighbourhood_6_10 + Neighbourhood_10_1 + Neighbourhood_10_2 + Neighbourhood_10_3 + Neighbourhood_10_4 + Neighbourhood_10_5 + Neighbourhood_10_6 + Nei... (shortened)
lola: processed formula length: 2032
lola: 41 rewrites
lola: closed formula file CTLCardinality.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: (3 <= Neighbourhood_9_1 + Neighbourhood_9_2 + Neighbourhood_9_3 + Neighbourhood_9_4 + Neighbourhood_9_5 + Neighbourhood_9_6 + Neighbourhood_9_7 + Neighbourhood_9_8 + Neighbourhood_9_9 + Neighbourhood_9_10 + Neighbourhood_8_10 + Neighbourhood_7_10 + Neighbourhood_6_10 + Neighbourhood_10_1 + Neighbourhood_10_2 + Neighbourhood_10_3 + Neighbourhood_10_4 + Neighbourhood_10_5 + Neighbourhood_10_6 + Neighbourhood_10_7 + Neighbourhood_10_8 + Neighbourhood_10_9 + Neighbourhood_7_8 + Neighbourhood_5_10 + Neighbourhood_10_10 + Neighbourhood_7_7 + Neighbourhood_7_6 + Neighbourhood_7_5 + Neighbourhood_7_4 + Neighbourhood_7_3 + Neighbourhood_7_2 + Neighbourhood_7_1 + Neighbourhood_6_8 + Neighbourhood_6_7 + Neighbourhood_6_6 + Neighbourhood_4_10 + Neighbourhood_3_10 + Neighbourhood_2_10 + Neighbourhood_6_5 + Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_1_4 + Neighbourhood_1_5 + Neighbourhood_1_6 + Neighbourhood_1_7 + Neighbourhood_1_8 + Neighbourhood_6_4 + Neighbourhood_6_3 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_2_4 + Neighbourhood_2_5 + Neighbourhood_2_6 + Neighbourhood_2_7 + Neighbourhood_2_8 + Neighbourhood_6_2 + Neighbourhood_6_1 + Neighbourhood_3_1 + Neighbourhood_3_2 + Neighbourhood_3_3 + Neighbourhood_3_4 + Neighbourhood_3_5 + Neighbourhood_3_6 + Neighbourhood_3_7 + Neighbourhood_3_8 + Neighbourhood_5_8 + Neighbourhood_4_1 + Neighbourhood_4_2 + Neighbourhood_4_3 + Neighbourhood_4_4 + Neighbourhood_4_5 + Neighbourhood_4_6 + Neighbourhood_4_7 + Neighbourhood_4_8 + Neighbourhood_5_7 + Neighbourhood_5_1 + Neighbourhood_5_2 + Neighbourhood_5_3 + Neighbourhood_5_4 + Neighbourhood_5_5 + Neighbourhood_5_6 + Neighbourhood_4_9 + Neighbourhood_3_9 + Neighbourhood_5_9 + Neighbourhood_1_10 + Neighbourhood_2_9 + Neighbourhood_1_9 + Neighbourhood_6_9 + Neighbourhood_7_9 + Neighbourhood_8_1 + Neighbourhood_8_2 + Neighbourhood_8_3 + Neighbourhood_8_4 + Neighbourhood_8_5 + Neighbourhood_8_6 + Neighbourhood_8_7 + Neighbourhood_8_8 + Neighbourhood_8_9)
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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 15 will run for 3313 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((Neighbourhood_9_1 + Neighbourhood_9_2 + Neighbourhood_9_3 + Neighbourhood_9_4 + Neighbourhood_9_5 + Neighbourhood_9_6 + Neighbourhood_9_7 + Neighbourhood_9_8 + Neighbourhood_9_9 + Neighbourhood_9_10 + Neighbourhood_8_10 + Neighbourhood_7_10 + Neighbourhood_6_10 + Neighbourhood_10_1 + Neighbourhood_10_2 + Neighbourhood_10_3 + Neighbourhood_10_4 + Neighbourhood_10_5 + Neighbourhood_10_6 + Nei... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (3 <= Neighbourhood_9_1 + Neighbourhood_9_2 + Neighbourhood_9_3 + Neighbourhood_9_4 + Neighbourhood_9_5 + Neighbourhood_9_6 + Neighbourhood_9_7 + Neighbourhood_9_8 + Neighbourhood_9_9 + Neighbourhood_9_10 + Neighbourhood_8_10 + Neighbourhood_7_10 + Neighbourhood_6_10 + Neighbourhood_10_1 + Neighbourhood_10_2 + Neighbourhood_10_3 + Neighbourhood_10_4 + Neighbourhood_10_5 + Neighbourhood_10_6 + Neig... (shortened)
lola: processed formula length: 2024
lola: 42 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: formula 0: (Neighbourhood_9_1 + Neighbourhood_9_2 + Neighbourhood_9_3 + Neighbourhood_9_4 + Neighbourhood_9_5 + Neighbourhood_9_6 + Neighbourhood_9_7 + Neighbourhood_9_8 + Neighbourhood_9_9 + Neighbourhood_9_10 + Neighbourhood_8_10 + Neighbourhood_7_10 + Neighbourhood_6_10 + Neighbourhood_10_1 + Neighbourhood_10_2 + Neighbourhood_10_3 + Neighbourhood_10_4 + Neighbourhood_10_5 + Neighbourhood_10_6 + Neighbourhood_10_7 + Neighbourhood_10_8 + Neighbourhood_10_9 + Neighbourhood_7_8 + Neighbourhood_5_10 + Neighbourhood_10_10 + Neighbourhood_7_7 + Neighbourhood_7_6 + Neighbourhood_7_5 + Neighbourhood_7_4 + Neighbourhood_7_3 + Neighbourhood_7_2 + Neighbourhood_7_1 + Neighbourhood_6_8 + Neighbourhood_6_7 + Neighbourhood_6_6 + Neighbourhood_4_10 + Neighbourhood_3_10 + Neighbourhood_2_10 + Neighbourhood_6_5 + Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_1_4 + Neighbourhood_1_5 + Neighbourhood_1_6 + Neighbourhood_1_7 + Neighbourhood_1_8 + Neighbourhood_6_4 + Neighbourhood_6_3 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_2_4 + Neighbourhood_2_5 + Neighbourhood_2_6 + Neighbourhood_2_7 + Neighbourhood_2_8 + Neighbourhood_6_2 + Neighbourhood_6_1 + Neighbourhood_3_1 + Neighbourhood_3_2 + Neighbourhood_3_3 + Neighbourhood_3_4 + Neighbourhood_3_5 + Neighbourhood_3_6 + Neighbourhood_3_7 + Neighbourhood_3_8 + Neighbourhood_5_8 + Neighbourhood_4_1 + Neighbourhood_4_2 + Neighbourhood_4_3 + Neighbourhood_4_4 + Neighbourhood_4_5 + Neighbourhood_4_6 + Neighbourhood_4_7 + Neighbourhood_4_8 + Neighbourhood_5_7 + Neighbourhood_5_1 + Neighbourhood_5_2 + Neighbourhood_5_3 + Neighbourhood_5_4 + Neighbourhood_5_5 + Neighbourhood_5_6 + Neighbourhood_4_9 + Neighbourhood_3_9 + Neighbourhood_5_9 + Neighbourhood_1_10 + Neighbourhood_2_9 + Neighbourhood_1_9 + Neighbourhood_6_9 + Neighbourhood_7_9 + Neighbourhood_8_1 + Neighbourhood_8_2 + Neighbourhood_8_3 + Neighbourhood_8_4 + Neighbourhood_8_5 + Neighbourhood_8_6 + Neighbourhood_8_7 + Neighbourhood_8_8 + Neighbourhood_8_9 <= 2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 3313 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (((3 <= Forks_1 + Forks_2 + Forks_3 + Forks_4 + Forks_5 + Forks_6 + Forks_7 + Forks_8 + Forks_9 + Forks_10) U (2 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_10 + Think_9))) AND (2 <= Neighbourhood_9_1 + Neighbourhood_9_2 + Neighbourhood_9_3 + Neighbourhood_9_4 + Neighbourhood_9_5 + Neighbourhood_9_6 + Neighbourhood_9_7 + Neighbourhood_9_8 + Neighbou... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3313 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((WaitLeft_10 + WaitLeft_1 + WaitLeft_2 + WaitLeft_3 + WaitLeft_4 + WaitLeft_5 + WaitLeft_6 + WaitLeft_7 + WaitLeft_8 + WaitLeft_9 <= 2)))
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 ((WaitLeft_10 + WaitLeft_1 + WaitLeft_2 + WaitLeft_3 + WaitLeft_4 + WaitLeft_5 + WaitLeft_6 + WaitLeft_7 + WaitLeft_8 + WaitLeft_9 <= 2)))
lola: processed formula length: 143
lola: 41 rewrites
lola: closed formula file CTLCardinality.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: (3 <= WaitLeft_10 + WaitLeft_1 + WaitLeft_2 + WaitLeft_3 + WaitLeft_4 + WaitLeft_5 + WaitLeft_6 + WaitLeft_7 + WaitLeft_8 + WaitLeft_9)
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: 6 markings, 5 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= Neighbourhood_9_1 + Neighbourhood_9_2 + Neighbourhood_9_3 + Neighbourhood_9_4 + Neighbourhood_9_5 + Neighbourhood_9_6 + Neighbourhood_9_7 + Neighbourhood_9_8 + Neighbourhood_9_9 + Neighbourhood_9_10 + Neighbourhood_8_10 + Neighbourhood_7_10 + Neighbourhood_6_10 + Neighbourhood_10_1 + Neighbourhood_10_2 + Neighbourhood_10_3 + Neighbourhood_10_4 + Neighbourhood_10_5 + Neighbourhood_10_6 + Neig... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= Neighbourhood_9_1 + Neighbourhood_9_2 + Neighbourhood_9_3 + Neighbourhood_9_4 + Neighbourhood_9_5 + Neighbourhood_9_6 + Neighbourhood_9_7 + Neighbourhood_9_8 + Neighbourhood_9_9 + Neighbourhood_9_10 + Neighbourhood_8_10 + Neighbourhood_7_10 + Neighbourhood_6_10 + Neighbourhood_10_1 + Neighbourhood_10_2 + Neighbourhood_10_3 + Neighbourhood_10_4 + Neighbourhood_10_5 + Neighbourhood_10_6 + Neig... (shortened)
lola: processed formula length: 2024
lola: 39 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes no yes yes yes no no yes no no yes no yes yes
lola:
preliminary result: yes no yes no yes yes yes no no yes no no yes no yes yes
lola: memory consumption: 110896 KB
lola: time consumption: 257 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

BK_STOP 1552814706563

--------------------
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="PhilosophersDyn-PT-10"
export BK_EXAMINATION="CTLCardinality"
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 PhilosophersDyn-PT-10, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r115-smll-155272315400058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-PT-10.tgz
mv PhilosophersDyn-PT-10 execution
cd execution
if [ "CTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;