About the Execution of LoLA for Kanban-PT-02000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15917.260 | 1548578.00 | 1146631.00 | 26865.70 | TFFTF?TFFTTTTFT? | 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.r093-smll-155246583900076.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 Kanban-PT-02000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r093-smll-155246583900076
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 3.3K Feb 11 22:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 11 22:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 7 23:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 7 23:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 102 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 340 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.4K Feb 5 00:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 5 00:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.4K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 4 06:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 4 06:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Jan 31 23:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Jan 31 23:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 4 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 0 Jan 29 09:34 model-fix.log
-rw-r--r-- 1 mcc users 14K 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 Kanban-PT-02000-CTLCardinality-00
FORMULA_NAME Kanban-PT-02000-CTLCardinality-01
FORMULA_NAME Kanban-PT-02000-CTLCardinality-02
FORMULA_NAME Kanban-PT-02000-CTLCardinality-03
FORMULA_NAME Kanban-PT-02000-CTLCardinality-04
FORMULA_NAME Kanban-PT-02000-CTLCardinality-05
FORMULA_NAME Kanban-PT-02000-CTLCardinality-06
FORMULA_NAME Kanban-PT-02000-CTLCardinality-07
FORMULA_NAME Kanban-PT-02000-CTLCardinality-08
FORMULA_NAME Kanban-PT-02000-CTLCardinality-09
FORMULA_NAME Kanban-PT-02000-CTLCardinality-10
FORMULA_NAME Kanban-PT-02000-CTLCardinality-11
FORMULA_NAME Kanban-PT-02000-CTLCardinality-12
FORMULA_NAME Kanban-PT-02000-CTLCardinality-13
FORMULA_NAME Kanban-PT-02000-CTLCardinality-14
FORMULA_NAME Kanban-PT-02000-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1552734068801
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ Kanban-PT-02000 @ 3570 seconds
FORMULA Kanban-PT-02000-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-02000-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-02000-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-02000-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-02000-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-02000-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-02000-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-02000-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-02000-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-02000-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-02000-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-02000-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-02000-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-02000-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-02000-CTLCardinality-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-02000-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2021
rslt: Output for CTLCardinality @ Kanban-PT-02000
{
"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 11:01:08 2019
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E(((Pback4 <= 0) OR (Pm4 <= 1)) U AX((P1 <= Pm3)))",
"processed_size": 51,
"rewrites": 30
},
"net":
{
"conflict_clusters": 12,
"singleton_clusters": 0
},
"result":
{
"edges": 31997,
"markings": 18002,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"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": 2,
"visible_transitions": 0
},
"processed": "((P4 + 1 <= Pm1) OR (P4 <= 1))",
"processed_size": 31,
"rewrites": 31
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 1,
"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": 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": "(Pout3 <= 2)",
"processed_size": 12,
"rewrites": 28
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((Pback4 + 1 <= P1)))",
"processed_size": 26,
"rewrites": 30
},
"result":
{
"edges": 4000,
"markings": 4001,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"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 ((P3 <= 2)))",
"processed_size": 17,
"rewrites": 29
},
"result":
{
"edges": 5994,
"markings": 5995,
"produced_by": "state space",
"value": true
},
"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": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((P4 + 1 <= Pm3) AND ((P4 <= 0) OR (Pout4 <= 0)))))",
"processed_size": 58,
"rewrites": 29
},
"result":
{
"edges": 2003,
"markings": 2004,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"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": "E (F (((P4 <= Pout4) AND (1 <= Pback3))))",
"processed_size": 41,
"rewrites": 29
},
"result":
{
"edges": 2004,
"markings": 2005,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"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": 8,
"visible_transitions": 0
},
"processed": "A (G ((((Pout3 + 1 <= P1) OR (Pback2 + 1 <= Pm2)) AND ((3 <= Pm1) OR (P2 <= Pback4) OR (Pout3 + 1 <= P3)))))",
"processed_size": 111,
"rewrites": 30
},
"result":
{
"edges": 4500,
"markings": 4501,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 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": "(P4 + 1 <= Pback4)",
"processed_size": 18,
"rewrites": 31
},
"result":
{
"edges": 4001,
"markings": 4001,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E(AG((Pout2 <= P4)) U (3 <= Pback1))",
"processed_size": 36,
"rewrites": 30
},
"net":
{
"conflict_clusters": 12,
"singleton_clusters": 0
},
"result":
{
"edges": 32004,
"markings": 18005,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 2,
"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": "E(EF((P1 <= Pout1)) U (((P1 <= Pm3) OR (3 <= Pm3)) AND ((Pm3 <= Pback4) OR (P4 <= P3))))",
"processed_size": 90,
"rewrites": 30
},
"net":
{
"conflict_clusters": 12,
"singleton_clusters": 0
},
"result":
{
"edges": 67968,
"markings": 17995,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(Pout2 <= 0)",
"processed_size": 12,
"rewrites": 28
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((Pout2 <= 2) AND (Pback2 <= 1))",
"processed_size": 32,
"rewrites": 28
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((3 <= P1)))",
"processed_size": 17,
"rewrites": 30
},
"result":
{
"edges": 11988,
"markings": 11989,
"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": 10,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"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": "(Pm4 <= 0)",
"processed_size": 10,
"rewrites": 28
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"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": 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": "(P3 <= 2)",
"processed_size": 9,
"rewrites": 32
},
"result":
{
"edges": 7996,
"markings": 7996,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 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": "(P3 <= 1)",
"processed_size": 9,
"rewrites": 28
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 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": "A (G ((1 <= P4)))",
"processed_size": 17,
"rewrites": 30
},
"result":
{
"edges": 2000,
"markings": 2001,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 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": "(Pm1 <= Pback3)",
"processed_size": 15,
"rewrites": 28
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1463
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1463
},
"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": "(Pback3 <= Pm2)",
"processed_size": 15,
"rewrites": 28
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2926
},
"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 <= Pm4)",
"processed_size": 11,
"rewrites": 31
},
"result":
{
"edges": 8154331,
"markings": 4076157,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2920
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2920
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (G ((Pm2 + 1 <= P2)))",
"processed_size": 23,
"rewrites": 29
},
"result":
{
"edges": 2002,
"markings": 2002,
"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"
},
"type": "possible_preservation",
"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": 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": "(Pm1 <= Pback3)",
"processed_size": 15,
"rewrites": 28
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 16,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (G ((Pm2 + 1 <= P2)))",
"processed_size": 23,
"rewrites": 29
},
"result":
{
"edges": 2002,
"markings": 2002,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (((2 <= Pout3) U (3 <= Pout2)))",
"processed_size": 33,
"rewrites": 31
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 21016,
"runtime": 1549.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E((** U A(X(**)))) : A(G(**)) : (A(G(*)) AND *) : E((E(F(**)) U **)) : E((A(G(**)) U **)) : (** AND E(F(A(G(**))))) : E(F(*)) : (* AND (A(G(*)) AND (A(F(**)) OR E(X(**))))) : (** AND A(G(A(F(**))))) : E(F(E(G(*)))) : E(F(**)) : E(F(**)) : (** AND E(G(E(F(**))))) : ((A(F(**)) OR **) AND A(G(**))) : (A(G(**)) OR **) : (A(G(E(F(**)))) OR (E((** U **)) AND E(G(*))))"
},
"net":
{
"arcs": 40,
"conflict_clusters": 12,
"places": 16,
"places_significant": 11,
"singleton_clusters": 0,
"transitions": 16
},
"result":
{
"preliminary_value": "yes no no yes no unknown yes no no yes yes yes yes no yes unknown ",
"value": "yes no no yes no unknown yes no no yes yes yes yes no yes unknown "
},
"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: 32/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 512
lola: finding significant places
lola: 16 places, 16 transitions, 11 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: E ((((Pback4 <= 0) OR (Pm4 <= 1)) U A (X ((P1 <= Pm3))))) : A (G ((((Pout3 + 1 <= P1) OR (Pback2 + 1 <= Pm2)) AND ((3 <= Pm1) OR (P2 <= Pback4) OR (Pout3 + 1 <= P3))))) : NOT((E (F ((P1 <= 2))) OR ((3 <= Pout2) OR (2 <= Pback2)))) : E ((E (F ((P1 <= Pout1))) U (((P1 <= Pm3) OR (3 <= Pm3)) AND ((Pm3 <= Pback4) OR (P4 <= P3))))) : E ((A (G ((Pout2 <= P4))) U (3 <= Pback1))) : ((Pm1 <= Pback3) AND E (F (A (G ((Pback1 <= Pout4)))))) : NOT(A (G (((Pm3 <= P4) OR ((1 <= P4) AND (1 <= Pout4)))))) : (NOT(((3 <= Pout3) OR E (F ((P1 <= Pback4))))) AND (A (F (((Pm1 <= P4) AND (2 <= P4)))) OR E (X ((Pout4 <= 0))))) : ((Pm4 <= 0) AND A (G (A (F ((3 <= P3)))))) : E (F (NOT(A (F ((Pback4 <= P4)))))) : A (F (E (F ((P3 <= 2))))) : E (F (((P4 <= Pout4) AND (1 <= Pback3)))) : ((Pback3 <= Pm2) AND E (G (E (F ((P2 <= Pm4)))))) : ((A (F ((Pback1 <= 2))) OR (P3 <= 1)) AND A (G (A (G ((1 <= P4)))))) : ((A (G ((2 <= Pout1))) OR (Pout2 <= 0)) AND A (G (A (F ((0 <= 0)))))) : (A (G (E (F ((Pout2 <= Pback2))))) OR (E (((2 <= Pout3) U (3 <= Pout2))) AND NOT(A (F ((P2 <= Pm2))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:449
lola: rewrite Frontend/Parser/formula_rewrite.k:389
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:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((Pback4 <= 0) OR (Pm4 <= 1)) U A (X ((P1 <= Pm3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(((Pback4 <= 0) OR (Pm4 <= 1)) U AX((P1 <= Pm3)))
lola: processed formula length: 51
lola: 30 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: 18002 markings, 31997 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((Pout3 <= 2) AND (A (G ((Pback4 + 1 <= P1))) AND (A (F (((Pm1 <= P4) AND (2 <= P4)))) OR E (X ((Pout4 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((Pm1 <= P4) AND (2 <= P4))))
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: ((P4 + 1 <= Pm1) OR (P4 <= 1))
lola: processed formula length: 31
lola: 31 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: 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: ((Pm1 <= P4) AND (2 <= P4))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Pout3 <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Pout3 <= 2)
lola: processed formula length: 12
lola: 28 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((Pback4 + 1 <= P1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((Pback4 + 1 <= P1)))
lola: processed formula length: 26
lola: 30 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (P1 <= Pback4)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-3-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4001 markings, 4000 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((P3 <= 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 ((P3 <= 2)))
lola: processed formula length: 17
lola: 29 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: (P3 <= 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-2-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5995 markings, 5994 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((P4 + 1 <= Pm3) AND ((P4 <= 0) OR (Pout4 <= 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 (((P4 + 1 <= Pm3) AND ((P4 <= 0) OR (Pout4 <= 0)))))
lola: processed formula length: 58
lola: 29 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: ((P4 + 1 <= Pm3) AND ((P4 <= 0) OR (Pout4 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-3-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2004 markings, 2003 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((P4 <= Pout4) AND (1 <= Pback3))))
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 (((P4 <= Pout4) AND (1 <= Pback3))))
lola: processed formula length: 41
lola: 29 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: ((P4 <= Pout4) AND (1 <= Pback3))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-4-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2005 markings, 2004 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((Pout3 + 1 <= P1) OR (Pback2 + 1 <= Pm2)) AND ((3 <= Pm1) OR (P2 <= Pback4) OR (Pout3 + 1 <= P3)))))
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 ((((Pout3 + 1 <= P1) OR (Pback2 + 1 <= Pm2)) AND ((3 <= Pm1) OR (P2 <= Pback4) OR (Pout3 + 1 <= P3)))))
lola: processed formula length: 111
lola: 30 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: (((P1 <= Pout3) AND (Pm2 <= Pback2)) OR ((Pm1 <= 2) AND (Pback4 + 1 <= P2) AND (P3 <= Pout3)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-5-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4501 markings, 4500 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((P4 + 1 <= Pback4)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:598
lola: rewrite Frontend/Parser/formula_rewrite.k:633
lola: rewrite Frontend/Parser/formula_rewrite.k:730
lola: processed formula: (P4 + 1 <= Pback4)
lola: processed formula length: 18
lola: 31 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 /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (Pback4 <= P4)
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-6-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: (P4 + 1 <= Pback4)
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-6-1.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 4001 markings, 4001 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((A (G ((Pout2 <= P4))) U (3 <= Pback1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(AG((Pout2 <= P4)) U (3 <= Pback1))
lola: processed formula length: 36
lola: 30 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: 18005 markings, 32004 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((P1 <= Pout1))) U (((P1 <= Pm3) OR (3 <= Pm3)) AND ((Pm3 <= Pback4) OR (P4 <= P3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EF((P1 <= Pout1)) U (((P1 <= Pm3) OR (3 <= Pm3)) AND ((Pm3 <= Pback4) OR (P4 <= P3))))
lola: processed formula length: 90
lola: 30 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: 17995 markings, 67968 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((2 <= Pout1))) OR (Pout2 <= 0))
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: (Pout2 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Pout2 <= 0)
lola: processed formula length: 12
lola: 28 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((3 <= P1))) AND ((Pout2 <= 2) AND (Pback2 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((Pout2 <= 2) AND (Pback2 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Pout2 <= 2) AND (Pback2 <= 1))
lola: processed formula length: 32
lola: 28 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= P1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((3 <= P1)))
lola: processed formula length: 17
lola: 30 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (P1 <= 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-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-11-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11989 markings, 11988 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((Pm4 <= 0) AND A (G (A (F ((3 <= P3))))))
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: (Pm4 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Pm4 <= 0)
lola: processed formula length: 10
lola: 28 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((3 <= P3)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (P3 <= 2)
lola: processed formula length: 9
lola: 32 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 /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= 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 task get result unparse finished++ id 1
lola: formula 1: (P3 <= 2)
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-12-0.sara
lola: state equation: write sara problem file to CTLCardinality-12-1.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-12-0.sara.
sara: place or transition ordering is non-deterministic
sara: try reading problem file CTLCardinality-12-1.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 7996 markings, 7996 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (F ((Pback1 <= 2))) OR (P3 <= 1)) AND A (G ((1 <= P4))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (P3 <= 1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P3 <= 1)
lola: processed formula length: 9
lola: 28 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 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= P4)))
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 ((1 <= P4)))
lola: processed formula length: 17
lola: 30 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: (P4 <= 0)
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-13-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2001 markings, 2000 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((Pm1 <= Pback3) AND E (F (A (G ((Pback1 <= Pout4))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Pm1 <= Pback3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Pm1 <= Pback3)
lola: processed formula length: 15
lola: 28 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((Pback1 <= Pout4)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (Pout4 + 1 <= Pback1)
lola: processed formula length: 21
lola: 32 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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (Pback1 <= Pout4)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (Pout4 + 1 <= Pback1)
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: write sara problem file to CTLCardinality-14-0.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-14-1.sara.
sara: try reading problem file CTLCardinality-14-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 3616245 markings, 6617452 edges, 723249 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 6670727 markings, 12833224 edges, 610896 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 9439200 markings, 18580202 edges, 553695 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 12151434 markings, 24222753 edges, 542447 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 14807179 markings, 29786206 edges, 531149 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 17464338 markings, 35343929 edges, 531432 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 20167701 markings, 40984787 edges, 540673 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 22862773 markings, 46597903 edges, 539014 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 25570826 markings, 52232600 edges, 541611 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 28242358 markings, 57813690 edges, 534306 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 30941112 markings, 63434921 edges, 539751 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 33672291 markings, 69097735 edges, 546236 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 36259803 markings, 74588065 edges, 517502 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 38730702 markings, 79887777 edges, 494180 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 41172136 markings, 85107763 edges, 488287 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 43557446 markings, 90231758 edges, 477062 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 45888484 markings, 95283642 edges, 466208 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 48247104 markings, 100359070 edges, 471724 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 50557365 markings, 105362765 edges, 462052 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 52850060 markings, 110346409 edges, 458539 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 55128031 markings, 115295432 edges, 455594 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 57391721 markings, 120247497 edges, 452738 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 59610328 markings, 125120934 edges, 443721 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 61855723 markings, 130022964 edges, 449079 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 64066976 markings, 134882710 edges, 442251 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 66315033 markings, 139771268 edges, 449611 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 68543773 markings, 144609649 edges, 445748 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 70713091 markings, 149378856 edges, 433864 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 72832715 markings, 154077750 edges, 423925 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 74899739 markings, 158728339 edges, 413405 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 77000413 markings, 163411883 edges, 420135 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 79128247 markings, 168119305 edges, 425567 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 81205354 markings, 172756590 edges, 415421 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 83372234 markings, 177489557 edges, 433376 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 85398425 markings, 182044529 edges, 405238 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 87470724 markings, 186649613 edges, 414460 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 89508437 markings, 191213021 edges, 407543 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 91577378 markings, 195802862 edges, 413788 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 93603013 markings, 200338688 edges, 405127 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 95658010 markings, 204910582 edges, 410999 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 97642501 markings, 209373345 edges, 396898 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 99656060 markings, 213893051 edges, 402712 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 101677240 markings, 218412345 edges, 404236 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 103701647 markings, 222926497 edges, 404881 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 105664542 markings, 227347614 edges, 392579 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 107631576 markings, 231767679 edges, 393407 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 109534246 markings, 236123921 edges, 380534 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 111511478 markings, 240563384 edges, 395446 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 113478188 markings, 245002732 edges, 393342 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 115477187 markings, 249456105 edges, 399800 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 117366747 markings, 253778055 edges, 377912 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 119334930 markings, 258207496 edges, 393637 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 121291719 markings, 262622468 edges, 391358 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 123278987 markings, 267037400 edges, 397454 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 125201481 markings, 271384004 edges, 384499 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 127135953 markings, 275748300 edges, 386894 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 129005623 markings, 280031348 edges, 373934 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 130859056 markings, 284295248 edges, 370687 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 132657815 markings, 288479568 edges, 359752 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 134461842 markings, 292655394 edges, 360805 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 136207020 markings, 296732383 edges, 349036 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 138062904 markings, 300989697 edges, 371177 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 139812676 markings, 305058297 edges, 349954 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 141715535 markings, 309365443 edges, 380572 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 143650356 markings, 313704465 edges, 386964 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 145495347 markings, 317932083 edges, 368998 markings/sec, 325 secs
lola: sara is running 330 secs || sara is running 330 secs || 147338666 markings, 322131855 edges, 368664 markings/sec, 330 secs
lola: sara is running 335 secs || sara is running 335 secs || 149107961 markings, 326246083 edges, 353859 markings/sec, 335 secs
lola: sara is running 340 secs || sara is running 340 secs || 150903643 markings, 330392387 edges, 359136 markings/sec, 340 secs
lola: sara is running 345 secs || sara is running 345 secs || 152669539 markings, 334496368 edges, 353179 markings/sec, 345 secs
lola: sara is running 350 secs || sara is running 350 secs || 154463660 markings, 338630546 edges, 358824 markings/sec, 350 secs
lola: sara is running 355 secs || sara is running 355 secs || 156398112 markings, 342971927 edges, 386890 markings/sec, 355 secs
lola: sara is running 360 secs || sara is running 360 secs || 158248573 markings, 347194565 edges, 370092 markings/sec, 360 secs
lola: sara is running 365 secs || sara is running 365 secs || 160046303 markings, 351341018 edges, 359546 markings/sec, 365 secs
lola: sara is running 370 secs || sara is running 370 secs || 161807301 markings, 355409458 edges, 352200 markings/sec, 370 secs
lola: sara is running 375 secs || sara is running 375 secs || 162676886 markings, 357444655 edges, 173917 markings/sec, 375 secs
lola: sara is running 380 secs || sara is running 380 secs || 162748724 markings, 357618624 edges, 14368 markings/sec, 380 secs
lola: sara is running 385 secs || sara is running 385 secs || 162750699 markings, 357623761 edges, 395 markings/sec, 385 secs
lola: sara is running 390 secs || sara is running 390 secs || 162753135 markings, 357629551 edges, 487 markings/sec, 390 secs
lola: sara is running 395 secs || sara is running 395 secs || 162755518 markings, 357635606 edges, 477 markings/sec, 395 secs
lola: sara is running 400 secs || sara is running 400 secs || 162756835 markings, 357638799 edges, 263 markings/sec, 400 secs
lola: sara is running 405 secs || sara is running 405 secs || 162760488 markings, 357647695 edges, 731 markings/sec, 405 secs
lola: sara is running 410 secs || sara is running 410 secs || 162761660 markings, 357650267 edges, 234 markings/sec, 410 secs
lola: sara is running 415 secs || sara is running 415 secs || 162761733 markings, 357650455 edges, 15 markings/sec, 415 secs
lola: sara is running 420 secs || sara is running 420 secs || 162762666 markings, 357652993 edges, 187 markings/sec, 420 secs
lola: sara is running 425 secs || sara is running 425 secs || 162765786 markings, 357660682 edges, 624 markings/sec, 425 secs
lola: sara is running 430 secs || sara is running 430 secs || 162772591 markings, 357676442 edges, 1361 markings/sec, 430 secs
lola: sara is running 435 secs || sara is running 435 secs || 162775373 markings, 357683033 edges, 556 markings/sec, 435 secs
lola: sara is running 440 secs || sara is running 440 secs || 162775435 markings, 357683161 edges, 12 markings/sec, 440 secs
lola: sara is running 445 secs || sara is running 445 secs || 162775503 markings, 357683316 edges, 14 markings/sec, 445 secs
lola: sara is running 450 secs || sara is running 450 secs || 162780096 markings, 357694407 edges, 919 markings/sec, 450 secs
lola: sara is running 455 secs || sara is running 455 secs || 162787085 markings, 357711580 edges, 1398 markings/sec, 455 secs
lola: sara is running 460 secs || sara is running 460 secs || 162789487 markings, 357717485 edges, 480 markings/sec, 460 secs
lola: sara is running 465 secs || sara is running 465 secs || 162794287 markings, 357728603 edges, 960 markings/sec, 465 secs
lola: sara is running 470 secs || sara is running 470 secs || 162796743 markings, 357734879 edges, 491 markings/sec, 470 secs
lola: sara is running 475 secs || sara is running 475 secs || 162798340 markings, 357738882 edges, 319 markings/sec, 475 secs
lola: sara is running 480 secs || sara is running 480 secs || 162798404 markings, 357739030 edges, 13 markings/sec, 480 secs
lola: sara is running 485 secs || sara is running 485 secs || 162801655 markings, 357747306 edges, 650 markings/sec, 485 secs
lola: sara is running 490 secs || sara is running 490 secs || 162803534 markings, 357751912 edges, 376 markings/sec, 490 secs
lola: sara is running 495 secs || sara is running 495 secs || 162805654 markings, 357756871 edges, 424 markings/sec, 495 secs
lola: sara is running 500 secs || sara is running 500 secs || 162808262 markings, 357763198 edges, 522 markings/sec, 500 secs
lola: sara is running 505 secs || sara is running 505 secs || 162808322 markings, 357763349 edges, 12 markings/sec, 505 secs
lola: sara is running 510 secs || sara is running 510 secs || 162811885 markings, 357772163 edges, 713 markings/sec, 510 secs
lola: sara is running 515 secs || sara is running 515 secs || 162814364 markings, 357778199 edges, 496 markings/sec, 515 secs
lola: sara is running 520 secs || sara is running 520 secs || 162816356 markings, 357783199 edges, 398 markings/sec, 520 secs
lola: sara is running 525 secs || sara is running 525 secs || 162817271 markings, 357785783 edges, 183 markings/sec, 525 secs
lola: sara is running 530 secs || sara is running 530 secs || 162817673 markings, 357786817 edges, 80 markings/sec, 530 secs
lola: sara is running 535 secs || sara is running 535 secs || 162818420 markings, 357788430 edges, 149 markings/sec, 535 secs
lola: sara is running 540 secs || sara is running 540 secs || 162823975 markings, 357801723 edges, 1111 markings/sec, 540 secs
lola: sara is running 545 secs || sara is running 545 secs || 162829918 markings, 357816807 edges, 1189 markings/sec, 545 secs
lola: sara is running 550 secs || sara is running 550 secs || 162829985 markings, 357816933 edges, 13 markings/sec, 550 secs
lola: sara is running 555 secs || sara is running 555 secs || 162830421 markings, 357817984 edges, 87 markings/sec, 555 secs
lola: sara is running 560 secs || sara is running 560 secs || 162831096 markings, 357819833 edges, 135 markings/sec, 560 secs
lola: sara is running 565 secs || sara is running 565 secs || 162833245 markings, 357825319 edges, 430 markings/sec, 565 secs
lola: sara is running 570 secs || sara is running 570 secs || 162835372 markings, 357830146 edges, 425 markings/sec, 570 secs
lola: sara is running 575 secs || sara is running 575 secs || 162840520 markings, 357842537 edges, 1030 markings/sec, 575 secs
lola: sara is running 580 secs || sara is running 580 secs || 162840606 markings, 357842731 edges, 17 markings/sec, 580 secs
lola: sara is running 585 secs || sara is running 585 secs || 162842208 markings, 357846905 edges, 320 markings/sec, 585 secs
lola: sara is running 590 secs || sara is running 590 secs || 162846666 markings, 357857687 edges, 892 markings/sec, 590 secs
lola: sara is running 595 secs || sara is running 595 secs || 162850386 markings, 357866985 edges, 744 markings/sec, 595 secs
lola: sara is running 600 secs || sara is running 600 secs || 162857560 markings, 357884859 edges, 1435 markings/sec, 600 secs
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: subprocess 14 will run for 1463 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((Pback3 <= Pm2) AND E (G (E (F ((P2 <= Pm4))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1463 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Pback3 <= Pm2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Pback3 <= Pm2)
lola: processed formula length: 15
lola: 28 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 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 15 will run for 2926 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((P2 <= Pm4)))))
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 <= Pm4)
lola: processed formula length: 11
lola: 31 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 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: (P2 <= Pm4)
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 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: (Pm4 + 1 <= P2)
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-1.sara
lola: state equation: write sara problem file to CTLCardinality-15-0.sara
lola: lola: state equation: calling and running sara
state equation: calling and running sara
sara: try reading problem file CTLCardinality-15-0.sara.
sara: place or transition ordering is non-deterministic
sara: try reading problem file CTLCardinality-15-1.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 3334635 markings, 6673295 edges, 666927 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 4076157 markings, 8154331 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 2920 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (E (F ((Pout2 <= Pback2))))) OR (E (((2 <= Pout3) U (3 <= Pout2))) AND E (G ((Pm2 + 1 <= P2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2920 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((Pm2 + 1 <= P2)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((Pm2 + 1 <= P2)))
lola: processed formula length: 23
lola: 29 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 is possibly preserved.
lola: 2002 markings, 2002 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((Pout2 <= Pback2)))))
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: (Pout2 <= Pback2)
lola: processed formula length: 17
lola: 31 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 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: (Pout2 <= Pback2)
lola: state equation task get result unparse finished id 1
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (Pback2 + 1 <= Pout2)
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: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-17-1.sara
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-1.sara.
lola: state equation: calling and running sara
sara: place or transition ordering is non-deterministic
sara: try reading problem file CTLCardinality-17-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: local time limit reached - aborting
lola:
preliminary result: yes no no yes no unknown yes no no yes yes yes yes no yes unknown
lola: memory consumption: 88616 KB
lola: time consumption: 651 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
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: ((Pm1 <= Pback3) AND E (F (A (G ((Pback1 <= Pout4))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (Pm1 <= Pback3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Pm1 <= Pback3)
lola: processed formula length: 15
lola: 28 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((Pback1 <= Pout4)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (Pout4 + 1 <= Pback1)
lola: processed formula length: 21
lola: 32 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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (Pback1 <= Pout4)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (Pout4 + 1 <= Pback1)
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-17-0.sara
lola: state equation: write sara problem file to CTLCardinality-17-1.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-17-0.sara.
sara: try reading problem file CTLCardinality-17-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 3643040 markings, 6669619 edges, 728608 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 6708475 markings, 12910713 edges, 613087 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 9488466 markings, 18681686 edges, 555998 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 12207872 markings, 24337831 edges, 543881 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 14864652 markings, 29909434 edges, 531356 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 17533168 markings, 35490340 edges, 533703 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 20257336 markings, 41166147 edges, 544834 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 22953438 markings, 46786923 edges, 539220 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 25664288 markings, 52430500 edges, 542170 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 28354010 markings, 58046118 edges, 537944 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 31079390 markings, 63714411 edges, 545076 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 33834565 markings, 69436359 edges, 551035 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 36416463 markings, 74925605 edges, 516380 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 38879653 markings, 80214931 edges, 492638 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 41329761 markings, 85448938 edges, 490022 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 43721122 markings, 90585817 edges, 478272 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 46070196 markings, 95678733 edges, 469815 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 48441566 markings, 100786806 edges, 474274 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 50774458 markings, 105827116 edges, 466578 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 53081700 markings, 110849421 edges, 461448 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 55367095 markings, 115828572 edges, 457079 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 57657760 markings, 120823902 edges, 458133 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 59892449 markings, 125730101 edges, 446938 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 62157738 markings, 130673417 edges, 453058 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 64374447 markings, 135548299 edges, 443342 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 66649741 markings, 140496428 edges, 455059 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 68882653 markings, 145356867 edges, 446582 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 71057997 markings, 150145918 edges, 435069 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 73179364 markings, 154874289 edges, 424273 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 75285230 markings, 159594619 edges, 421173 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 77418825 markings, 164332004 edges, 426719 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 79509228 markings, 169007697 edges, 418081 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 81657741 markings, 173750392 edges, 429703 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 83807618 markings, 178473524 edges, 429975 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 85848980 markings, 183063584 edges, 408272 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 87971571 markings, 187748040 edges, 424518 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 90021356 markings, 192344670 edges, 409957 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 92066898 markings, 196906202 edges, 409108 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 94158052 markings, 201565133 edges, 418231 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 96195615 markings, 206107756 edges, 407513 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 98173166 markings, 210597941 edges, 395510 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 100247440 markings, 215205688 edges, 414855 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 102290056 markings, 219760363 edges, 408523 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 104310601 markings, 224281587 edges, 404109 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 106259724 markings, 228699039 edges, 389825 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 108273495 markings, 233207578 edges, 402754 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 110195666 markings, 237591076 edges, 384434 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 112201342 markings, 242099074 edges, 401135 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 114187431 markings, 246564659 edges, 397218 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 116125279 markings, 250962130 edges, 387570 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 118079972 markings, 255382192 edges, 390939 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 120081948 markings, 259877472 edges, 400395 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 122049423 markings, 264314184 edges, 393495 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 123947088 markings, 268618857 edges, 379533 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 125912717 markings, 273042992 edges, 393126 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 127937328 markings, 277540571 edges, 404922 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 129759047 markings, 281782436 edges, 364344 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 131633221 markings, 286078290 edges, 374835 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 133460112 markings, 290317231 edges, 365378 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 135209390 markings, 294422843 edges, 349856 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 137025084 markings, 298633445 edges, 363139 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 138897143 markings, 302898476 edges, 374412 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 140681931 markings, 307057285 edges, 356958 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 142666392 markings, 311471832 edges, 396892 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 144531348 markings, 315735716 edges, 372991 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 146449197 markings, 320073276 edges, 383570 markings/sec, 325 secs
lola: sara is running 330 secs || sara is running 330 secs || 148215349 markings, 324180566 edges, 353230 markings/sec, 330 secs
lola: sara is running 335 secs || sara is running 335 secs || 150066467 markings, 328436610 edges, 370224 markings/sec, 335 secs
lola: sara is running 340 secs || sara is running 340 secs || 151823860 markings, 332536488 edges, 351479 markings/sec, 340 secs
lola: sara is running 345 secs || sara is running 345 secs || 153613319 markings, 336674680 edges, 357892 markings/sec, 345 secs
lola: sara is running 350 secs || sara is running 350 secs || 155505763 markings, 340970564 edges, 378489 markings/sec, 350 secs
lola: sara is running 355 secs || sara is running 355 secs || 157433734 markings, 345323228 edges, 385594 markings/sec, 355 secs
lola: sara is running 360 secs || sara is running 360 secs || 159261091 markings, 349519466 edges, 365471 markings/sec, 360 secs
lola: sara is running 365 secs || sara is running 365 secs || 161035417 markings, 353630245 edges, 354865 markings/sec, 365 secs
lola: sara is running 370 secs || sara is running 370 secs || 162551557 markings, 357171365 edges, 303228 markings/sec, 370 secs
lola: sara is running 375 secs || sara is running 375 secs || 162776622 markings, 357685930 edges, 45013 markings/sec, 375 secs
lola: sara is running 380 secs || sara is running 380 secs || 162781981 markings, 357699067 edges, 1072 markings/sec, 380 secs
lola: sara is running 385 secs || sara is running 385 secs || 162782049 markings, 357699212 edges, 14 markings/sec, 385 secs
lola: sara is running 390 secs || sara is running 390 secs || 162782502 markings, 357700448 edges, 91 markings/sec, 390 secs
lola: sara is running 395 secs || sara is running 395 secs || 162784784 markings, 357705902 edges, 456 markings/sec, 395 secs
lola: sara is running 400 secs || sara is running 400 secs || 162784845 markings, 357706050 edges, 12 markings/sec, 400 secs
lola: sara is running 405 secs || sara is running 405 secs || 162786927 markings, 357711201 edges, 416 markings/sec, 405 secs
lola: sara is running 410 secs || sara is running 410 secs || 162788497 markings, 357715146 edges, 314 markings/sec, 410 secs
lola: sara is running 415 secs || sara is running 415 secs || 162788886 markings, 357716055 edges, 78 markings/sec, 415 secs
lola: sara is running 420 secs || sara is running 420 secs || 162789504 markings, 357717524 edges, 124 markings/sec, 420 secs
lola: sara is running 425 secs || sara is running 425 secs || 162790341 markings, 357719508 edges, 167 markings/sec, 425 secs
lola: sara is running 430 secs || sara is running 430 secs || 162791132 markings, 357721397 edges, 158 markings/sec, 430 secs
lola: sara is running 435 secs || sara is running 435 secs || 162795903 markings, 357732620 edges, 954 markings/sec, 435 secs
lola: sara is running 440 secs || sara is running 440 secs || 162799807 markings, 357742582 edges, 781 markings/sec, 440 secs
lola: sara is running 445 secs || sara is running 445 secs || 162801282 markings, 357746330 edges, 295 markings/sec, 445 secs
lola: sara is running 450 secs || sara is running 450 secs || 162801341 markings, 357746474 edges, 12 markings/sec, 450 secs
lola: sara is running 455 secs || sara is running 455 secs || 162803492 markings, 357751801 edges, 430 markings/sec, 455 secs
lola: sara is running 460 secs || sara is running 460 secs || 162805446 markings, 357756420 edges, 391 markings/sec, 460 secs
lola: sara is running 465 secs || sara is running 465 secs || 162807450 markings, 357761249 edges, 401 markings/sec, 465 secs
lola: sara is running 470 secs || sara is running 470 secs || 162811368 markings, 357770854 edges, 784 markings/sec, 470 secs
lola: sara is running 475 secs || sara is running 475 secs || 162815268 markings, 357780494 edges, 780 markings/sec, 475 secs
lola: sara is running 480 secs || sara is running 480 secs || 162815318 markings, 357780621 edges, 10 markings/sec, 480 secs
lola: sara is running 485 secs || sara is running 485 secs || 162817903 markings, 357787313 edges, 517 markings/sec, 485 secs
lola: sara is running 490 secs || sara is running 490 secs || 162819729 markings, 357791336 edges, 365 markings/sec, 490 secs
lola: sara is running 495 secs || sara is running 495 secs || 162820715 markings, 357793686 edges, 197 markings/sec, 495 secs
lola: sara is running 500 secs || sara is running 500 secs || 162821539 markings, 357795732 edges, 165 markings/sec, 500 secs
lola: sara is running 505 secs || sara is running 505 secs || 162821572 markings, 357795809 edges, 7 markings/sec, 505 secs
lola: sara is running 510 secs || sara is running 510 secs || 162826117 markings, 357807314 edges, 909 markings/sec, 510 secs
lola: sara is running 515 secs || sara is running 515 secs || 162826174 markings, 357807465 edges, 11 markings/sec, 515 secs
lola: sara is running 520 secs || sara is running 520 secs || 162826243 markings, 357807619 edges, 14 markings/sec, 520 secs
lola: sara is running 525 secs || sara is running 525 secs || 162826313 markings, 357807777 edges, 14 markings/sec, 525 secs
lola: sara is running 530 secs || sara is running 530 secs || 162830846 markings, 357819120 edges, 907 markings/sec, 530 secs
lola: sara is running 535 secs || sara is running 535 secs || 162832454 markings, 357823310 edges, 322 markings/sec, 535 secs
lola: sara is running 540 secs || sara is running 540 secs || 162838005 markings, 357836384 edges, 1110 markings/sec, 540 secs
lola: sara is running 545 secs || sara is running 545 secs || 162838068 markings, 357836521 edges, 13 markings/sec, 545 secs
lola: sara is running 550 secs || sara is running 550 secs || 162838157 markings, 357836712 edges, 18 markings/sec, 550 secs
lola: sara is running 555 secs || sara is running 555 secs || 162838234 markings, 357836891 edges, 15 markings/sec, 555 secs
lola: sara is running 560 secs || sara is running 560 secs || 162842787 markings, 357848318 edges, 911 markings/sec, 560 secs
lola: sara is running 565 secs || sara is running 565 secs || 162843949 markings, 357851088 edges, 232 markings/sec, 565 secs
lola: sara is running 570 secs || sara is running 570 secs || 162845131 markings, 357853929 edges, 236 markings/sec, 570 secs
lola: sara is running 575 secs || sara is running 575 secs || 162848431 markings, 357862026 edges, 660 markings/sec, 575 secs
lola: sara is running 580 secs || sara is running 580 secs || 162848480 markings, 357862177 edges, 10 markings/sec, 580 secs
lola: sara is running 585 secs || sara is running 585 secs || 162855013 markings, 357878430 edges, 1307 markings/sec, 585 secs
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 (G (E (F ((Pout2 <= Pback2))))) OR (E (((2 <= Pout3) U (3 <= Pout2))) AND E (G ((Pm2 + 1 <= P2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (G ((Pm2 + 1 <= P2)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((Pm2 + 1 <= P2)))
lola: processed formula length: 23
lola: 29 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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (P2 <= Pm2)
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 is possibly preserved.
lola: 2002 markings, 2002 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (((2 <= Pout3) U (3 <= Pout2)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((2 <= Pout3) U (3 <= Pout2)))
lola: processed formula length: 33
lola: 31 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: (3 <= Pout2)
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 /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((Pout2 <= Pback2)))))
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: (Pout2 <= Pback2)
lola: processed formula length: 17
lola: 31 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: (Pback2 + 1 <= Pout2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (Pout2 <= Pback2)
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-19-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLCardinality-19-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-19-1.sara.
sara: try reading problem file CTLCardinality-19-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 3049904 markings, 7468390 edges, 609981 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 6057498 markings, 14952016 edges, 601519 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 9036142 markings, 22374160 edges, 595729 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 11927612 markings, 29582229 edges, 578294 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 14752374 markings, 36625087 edges, 564952 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 17693126 markings, 43960345 edges, 588150 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 20545605 markings, 51074033 edges, 570496 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 23375260 markings, 58136325 edges, 565931 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 26156594 markings, 65073979 edges, 556267 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 28917119 markings, 71962429 edges, 552105 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 31695751 markings, 78899182 edges, 555726 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 34433221 markings, 85729364 edges, 547494 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 37131970 markings, 92465458 edges, 539750 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 39826587 markings, 99191150 edges, 538923 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 42478526 markings, 105813111 edges, 530388 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 45080750 markings, 112307292 edges, 520445 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 47877343 markings, 119290715 edges, 559319 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 50595290 markings, 126074099 edges, 543589 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 53289078 markings, 132799971 edges, 538758 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 55943841 markings, 139428268 edges, 530953 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 58622965 markings, 146117178 edges, 535825 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 61239284 markings, 152649170 edges, 523264 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 63856695 markings, 159186757 edges, 523482 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 66413675 markings, 165570130 edges, 511396 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 69108141 markings, 172300318 edges, 538893 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 71738929 markings, 178867905 edges, 526158 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 74359436 markings, 185413081 edges, 524101 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 76931485 markings, 191833673 edges, 514410 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 79495096 markings, 198236353 edges, 512722 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 82084571 markings, 204703716 edges, 517895 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 84612354 markings, 211016587 edges, 505557 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 87157470 markings, 217372833 edges, 509023 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 89663233 markings, 223630392 edges, 501153 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 92183295 markings, 229923803 edges, 504012 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 94970793 markings, 236882994 edges, 557500 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 97686952 markings, 243666864 edges, 543232 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 100384257 markings, 250403232 edges, 539461 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 103036402 markings, 257026999 edges, 530429 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 105638714 markings, 263528978 edges, 520462 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 108301701 markings, 270179701 edges, 532597 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 110916228 markings, 276709133 edges, 522905 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 113481641 markings, 283115784 edges, 513083 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 116082789 markings, 289611540 edges, 520230 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 118626082 markings, 295965863 edges, 508659 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 121134336 markings, 302229092 edges, 501651 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 123788411 markings, 308860561 edges, 530815 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 126393075 markings, 315364917 edges, 520933 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 128942848 markings, 321732252 edges, 509955 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 131513088 markings, 328153657 edges, 514048 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 134032906 markings, 334446187 edges, 503964 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 136510194 markings, 340635222 edges, 495458 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 139049929 markings, 346980215 edges, 507947 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 141592704 markings, 353329684 edges, 508555 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 144082717 markings, 359550452 edges, 498003 markings/sec, 265 secs
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: RESULT
lola:
SUMMARY: yes no no yes no unknown yes no no yes yes yes yes no yes unknown
lola:
preliminary result: yes no no yes no unknown yes no no yes yes yes yes no yes unknown
lola: memory consumption: 21016 KB
lola: time consumption: 1549 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished
BK_STOP 1552735617379
--------------------
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="Kanban-PT-02000"
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 Kanban-PT-02000, 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 r093-smll-155246583900076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Kanban-PT-02000.tgz
mv Kanban-PT-02000 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 '
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 ;