Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2019-input.r148-ebro-155286403800175.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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-3954
Executing tool lola
Input is RobotManipulation-PT-00010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-ebro-155286403800175
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 4.1K Feb 12 14:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 12 14:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 8 16:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 8 16:29 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 113 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 351 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.6K Feb 5 01:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 5 01:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.1K Feb 4 22:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 4 16:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 4 16:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Feb 1 13:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 1 13:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 equiv_col
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 iscolored
-rw-r--r-- 1 mcc users 6.4K 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 RobotManipulation-PT-00010-CTLCardinality-00
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-01
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-02
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-03
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-04
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-05
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-06
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-07
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-08
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-09
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-10
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-11
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-12
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-13
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-14
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552988717229

info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ RobotManipulation-PT-00010 @ 3570 seconds

FORMULA RobotManipulation-PT-00010-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-00010-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-00010-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-00010-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-00010-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-00010-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-00010-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-00010-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-00010-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-00010-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-00010-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-00010-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-00010-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-00010-CTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-00010-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-00010-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2823
rslt: Output for CTLCardinality @ RobotManipulation-PT-00010

{
"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": "Tue Mar 19 09:45:17 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": "TRUE",
"processed_size": 4,
"rewrites": 35
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "EX((AG((p_i2 <= r_stopped)) AND ((access <= p_sc) OR (r_stopped <= p_rdy) OR (p_rdy <= moved) OR (2 <= p_i2))))",
"processed_size": 114,
"rewrites": 37
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 58,
"markings": 59,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 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": "(p_i1 <= 2)",
"processed_size": 11,
"rewrites": 38
},
"result":
{
"edges": 18,
"markings": 19,
"produced_by": "state space /EXEF",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "EG(EX((r_active <= 0)))",
"processed_size": 23,
"rewrites": 37
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 41,
"markings": 42,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((r_stopped <= 1)))",
"processed_size": 24,
"rewrites": 36
},
"result":
{
"edges": 38,
"markings": 39,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((r_stopped <= 0)))",
"processed_size": 24,
"rewrites": 36
},
"result":
{
"edges": 40,
"markings": 41,
"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": 396
},
"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 ((initialized <= r_stopped)))",
"processed_size": 34,
"rewrites": 37
},
"result":
{
"edges": 22,
"markings": 23,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (G ((r_active <= 0)))",
"processed_size": 23,
"rewrites": 36
},
"result":
{
"edges": 21,
"markings": 22,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "EF((AF((3 <= move)) AND ((p_m <= 0) AND (initialized <= 0))))",
"processed_size": 61,
"rewrites": 37
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 191783108,
"markings": 20030010,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 524
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((2 <= r_active) U (3 <= r_stopped)))",
"processed_size": 40,
"rewrites": 37
},
"result":
{
"edges": 102,
"markings": 102,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 10,
"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": 629
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 629
},
"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 ((r_moving <= r_stopped)))",
"processed_size": 31,
"rewrites": 37
},
"result":
{
"edges": 44,
"markings": 45,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 786
},
"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": "(p_rel + 1 <= p_sc)",
"processed_size": 19,
"rewrites": 35
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1573
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(3 <= access)",
"processed_size": 13,
"rewrites": 38
},
"result":
{
"edges": 155406592,
"markings": 19881058,
"produced_by": "tscc_search",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 942
},
"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 ((r_active + 1 <= p_i1)))",
"processed_size": 30,
"rewrites": 37
},
"result":
{
"edges": 21,
"markings": 22,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 13,
"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": 1413
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "((initialize + 1 <= moved) AND ((2 <= p_sc) OR (p_sc <= off) OR ((p_sc <= p_m) AND (p_sc <= initialized))))",
"processed_size": 109,
"rewrites": 35
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1413
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((p_rel <= r_stopped)))",
"processed_size": 28,
"rewrites": 36
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2826
},
"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": "(access <= move)",
"processed_size": 16,
"rewrites": 35
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2826
},
"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": "(p_sc + 1 <= p_rdy)",
"processed_size": 19,
"rewrites": 38
},
"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": 5
},
"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": "(p_sc + 1 <= p_rdy)",
"processed_size": 19,
"rewrites": 38
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"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": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E ((((3 <= p_i1) AND (r_active <= p_i2)) U (r_stopped <= p_sc)))",
"processed_size": 64,
"rewrites": 38
},
"result":
{
"edges": 2032710,
"markings": 348884,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 24520,
"runtime": 747.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "((A(F(**)) OR A((** U **))) AND E((** U **))) : E(X((A(G(**)) AND **))) : TRUE : E(G(**)) : (A(X(E(F(**)))) AND A(X(A(G(**))))) : (A(G(**)) OR **) : E(G(E(X(**)))) : (E((* R *)) AND A(G(**))) : A(G(A((** U **)))) : E(F((A(F(**)) AND **))) : E(F(**)) : A(G(**)) : ((** OR E(F(*))) AND A(G(E(F(**))))) : E(F(**)) : A(G(E(X(**)))) : (((** AND E(F(**))) OR A(G(**))) AND **)"
},
"net":
{
"arcs": 34,
"conflict_clusters": 9,
"places": 15,
"places_significant": 9,
"singleton_clusters": 0,
"transitions": 11
},
"result":
{
"preliminary_value": "no no yes no no no no no no no yes no yes yes no no ",
"value": "no no yes no no no no no no no yes no yes yes no no "
},
"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: 26/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 480
lola: finding significant places
lola: 15 places, 11 transitions, 9 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: ((A (F ((p_rdy <= p_sc))) OR A (((initialized <= r_moving) U (off <= r_moving)))) AND E ((((3 <= p_i1) AND (r_active <= p_i2)) U (r_stopped <= p_sc)))) : E (X ((A (G ((p_i2 <= r_stopped))) AND ((access <= p_sc) OR (r_stopped <= p_rdy) OR (p_rdy <= moved) OR (2 <= p_i2))))) : A (G ((E (F ((0 <= 0))) OR ((p_rel + 1 <= r_stopped) OR (moved + 1 <= initialize))))) : NOT(NOT(E (G ((r_active <= 0))))) : A (X ((E (F ((2 <= p_sc))) AND A (G ((3 <= p_i1)))))) : ((A (G ((r_active + 1 <= p_i1))) OR ((initialize + 1 <= moved) AND ((2 <= p_sc) OR (p_sc <= off) OR ((p_sc <= p_m) AND (p_sc <= initialized))))) AND ((() OR E (G ((2 <= r_stopped)))) AND (0 <= 0))) : E (G (E (X ((r_active <= 0))))) : NOT((A (((3 <= access) U (1 <= p_rdy))) OR NOT(A (G ((r_moving <= r_stopped)))))) : A (G (A (((2 <= r_active) U (3 <= r_stopped))))) : E (F ((A (F ((3 <= move))) AND ((p_m <= 0) AND (initialized <= 0))))) : E (F ((r_stopped <= 0))) : E (((1 <= 0) U A (G ((initialized <= r_stopped))))) : (((p_rel + 1 <= p_sc) OR NOT(A (G ((3 <= initialize))))) AND A (G (E (F ((3 <= access)))))) : A (F (E (F ((r_stopped <= 1))))) : A (G (E (X (((3 <= access) OR (2 <= p_rdy)))))) : ((((((move <= p_rdy) OR (initialized <= p_rel)) AND ((p_rel <= p_i2) OR (p_rdy <= p_m))) AND E (F ((p_rel <= r_stopped)))) OR A (G (((r_stopped <= r_moving) AND (3 <= off))))) AND (access <= move))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:183
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:449
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 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: 35 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 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((A (G ((p_i2 <= r_stopped))) AND ((access <= p_sc) OR (r_stopped <= p_rdy) OR (p_rdy <= moved) OR (2 <= p_i2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((AG((p_i2 <= r_stopped)) AND ((access <= p_sc) OR (r_stopped <= p_rdy) OR (p_rdy <= moved) OR (2 <= p_i2))))
lola: processed formula length: 114
lola: 37 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: 59 markings, 58 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (E (F ((2 <= p_sc))))) AND A (X (A (G ((3 <= p_i1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((3 <= p_i1)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:624
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p_i1 <= 2)
lola: processed formula length: 11
lola: 38 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: 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: (p_i1 <= 2)
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 /EXEF
lola: The predicate is not invariant from successors.
lola: 19 markings, 18 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (X ((r_active <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(EX((r_active <= 0)))
lola: processed formula length: 23
lola: 37 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: 42 markings, 41 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (((3 <= access) OR (2 <= p_rdy))))))
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(((3 <= access) OR (2 <= p_rdy))))
lola: processed formula length: 40
lola: 37 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: 117 markings, 116 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((r_stopped <= 1)))
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 ((r_stopped <= 1)))
lola: processed formula length: 24
lola: 36 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: (r_stopped <= 1)
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: 39 markings, 38 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((r_stopped <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((r_stopped <= 0)))
lola: processed formula length: 24
lola: 36 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: (r_stopped <= 0)
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: 41 markings, 40 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((initialized <= r_stopped)))
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 ((initialized <= r_stopped)))
lola: processed formula length: 34
lola: 37 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: (r_stopped + 1 <= initialized)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is not invariant.
lola: 23 markings, 22 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((r_active <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((r_active <= 0)))
lola: processed formula length: 23
lola: 36 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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 22 markings, 21 edges
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: (1 <= r_active)
lola: state equation task get result unparse finished id 0
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (F ((3 <= move))) AND ((p_m <= 0) AND (initialized <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AF((3 <= move)) AND ((p_m <= 0) AND (initialized <= 0))))
lola: processed formula length: 61
lola: 37 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: 743309 markings, 3721074 edges, 148662 markings/sec, 0 secs
lola: 1375617 markings, 7102097 edges, 126462 markings/sec, 5 secs
lola: 1964460 markings, 10336679 edges, 117769 markings/sec, 10 secs
lola: 2529574 markings, 13489292 edges, 113023 markings/sec, 15 secs
lola: 3030717 markings, 16318508 edges, 100229 markings/sec, 20 secs
lola: 3494566 markings, 18969942 edges, 92770 markings/sec, 25 secs
lola: 3968533 markings, 21705887 edges, 94793 markings/sec, 30 secs
lola: 4423608 markings, 24357195 edges, 91015 markings/sec, 35 secs
lola: 4886888 markings, 27077461 edges, 92656 markings/sec, 40 secs
lola: 5358626 markings, 29863832 edges, 94348 markings/sec, 45 secs
lola: 5823758 markings, 32633971 edges, 93026 markings/sec, 50 secs
lola: 6283254 markings, 35385286 edges, 91899 markings/sec, 55 secs
lola: 6740510 markings, 38145699 edges, 91451 markings/sec, 60 secs
lola: 7193208 markings, 40895802 edges, 90540 markings/sec, 65 secs
lola: 7642458 markings, 43634986 edges, 89850 markings/sec, 70 secs
lola: 8084491 markings, 46354325 edges, 88407 markings/sec, 75 secs
lola: 8522793 markings, 49064919 edges, 87660 markings/sec, 80 secs
lola: 8958855 markings, 51767658 edges, 87212 markings/sec, 85 secs
lola: 9355101 markings, 54230331 edges, 79249 markings/sec, 90 secs
lola: 9730072 markings, 56573350 edges, 74994 markings/sec, 95 secs
lola: 10107872 markings, 58947492 edges, 75560 markings/sec, 100 secs
lola: 10486323 markings, 61334084 edges, 75690 markings/sec, 105 secs
lola: 10861883 markings, 63716403 edges, 75112 markings/sec, 110 secs
lola: 11242648 markings, 66134586 edges, 76153 markings/sec, 115 secs
lola: 11622190 markings, 68554148 edges, 75908 markings/sec, 120 secs
lola: 11999346 markings, 70966470 edges, 75431 markings/sec, 125 secs
lola: 12375908 markings, 73375897 edges, 75312 markings/sec, 130 secs
lola: 12750871 markings, 75787646 edges, 74993 markings/sec, 135 secs
lola: 13124678 markings, 78197967 edges, 74761 markings/sec, 140 secs
lola: 13505033 markings, 80655491 edges, 76071 markings/sec, 145 secs
lola: 13884251 markings, 83115323 edges, 75844 markings/sec, 150 secs
lola: 14263871 markings, 85582284 edges, 75924 markings/sec, 155 secs
lola: 14644036 markings, 88058711 edges, 76033 markings/sec, 160 secs
lola: 15025112 markings, 90549530 edges, 76215 markings/sec, 165 secs
lola: 15401802 markings, 93025719 edges, 75338 markings/sec, 170 secs
lola: 15785716 markings, 95537463 edges, 76783 markings/sec, 175 secs
lola: 16151546 markings, 97939913 edges, 73166 markings/sec, 180 secs
lola: 16479342 markings, 100100194 edges, 65559 markings/sec, 185 secs
lola: 16810094 markings, 102273872 edges, 66150 markings/sec, 190 secs
lola: 17151246 markings, 104524223 edges, 68230 markings/sec, 195 secs
lola: 17497496 markings, 106805921 edges, 69250 markings/sec, 200 secs
lola: 17868906 markings, 109261570 edges, 74282 markings/sec, 205 secs
lola: 18245193 markings, 111742937 edges, 75257 markings/sec, 210 secs
lola: 18632328 markings, 114301927 edges, 77427 markings/sec, 215 secs
lola: 19011009 markings, 116794187 edges, 75736 markings/sec, 220 secs
lola: 19402385 markings, 119364759 edges, 78275 markings/sec, 225 secs
lola: 19824438 markings, 122100138 edges, 84411 markings/sec, 230 secs
lola: 19971143 markings, 124645235 edges, 29341 markings/sec, 235 secs
lola: 19979293 markings, 126612985 edges, 1630 markings/sec, 240 secs
lola: 19984744 markings, 128538274 edges, 1090 markings/sec, 245 secs
lola: 19988648 markings, 130429018 edges, 781 markings/sec, 250 secs
lola: 19991750 markings, 132305953 edges, 620 markings/sec, 255 secs
lola: 19994570 markings, 134189250 edges, 564 markings/sec, 260 secs
lola: 19997034 markings, 136082512 edges, 493 markings/sec, 265 secs
lola: 19999078 markings, 137973470 edges, 409 markings/sec, 270 secs
lola: 20001266 markings, 139871220 edges, 438 markings/sec, 275 secs
lola: 20003113 markings, 141783448 edges, 369 markings/sec, 280 secs
lola: 20004614 markings, 143693834 edges, 300 markings/sec, 285 secs
lola: 20006049 markings, 145603003 edges, 287 markings/sec, 290 secs
lola: 20007513 markings, 147504395 edges, 293 markings/sec, 295 secs
lola: 20008785 markings, 149390200 edges, 254 markings/sec, 300 secs
lola: 20009937 markings, 151269236 edges, 230 markings/sec, 305 secs
lola: 20011040 markings, 153143528 edges, 221 markings/sec, 310 secs
lola: 20012156 markings, 154999510 edges, 223 markings/sec, 315 secs
lola: 20013223 markings, 156838097 edges, 213 markings/sec, 320 secs
lola: 20014197 markings, 158658501 edges, 195 markings/sec, 325 secs
lola: 20015196 markings, 160466247 edges, 200 markings/sec, 330 secs
lola: 20016345 markings, 162263594 edges, 230 markings/sec, 335 secs
lola: 20017333 markings, 164057387 edges, 198 markings/sec, 340 secs
lola: 20018257 markings, 165854798 edges, 185 markings/sec, 345 secs
lola: 20019227 markings, 167655430 edges, 194 markings/sec, 350 secs
lola: 20020039 markings, 169458535 edges, 162 markings/sec, 355 secs
lola: 20020833 markings, 171269726 edges, 159 markings/sec, 360 secs
lola: 20021711 markings, 173088309 edges, 176 markings/sec, 365 secs
lola: 20022502 markings, 174899583 edges, 158 markings/sec, 370 secs
lola: 20023344 markings, 176710352 edges, 168 markings/sec, 375 secs
lola: 20024090 markings, 178585151 edges, 149 markings/sec, 380 secs
lola: 20024877 markings, 180506552 edges, 157 markings/sec, 385 secs
lola: 20025684 markings, 182467668 edges, 161 markings/sec, 390 secs
lola: 20026554 markings, 184455861 edges, 174 markings/sec, 395 secs
lola: 20027431 markings, 186511377 edges, 175 markings/sec, 400 secs
lola: 20028434 markings, 188659522 edges, 201 markings/sec, 405 secs
lola: 20029653 markings, 191057530 edges, 244 markings/sec, 410 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 20030010 markings, 191783108 edges
lola: ========================================
lola: subprocess 10 will run for 524 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (((2 <= r_active) U (3 <= r_stopped)))))
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 (((2 <= r_active) U (3 <= r_stopped)))
lola: processed formula length: 40
lola: 37 rewrites
lola: closed formula file CTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The universal single path CTL formula does not hold.
lola: 102 markings, 102 edges
lola: ========================================
lola: subprocess 11 will run for 629 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((access <= 2) R (p_rdy <= 0))) AND A (G ((r_moving <= r_stopped))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 629 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((r_moving <= r_stopped)))
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 ((r_moving <= r_stopped)))
lola: processed formula length: 31
lola: 37 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: (r_stopped + 1 <= r_moving)
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: 45 markings, 44 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 786 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p_rel + 1 <= p_sc) OR E (F ((initialize <= 2)))) AND A (G (E (F ((3 <= access))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 786 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p_rel + 1 <= p_sc)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p_rel + 1 <= p_sc)
lola: processed formula length: 19
lola: 35 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: subprocess 13 will run for 1049 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((initialize <= 2)))
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 ((initialize <= 2)))
lola: processed formula length: 25
lola: 36 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: (initialize <= 2)
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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1573 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((3 <= access)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (3 <= access)
lola: processed formula length: 13
lola: 38 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
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (access <= 2)
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-14-0.sara
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (3 <= access)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-14-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-14-1.sara.

lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 1052675 markings, 3873857 edges, 210535 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 1841855 markings, 7033850 edges, 157836 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 2561679 markings, 9993041 edges, 143965 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 3242055 markings, 12834388 edges, 136075 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 3894536 markings, 15595547 edges, 130496 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 4528301 markings, 18296479 edges, 126753 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 5166860 markings, 21052552 edges, 127712 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 5790538 markings, 23769168 edges, 124736 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 6401652 markings, 26448444 edges, 122223 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 7005014 markings, 29104689 edges, 120672 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 7594950 markings, 31715678 edges, 117987 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 8193297 markings, 34385286 edges, 119669 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 8791353 markings, 37066582 edges, 119611 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 9373743 markings, 39694737 edges, 116478 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 9937057 markings, 42245070 edges, 112663 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 10494527 markings, 44788761 edges, 111494 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 11083470 markings, 47470575 edges, 117789 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 11665371 markings, 50137276 edges, 116380 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 12244237 markings, 52800564 edges, 115773 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 12822037 markings, 55464060 edges, 115560 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 13396325 markings, 58131029 edges, 114858 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 13966052 markings, 60776483 edges, 113945 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 14507146 markings, 63302587 edges, 108219 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 15015769 markings, 65686230 edges, 101725 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 15523812 markings, 68057397 edges, 101609 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 16027598 markings, 70419516 edges, 100757 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 16533078 markings, 72789153 edges, 101096 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 17040724 markings, 75173573 edges, 101529 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 17554871 markings, 77589747 edges, 102829 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 18076886 markings, 80039555 edges, 104403 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 18621432 markings, 82572497 edges, 108909 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 19197038 markings, 85230600 edges, 115121 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 19707247 markings, 88306369 edges, 102042 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 19721708 markings, 90698329 edges, 2892 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 19729958 markings, 92901249 edges, 1650 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 19736364 markings, 95038854 edges, 1281 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 19741815 markings, 97227628 edges, 1090 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 19746785 markings, 99434854 edges, 994 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 19751196 markings, 101610173 edges, 882 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 19755004 markings, 103679137 edges, 762 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 19758959 markings, 105863996 edges, 791 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 19762402 markings, 108044771 edges, 689 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 19765881 markings, 110221437 edges, 696 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 19769179 markings, 112378576 edges, 660 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 19772117 markings, 114554647 edges, 588 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 19775001 markings, 116582030 edges, 577 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 19778124 markings, 118615206 edges, 625 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 19781171 markings, 120565916 edges, 609 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 19784254 markings, 122586033 edges, 617 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 19787567 markings, 124610063 edges, 663 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 19790587 markings, 126605815 edges, 604 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 19793731 markings, 128625898 edges, 629 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 19796978 markings, 130665713 edges, 649 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 19800330 markings, 132689305 edges, 670 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 19803761 markings, 134703635 edges, 686 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 19807785 markings, 136804494 edges, 805 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 19812132 markings, 138943154 edges, 869 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 19816918 markings, 141123715 edges, 957 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 19821814 markings, 143352744 edges, 979 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 19827335 markings, 145458299 edges, 1104 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 19833612 markings, 147525722 edges, 1255 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 19840571 markings, 149679640 edges, 1392 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 19850464 markings, 152009253 edges, 1979 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 19867750 markings, 154585243 edges, 3457 markings/sec, 315 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 19881058 markings, 155406592 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 942 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((r_active + 1 <= p_i1))) OR ((initialize + 1 <= moved) AND ((2 <= p_sc) OR (p_sc <= off) OR ((p_sc <= p_m) AND (p_sc <= initialized)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 942 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((r_active + 1 <= p_i1)))
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 ((r_active + 1 <= p_i1)))
lola: processed formula length: 30
lola: 37 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: (p_i1 <= r_active)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 22 markings, 21 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 14 will run for 1413 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((initialize + 1 <= moved) AND ((2 <= p_sc) OR (p_sc <= off) OR ((p_sc <= p_m) AND (p_sc <= initialized))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((initialize + 1 <= moved) AND ((2 <= p_sc) OR (p_sc <= off) OR ((p_sc <= p_m) AND (p_sc <= initialized))))
lola: processed formula length: 109
lola: 35 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 5 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: subprocess 14 will run for 1413 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((((move <= p_rdy) OR (initialized <= p_rel)) AND ((p_rel <= p_i2) OR (p_rdy <= p_m))) AND E (F ((p_rel <= r_stopped)))) OR A (G (((r_stopped <= r_moving) AND (3 <= off))))) AND (access <= move))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1413 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p_rel <= r_stopped)))
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 ((p_rel <= r_stopped)))
lola: processed formula length: 28
lola: 36 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: formula 0: (p_rel <= r_stopped)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 2826 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (access <= move)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (access <= move)
lola: processed formula length: 16
lola: 35 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: subprocess 15 will run for 2826 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (F ((p_rdy <= p_sc))) OR A (((initialized <= r_moving) U (off <= r_moving)))) AND E ((((3 <= p_i1) AND (r_active <= p_i2)) U (r_stopped <= p_sc))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2826 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p_rdy <= p_sc)))
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: (p_sc + 1 <= p_rdy)
lola: processed formula length: 19
lola: 38 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: (p_rdy <= p_sc)
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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((A (F ((p_rdy <= p_sc))) OR A (((initialized <= r_moving) U (off <= r_moving)))) AND E ((((3 <= p_i1) AND (r_active <= p_i2)) U (r_stopped <= p_sc))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (F ((p_rdy <= p_sc)))
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: (p_sc + 1 <= p_rdy)
lola: processed formula length: 19
lola: 38 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: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p_rdy <= p_sc)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E ((((3 <= p_i1) AND (r_active <= p_i2)) U (r_stopped <= p_sc)))
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 ((((3 <= p_i1) AND (r_active <= p_i2)) U (r_stopped <= p_sc)))
lola: processed formula length: 64
lola: 38 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: (r_stopped <= p_sc)
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-17-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-17-0.sara.

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 348884 markings, 2032710 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no no no no no no yes no yes yes no no
lola:
preliminary result: no no yes no no no no no no no yes no yes yes no no
lola: memory consumption: 24520 KB
lola: time consumption: 747 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

BK_STOP 1552989464378

--------------------
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="RobotManipulation-PT-00010"
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-3954"
echo " Executing tool lola"
echo " Input is RobotManipulation-PT-00010, 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 r148-ebro-155286403800175"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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