fond
Model Checking Contest 2019
9th edition, Prague, Czech Republic, April 7, 2019 (TOOLympics)
Execution of r005-smll-155225009200274
Last Updated
Apr 15, 2019

About the Execution of LoLA for AirplaneLD-PT-0010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4274.600 5032.00 5222.00 47.30 TTFFFFTFFTFFFTFT normal

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.r005-smll-155225009200274.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 AirplaneLD-PT-0010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-smll-155225009200274
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 324K
-rw-r--r-- 1 mcc users 7.4K Feb 9 05:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 9 05:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 5 02:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 28K Feb 5 02:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 105 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 343 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 4.2K Feb 4 22:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Feb 4 22:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 4 22:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.9K Feb 4 22:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Feb 1 23:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 31K Feb 1 23:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Jan 29 09:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Jan 29 09:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Feb 4 22:17 UpperBounds.xml

-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 85K 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 AirplaneLD-PT-0010-CTLCardinality-00
FORMULA_NAME AirplaneLD-PT-0010-CTLCardinality-01
FORMULA_NAME AirplaneLD-PT-0010-CTLCardinality-02
FORMULA_NAME AirplaneLD-PT-0010-CTLCardinality-03
FORMULA_NAME AirplaneLD-PT-0010-CTLCardinality-04
FORMULA_NAME AirplaneLD-PT-0010-CTLCardinality-05
FORMULA_NAME AirplaneLD-PT-0010-CTLCardinality-06
FORMULA_NAME AirplaneLD-PT-0010-CTLCardinality-07
FORMULA_NAME AirplaneLD-PT-0010-CTLCardinality-08
FORMULA_NAME AirplaneLD-PT-0010-CTLCardinality-09
FORMULA_NAME AirplaneLD-PT-0010-CTLCardinality-10
FORMULA_NAME AirplaneLD-PT-0010-CTLCardinality-11
FORMULA_NAME AirplaneLD-PT-0010-CTLCardinality-12
FORMULA_NAME AirplaneLD-PT-0010-CTLCardinality-13
FORMULA_NAME AirplaneLD-PT-0010-CTLCardinality-14
FORMULA_NAME AirplaneLD-PT-0010-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552721249706

info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ AirplaneLD-PT-0010 @ 3570 seconds

FORMULA AirplaneLD-PT-0010-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-PT-0010-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-PT-0010-CTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-PT-0010-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-PT-0010-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-PT-0010-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-PT-0010-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-PT-0010-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA AirplaneLD-PT-0010-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-PT-0010-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-PT-0010-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-PT-0010-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-PT-0010-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-PT-0010-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-PT-0010-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3565
rslt: Output for CTLCardinality @ AirplaneLD-PT-0010

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2019",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=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": "Sat Mar 16 07:27:29 2019
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"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": "FALSE",
"processed_size": 5,
"rewrites": 59
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 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": "FALSE",
"processed_size": 5,
"rewrites": 59
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 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": "FALSE",
"processed_size": 5,
"rewrites": 59
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"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": 59
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 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": "FALSE",
"processed_size": 5,
"rewrites": 59
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 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": "FALSE",
"processed_size": 5,
"rewrites": 59
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"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": 59
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(Speed_Right_Wheel_7 <= 0)",
"processed_size": 26,
"rewrites": 62
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space /EXEG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(P2 <= stp1)",
"processed_size": 12,
"rewrites": 62
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "AG(EX((P6 <= Weight_Left_Wheel_on + Weight_Left_Wheel_off)))",
"processed_size": 60,
"rewrites": 61
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 10,
"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": 9,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"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": "AF(AX(((1 <= Speed_Right_Wheel_10 + Speed_Right_Wheel_9 + Speed_Right_Wheel_8 + Speed_Right_Wheel_7 + Speed_Right_Wheel_6 + Speed_Right_Wheel_5 + Speed_Right_Wheel_4 + Speed_Right_Wheel_1 + Speed_Right_Wheel_2 + Speed_Right_Wheel_3))))",
"processed_size": 235,
"rewrites": 61
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 46494,
"markings": 37341,
"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": 713
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "A (G (((P5 <= Speed_Right_Wheel_10 + Speed_Right_Wheel_9 + Speed_Right_Wheel_8 + Speed_Right_Wheel_7 + Speed_Right_Wheel_6 + Speed_Right_Wheel_5 + Speed_Right_Wheel_4 + Speed_Right_Wheel_1 + Speed_Right_Wheel_2 + Speed_Right_Wheel_3))))",
"processed_size": 236,
"rewrites": 61
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"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": 891
},
"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": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "(Speed_Right_Wheel_10 + Speed_Right_Wheel_9 + Speed_Right_Wheel_8 + Speed_Right_Wheel_7 + Speed_Right_Wheel_6 + Speed_Right_Wheel_5 + Speed_Right_Wheel_4 + Speed_Right_Wheel_1 + Speed_Right_Wheel_2 + Speed_Right_Wheel_3 <= stp2)",
"processed_size": 228,
"rewrites": 62
},
"result":
{
"edges": 5834,
"markings": 5647,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 22
},
"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": 11,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "AF(EG(((1 <= P3))))",
"processed_size": 19,
"rewrites": 61
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 15,
"markings": 8,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"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": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "EG((AF((Speed_Right_Wheel_3 <= Plane_On_Ground_Signal_no_F)) AND ((TheAltitude_10 <= TheAltitude_16))))",
"processed_size": 103,
"rewrites": 61
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 15,
"markings": 8,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"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": "(P3 + 1 <= stp5)",
"processed_size": 16,
"rewrites": 62
},
"result":
{
"edges": 851,
"markings": 852,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 31
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"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": "(P3 + 1 <= stp5)",
"processed_size": 16,
"rewrites": 62
},
"result":
{
"edges": 851,
"markings": 852,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 31
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"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": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "A (G ((P1 <= Speed_Left_Wheel_10 + Speed_Left_Wheel_9 + Speed_Left_Wheel_8 + Speed_Left_Wheel_7 + Speed_Left_Wheel_6 + Speed_Left_Wheel_5 + Speed_Left_Wheel_4 + Speed_Left_Wheel_3 + Speed_Left_Wheel_2 + Speed_Left_Wheel_1)))",
"processed_size": 224,
"rewrites": 61
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 17,
"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"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 21712,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(E(X(*)) OR (A(F(*)) OR A(G(**)))) : A(F(A(X(**)))) : FALSE : A(F(E(G(**)))) : FALSE : DEADLOCK : (A(F(**)) OR (A(G(**)) AND A(F(**)))) : (A(G(E(X(**)))) AND E(G(E(F(**))))) : FALSE : TRUE : A(X(A(F(**)))) : FALSE : FALSE : TRUE : A(F(**)) : E(G((A(F(**)) AND **)))"
},
"net":
{
"arcs": 333,
"conflict_clusters": 11,
"places": 89,
"places_significant": 54,
"singleton_clusters": 0,
"transitions": 88
},
"result":
{
"preliminary_value": "yes yes no no no no yes no no yes no no no yes no yes ",
"value": "yes yes no no no no yes no no yes no no no yes no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 177/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2848
lola: finding significant places
lola: 89 places, 88 transitions, 54 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: place invariant simplifies atomic proposition
lola: before: (1 <= SpeedPossibleVal_9 + SpeedPossibleVal_8 + SpeedPossibleVal_7 + SpeedPossibleVal_6 + SpeedPossibleVal_5 + SpeedPossibleVal_4 + SpeedPossibleVal_10 + SpeedPossibleVal_3 + SpeedPossibleVal_2 + SpeedPossibleVal_1)
lola: after: (0 <= 9)
lola: place invariant simplifies atomic proposition
lola: before: (P4 <= AltitudePossibleVal_20 + AltitudePossibleVal_19 + AltitudePossibleVal_18 + AltitudePossibleVal_17 + AltitudePossibleVal_16 + AltitudePossibleVal_15 + AltitudePossibleVal_14 + AltitudePossibleVal_13 + AltitudePossibleVal_12 + AltitudePossibleVal_11 + AltitudePossibleVal_10 + AltitudePossibleVal_9 + AltitudePossibleVal_8 + AltitudePossibleVal_7 + AltitudePossibleVal_6 + AltitudePossibleVal_5 + AltitudePossibleVal_4 + AltitudePossibleVal_3 + AltitudePossibleVal_2 + AltitudePossibleVal_1)
lola: after: (P4 <= 20)
lola: LP says that atomic proposition is always true: (P4 <= 20)
lola: place invariant simplifies atomic proposition
lola: before: (Speed_Left_Wheel_10 + Speed_Left_Wheel_9 + Speed_Left_Wheel_8 + Speed_Left_Wheel_7 + Speed_Left_Wheel_6 + Speed_Left_Wheel_5 + Speed_Left_Wheel_4 + Speed_Left_Wheel_3 + Speed_Left_Wheel_2 + Speed_Left_Wheel_1 <= WeightPossibleVal_off + WeightPossibleVal_on)
lola: after: (Speed_Left_Wheel_10 + Speed_Left_Wheel_9 + Speed_Left_Wheel_8 + Speed_Left_Wheel_7 + Speed_Left_Wheel_6 + Speed_Left_Wheel_5 + Speed_Left_Wheel_4 + Speed_Left_Wheel_3 + Speed_Left_Wheel_2 + Speed_Left_Wheel_1 <= 2)
lola: LP says that atomic proposition is always true: (Speed_Left_Wheel_10 + Speed_Left_Wheel_9 + Speed_Left_Wheel_8 + Speed_Left_Wheel_7 + Speed_Left_Wheel_6 + Speed_Left_Wheel_5 + Speed_Left_Wheel_4 + Speed_Left_Wheel_3 + Speed_Left_Wheel_2 + Speed_Left_Wheel_1 <= 2)
lola: place invariant simplifies atomic proposition
lola: before: (P5 <= WeightPossibleVal_off + WeightPossibleVal_on)
lola: after: (P5 <= 2)
lola: LP says that atomic proposition is always true: (P5 <= 2)
lola: LP says that atomic proposition is always false: (2 <= stp5)
lola: LP says that atomic proposition is always false: (3 <= Weight_Left_Wheel_on + Weight_Left_Wheel_off)
lola: LP says that atomic proposition is always false: (3 <= TheAltitude_20 + TheAltitude_19 + TheAltitude_18 + TheAltitude_17 + TheAltitude_16 + TheAltitude_15 + TheAltitude_14 + TheAltitude_13 + TheAltitude_12 + TheAltitude_11 + TheAltitude_1 + TheAltitude_2 + TheAltitude_3 + TheAltitude_4 + TheAltitude_5 + TheAltitude_6 + TheAltitude_7 + TheAltitude_8 + TheAltitude_9 + TheAltitude_10)
lola: LP says that atomic proposition is always false: (2 <= TheAltitude_20 + TheAltitude_19 + TheAltitude_18 + TheAltitude_17 + TheAltitude_16 + TheAltitude_15 + TheAltitude_14 + TheAltitude_13 + TheAltitude_12 + TheAltitude_11 + TheAltitude_1 + TheAltitude_2 + TheAltitude_3 + TheAltitude_4 + TheAltitude_5 + TheAltitude_6 + TheAltitude_7 + TheAltitude_8 + TheAltitude_9 + TheAltitude_10)
lola: LP says that atomic proposition is always false: (2 <= Plane_On_Ground_Signal_no_F + Plane_On_Ground_Signal_no_T)
lola: LP says that atomic proposition is always false: (3 <= Plane_On_Ground_Signal_no_F + Plane_On_Ground_Signal_no_T)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= AltitudePossibleVal_3)
lola: after: (1 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= AltitudePossibleVal_12)
lola: after: (1 <= 0)
lola: LP says that atomic proposition is always false: (2 <= Weight_Left_Wheel_off)
lola: LP says that atomic proposition is always false: (2 <= Speed_Left_Wheel_1)
lola: place invariant simplifies atomic proposition
lola: before: (Speed_Right_Wheel_4 <= AltitudePossibleVal_7)
lola: after: (Speed_Right_Wheel_4 <= 1)
lola: LP says that atomic proposition is always true: (Speed_Right_Wheel_4 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= SpeedPossibleVal_9)
lola: after: (2 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= WeightPossibleVal_on)
lola: after: (2 <= 0)
lola: LP says that atomic proposition is always false: (3 <= P3)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= SpeedPossibleVal_5)
lola: after: (2 <= 0)
lola: LP says that atomic proposition is always false: (3 <= stp1)
lola: place invariant simplifies atomic proposition
lola: before: (TheAltitude_3 <= AltitudePossibleVal_7)
lola: after: (TheAltitude_3 <= 1)
lola: LP says that atomic proposition is always true: (TheAltitude_3 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (SpeedPossibleVal_1 <= SpeedPossibleVal_8)
lola: after: (0 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (AltitudePossibleVal_8 <= TheAltitude_2)
lola: after: (1 <= TheAltitude_2)
lola: place invariant simplifies atomic proposition
lola: before: (AltitudePossibleVal_14 <= Speed_Left_Wheel_2)
lola: after: (1 <= Speed_Left_Wheel_2)
lola: LP says that atomic proposition is always false: (3 <= TheAltitude_18)
lola: place invariant simplifies atomic proposition
lola: before: (Speed_Right_Wheel_6 <= AltitudePossibleVal_2)
lola: after: (Speed_Right_Wheel_6 <= 1)
lola: LP says that atomic proposition is always true: (Speed_Right_Wheel_6 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= SpeedPossibleVal_7)
lola: after: (0 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (AltitudePossibleVal_3 <= TheAltitude_2)
lola: after: (1 <= TheAltitude_2)
lola: LP says that atomic proposition is always false: (2 <= Speed_Right_Wheel_4)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= SpeedPossibleVal_7)
lola: after: (2 <= 0)
lola: (NOT((A (F ((0 <= 9))) AND A (X ((P2 <= Weight_Right_Wheel_off + Weight_Right_Wheel_on))))) OR (NOT(E (G ((Speed_Right_Wheel_10 + Speed_Right_Wheel_9 + Speed_Right_Wheel_8 + Speed_Right_Wheel_7 + Speed_Right_Wheel_6 + Speed_Right_Wheel_5 + Speed_Right_Wheel_4 + Speed_Right_Wheel_1 + Speed_Right_Wheel_2 + Speed_Right_Wheel_3 <= stp2)))) OR A (G (((P5 <= Speed_Right_Wheel_10 + Speed_Right_Wheel_9 + Speed_Right_Wheel_8 + Speed_Right_Wheel_7 + Speed_Right_Wheel_6 + Speed_Right_Wheel_5 + Speed_Right_Wheel_4 + Speed_Right_Wheel_1 + Speed_Right_Wheel_2 + Speed_Right_Wheel_3)))))) : A (F (A (X (((1 <= Speed_Right_Wheel_10 + Speed_Right_Wheel_9 + Speed_Right_Wheel_8 + Speed_Right_Wheel_7 + Speed_Right_Wheel_6 + Speed_Right_Wheel_5 + Speed_Right_Wheel_4 + Speed_Right_Wheel_1 + Speed_Right_Wheel_2 + Speed_Right_Wheel_3)))))) : (E ((((P6 <= Speed_Right_Wheel_10 + Speed_Right_Wheel_9 + Speed_Right_Wheel_8 + Speed_Right_Wheel_7 + Speed_Right_Wheel_6 + Speed_Right_Wheel_5 + Speed_Right_Wheel_4 + Speed_Right_Wheel_1 + Speed_Right_Wheel_2 + Speed_Right_Wheel_3)) U ())) OR (3 <= TheAltitude_20 + TheAltitude_19 + TheAltitude_18 + TheAltitude_17 + TheAltitude_16 + TheAltitude_15 + TheAltitude_14 + TheAltitude_13 + TheAltitude_12 + TheAltitude_11 + TheAltitude_1 + TheAltitude_2 + TheAltitude_3 + TheAltitude_4 + TheAltitude_5 + TheAltitude_6 + TheAltitude_7 + TheAltitude_8 + TheAltitude_9 + TheAltitude_10)) : A (F (E (G (((1 <= P3)))))) : NOT(A (G (()))) : A (X ((E (F ((2 <= Plane_On_Ground_Signal_no_F + Plane_On_Ground_Signal_no_T))) OR A (G ((3 <= Plane_On_Ground_Signal_no_F + Plane_On_Ground_Signal_no_T)))))) : A ((A (G ((P1 <= Speed_Left_Wheel_10 + Speed_Left_Wheel_9 + Speed_Left_Wheel_8 + Speed_Left_Wheel_7 + Speed_Left_Wheel_6 + Speed_Left_Wheel_5 + Speed_Left_Wheel_4 + Speed_Left_Wheel_3 + Speed_Left_Wheel_2 + Speed_Left_Wheel_1))) U A (F ((stp5 <= P3))))) : (A (G (E (X ((P6 <= Weight_Left_Wheel_on + Weight_Left_Wheel_off))))) AND E (G (E (F ((P2 <= stp1)))))) : ((TheAltitude_16 <= P4) AND E (F (A (G ((1 <= 0)))))) : E (G (())) : A (X (A (((Speed_Right_Wheel_4 <= 1) U (1 <= Speed_Right_Wheel_7))))) : NOT(A (G (()))) : A ((E (X ((3 <= P3))) U E (F ((2 <= 0))))) : NOT(A (F (()))) : (() AND A (((0 <= 0) U ((TheAltitude_3 <= TheAltitude_16) AND (1 <= TheAltitude_2))))) : E (G ((A (F ((Speed_Right_Wheel_3 <= Plane_On_Ground_Signal_no_F))) AND ((TheAltitude_10 <= TheAltitude_16)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:116
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:122
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:279
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:479
lola: rewrite Frontend/Parser/formula_rewrite.k:392
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
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:279
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:133
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:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 59 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 59 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: DEADLOCK
lola: processed formula length: 8
lola: 59 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 59 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 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: 59 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 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 59 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 59 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 396 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: 59 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 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((1 <= Speed_Right_Wheel_7)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:754
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (Speed_Right_Wheel_7 <= 0)
lola: processed formula length: 26
lola: 62 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 /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= Speed_Right_Wheel_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 /EXEG
lola: The predicate does not eventually occur from all successors.
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (E (X ((P6 <= Weight_Left_Wheel_on + Weight_Left_Wheel_off))))) AND E (G (E (F ((P2 <= stp1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((P2 <= stp1)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:593
lola: rewrite Frontend/Parser/formula_rewrite.k:628
lola: rewrite Frontend/Parser/formula_rewrite.k:731
lola: processed formula: (P2 <= stp1)
lola: processed formula length: 12
lola: 62 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 /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((P6 <= Weight_Left_Wheel_on + Weight_Left_Wheel_off)))))
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((P6 <= Weight_Left_Wheel_on + Weight_Left_Wheel_off)))
lola: processed formula length: 60
lola: 61 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: 7 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (X (((1 <= Speed_Right_Wheel_10 + Speed_Right_Wheel_9 + Speed_Right_Wheel_8 + Speed_Right_Wheel_7 + Speed_Right_Wheel_6 + Speed_Right_Wheel_5 + Speed_Right_Wheel_4 + Speed_Right_Wheel_1 + Speed_Right_Wheel_2 + Speed_Right_Wheel_3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(AX(((1 <= Speed_Right_Wheel_10 + Speed_Right_Wheel_9 + Speed_Right_Wheel_8 + Speed_Right_Wheel_7 + Speed_Right_Wheel_6 + Speed_Right_Wheel_5 + Speed_Right_Wheel_4 + Speed_Right_Wheel_1 + Speed_Right_Wheel_2 + Speed_Right_Wheel_3))))
lola: processed formula length: 235
lola: 61 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 37341 markings, 46494 edges
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X ((Weight_Right_Wheel_off + Weight_Right_Wheel_on + 1 <= P2))) OR (A (F ((stp2 + 1 <= Speed_Right_Wheel_10 + Speed_Right_Wheel_9 + Speed_Right_Wheel_8 + Speed_Right_Wheel_7 + Speed_Right_Wheel_6 + Speed_Right_Wheel_5 + Speed_Right_Wheel_4 + Speed_Right_Wheel_1 + Speed_Right_Wheel_2 + Speed_Right_Wheel_3))) OR A (G (((P5 <= Speed_Right_Wheel_10 + Speed_Right_Wheel_9 + Speed_Right_Wheel_8 + Spe... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((P5 <= Speed_Right_Wheel_10 + Speed_Right_Wheel_9 + Speed_Right_Wheel_8 + Speed_Right_Wheel_7 + Speed_Right_Wheel_6 + Speed_Right_Wheel_5 + Speed_Right_Wheel_4 + Speed_Right_Wheel_1 + Speed_Right_Wheel_2 + Speed_Right_Wheel_3))))
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 (((P5 <= Speed_Right_Wheel_10 + Speed_Right_Wheel_9 + Speed_Right_Wheel_8 + Speed_Right_Wheel_7 + Speed_Right_Wheel_6 + Speed_Right_Wheel_5 + Speed_Right_Wheel_4 + Speed_Right_Wheel_1 + Speed_Right_Wheel_2 + Speed_Right_Wheel_3))))
lola: processed formula length: 236
lola: 61 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: ((Speed_Right_Wheel_10 + Speed_Right_Wheel_9 + Speed_Right_Wheel_8 + Speed_Right_Wheel_7 + Speed_Right_Wheel_6 + Speed_Right_Wheel_5 + Speed_Right_Wheel_4 + Speed_Right_Wheel_1 + Speed_Right_Wheel_2 + Speed_Right_Wheel_3 + 1 <= P5))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((stp2 + 1 <= Speed_Right_Wheel_10 + Speed_Right_Wheel_9 + Speed_Right_Wheel_8 + Speed_Right_Wheel_7 + Speed_Right_Wheel_6 + Speed_Right_Wheel_5 + Speed_Right_Wheel_4 + Speed_Right_Wheel_1 + Speed_Right_Wheel_2 + Speed_Right_Wheel_3)))
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: (Speed_Right_Wheel_10 + Speed_Right_Wheel_9 + Speed_Right_Wheel_8 + Speed_Right_Wheel_7 + Speed_Right_Wheel_6 + Speed_Right_Wheel_5 + Speed_Right_Wheel_4 + Speed_Right_Wheel_1 + Speed_Right_Wheel_2 + Speed_Right_Wheel_3 <= stp2)
lola: processed formula length: 228
lola: 62 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: (stp2 + 1 <= Speed_Right_Wheel_10 + Speed_Right_Wheel_9 + Speed_Right_Wheel_8 + Speed_Right_Wheel_7 + Speed_Right_Wheel_6 + Speed_Right_Wheel_5 + Speed_Right_Wheel_4 + Speed_Right_Wheel_1 + Speed_Right_Wheel_2 + Speed_Right_Wheel_3)
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.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 5647 markings, 5834 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((TheAltitude_3 <= TheAltitude_16) AND (1 <= TheAltitude_2))))
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: ((TheAltitude_16 + 1 <= TheAltitude_3) OR (TheAltitude_2 <= 0))
lola: processed formula length: 64
lola: 62 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: ((TheAltitude_3 <= TheAltitude_16) AND (1 <= TheAltitude_2))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((1 <= P3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG(((1 <= P3))))
lola: processed formula length: 19
lola: 61 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 8 markings, 15 edges
lola: ========================================
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((A (F ((Speed_Right_Wheel_3 <= Plane_On_Ground_Signal_no_F))) AND ((TheAltitude_10 <= TheAltitude_16)))))
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((Speed_Right_Wheel_3 <= Plane_On_Ground_Signal_no_F)) AND ((TheAltitude_10 <= TheAltitude_16))))
lola: processed formula length: 103
lola: 61 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 15 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((stp5 <= P3))) OR (A (G ((P1 <= Speed_Left_Wheel_10 + Speed_Left_Wheel_9 + Speed_Left_Wheel_8 + Speed_Left_Wheel_7 + Speed_Left_Wheel_6 + Speed_Left_Wheel_5 + Speed_Left_Wheel_4 + Speed_Left_Wheel_3 + Speed_Left_Wheel_2 + Speed_Left_Wheel_1))) AND A (F ((stp5 <= P3)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((stp5 <= P3)))
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: (P3 + 1 <= stp5)
lola: processed formula length: 16
lola: 62 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: (stp5 <= P3)
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-15-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 852 markings, 851 edges
lola: ========================================
lola: state equation: calling and running sara
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (F ((stp5 <= P3))) OR (A (G ((P1 <= Speed_Left_Wheel_10 + Speed_Left_Wheel_9 + Speed_Left_Wheel_8 + Speed_Left_Wheel_7 + Speed_Left_Wheel_6 + Speed_Left_Wheel_5 + Speed_Left_Wheel_4 + Speed_Left_Wheel_3 + Speed_Left_Wheel_2 + Speed_Left_Wheel_1))) AND A (F ((stp5 <= P3)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
sara: try reading problem file CTLCardinality-15-0.sara.
lola: ========================================
lola: ...considering subproblem: A (F ((stp5 <= P3)))
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: (P3 + 1 <= stp5)
lola: processed formula length: 16
lola: 62 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: (stp5 <= P3)
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 / EG
lola: The predicate eventually occurs.
lola: 852 markings, 851 edges
lola: state equation: write sara problem file to CTLCardinality-16-0.sara
lola: ========================================
sara: place or transition ordering is non-deterministic
lola: ========================================
lola: ...considering subproblem: A (G ((P1 <= Speed_Left_Wheel_10 + Speed_Left_Wheel_9 + Speed_Left_Wheel_8 + Speed_Left_Wheel_7 + Speed_Left_Wheel_6 + Speed_Left_Wheel_5 + Speed_Left_Wheel_4 + Speed_Left_Wheel_3 + Speed_Left_Wheel_2 + Speed_Left_Wheel_1)))
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 ((P1 <= Speed_Left_Wheel_10 + Speed_Left_Wheel_9 + Speed_Left_Wheel_8 + Speed_Left_Wheel_7 + Speed_Left_Wheel_6 + Speed_Left_Wheel_5 + Speed_Left_Wheel_4 + Speed_Left_Wheel_3 + Speed_Left_Wheel_2 + Speed_Left_Wheel_1)))
lola: processed formula length: 224
lola: 61 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: (Speed_Left_Wheel_10 + Speed_Left_Wheel_9 + Speed_Left_Wheel_8 + Speed_Left_Wheel_7 + Speed_Left_Wheel_6 + Speed_Left_Wheel_5 + Speed_Left_Wheel_4 + Speed_Left_Wheel_3 + Speed_Left_Wheel_2 + Speed_Left_Wheel_1 + 1 <= P1)
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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no no no no yes no no yes no no no yes no yes
lola:
preliminary result: yes yes no no no no yes no no yes no no no yes no yes

lola: memory consumption: 21712 KB
lola: time consumption: 5 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

BK_STOP 1552721254738

--------------------
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="AirplaneLD-PT-0010"
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 AirplaneLD-PT-0010, 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 r005-smll-155225009200274"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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