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-155246583900031.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-00050, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r093-smll-155246583900031
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 3.9K Feb 11 22:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 11 22:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 7 23:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 7 23:28 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.2K Feb 5 00:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.4K Feb 5 00:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.7K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 4 06:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Feb 4 06:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Jan 31 23:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Jan 31 23:48 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-00050-CTLCardinality-00
FORMULA_NAME Kanban-PT-00050-CTLCardinality-01
FORMULA_NAME Kanban-PT-00050-CTLCardinality-02
FORMULA_NAME Kanban-PT-00050-CTLCardinality-03
FORMULA_NAME Kanban-PT-00050-CTLCardinality-04
FORMULA_NAME Kanban-PT-00050-CTLCardinality-05
FORMULA_NAME Kanban-PT-00050-CTLCardinality-06
FORMULA_NAME Kanban-PT-00050-CTLCardinality-07
FORMULA_NAME Kanban-PT-00050-CTLCardinality-08
FORMULA_NAME Kanban-PT-00050-CTLCardinality-09
FORMULA_NAME Kanban-PT-00050-CTLCardinality-10
FORMULA_NAME Kanban-PT-00050-CTLCardinality-11
FORMULA_NAME Kanban-PT-00050-CTLCardinality-12
FORMULA_NAME Kanban-PT-00050-CTLCardinality-13
FORMULA_NAME Kanban-PT-00050-CTLCardinality-14
FORMULA_NAME Kanban-PT-00050-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552671857054

info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ Kanban-PT-00050 @ 3570 seconds

FORMULA Kanban-PT-00050-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00050-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00050-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00050-CTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00050-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00050-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00050-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00050-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA Kanban-PT-00050-CTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00050-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00050-CTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00050-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00050-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00050-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00050-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1717
rslt: Output for CTLCardinality @ Kanban-PT-00050

{
"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": "Fri Mar 15 17:44:17 2019
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"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": "EF(AX(((1 <= Pback1) AND (2 <= Pm1))))",
"processed_size": 38,
"rewrites": 29
},
"net":
{
"conflict_clusters": 12,
"singleton_clusters": 0
},
"result":
{
"edges": 12774,
"markings": 6042,
"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": 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 ((P2 <= 1)))",
"processed_size": 17,
"rewrites": 28
},
"result":
{
"edges": 147,
"markings": 148,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "EF(((3 <= Pout3) AND AX((Pm2 <= Pback1))))",
"processed_size": 42,
"rewrites": 29
},
"net":
{
"conflict_clusters": 12,
"singleton_clusters": 0
},
"result":
{
"edges": 80034,
"markings": 32187,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 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": "EF(AX((P1 <= Pm2)))",
"processed_size": 19,
"rewrites": 29
},
"net":
{
"conflict_clusters": 12,
"singleton_clusters": 0
},
"result":
{
"edges": 797,
"markings": 452,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 3,
"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": "((Pout4 <= 2) AND (Pback3 <= 1) AND (2 <= P2))",
"processed_size": 46,
"rewrites": 27
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 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 ((Pm3 + 1 <= P4)))",
"processed_size": 23,
"rewrites": 29
},
"result":
{
"edges": 50,
"markings": 51,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E ((((Pm1 <= P4) OR (Pm1 <= Pout4)) U ((P4 <= Pback4) AND (1 <= Pout1))))",
"processed_size": 74,
"rewrites": 30
},
"result":
{
"edges": 106,
"markings": 106,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F ((((3 <= Pout1) OR (2 <= Pout3)) AND ((3 <= Pout3) OR (Pback3 <= Pout1)) AND (1 <= Pm1))))",
"processed_size": 97,
"rewrites": 28
},
"result":
{
"edges": 27,
"markings": 28,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 12,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"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": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "AG(E((Pout4 <= P2) U (Pm2 <= Pback2)))",
"processed_size": 38,
"rewrites": 29
},
"net":
{
"conflict_clusters": 12,
"singleton_clusters": 0
},
"result":
{
"edges": 3202,
"markings": 1006,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 534
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E ((((Pout3 <= Pback2) AND (Pback2 <= Pm3) AND (Pback3 <= 1)) U (2 <= Pback1)))",
"processed_size": 79,
"rewrites": 30
},
"result":
{
"edges": 7098392,
"markings": 1490589,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_until",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 667
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": 2,
"visible_transitions": 0
},
"processed": "((2 <= Pm4) AND (Pm4 <= P4))",
"processed_size": 28,
"rewrites": 27
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 889
},
"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 <= Pback1)",
"processed_size": 18,
"rewrites": 27
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1334
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (((1 <= Pout2) OR (1 <= P3))))",
"processed_size": 36,
"rewrites": 29
},
"result":
{
"edges": 150,
"markings": 151,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1334
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(((P3 <= Pout2) OR (1 <= Pm3)) AND (Pout4 + 1 <= P2))",
"processed_size": 54,
"rewrites": 27
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1334
},
"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": "(Pm1 + 1 <= Pback4)",
"processed_size": 19,
"rewrites": 27
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2668
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((P2 <= 0)))",
"processed_size": 17,
"rewrites": 28
},
"result":
{
"edges": 150,
"markings": 151,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

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

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"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": "A (G (((Pout2 <= P2) OR (2 <= Pback3) OR (P4 <= 1))))",
"processed_size": 55,
"rewrites": 29
},
"result":
{
"edges": 103,
"markings": 104,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 18,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 21656,
"runtime": 1853.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E(F(A(X(**)))) : (E(G(A(X(**)))) OR E(F(**))) : A(G(**)) : (E(F(*)) OR (* OR A(F(*)))) : (A(G(**)) OR **) : E(F((** AND A(X(**))))) : E((** U **)) : (E(X(**)) OR E(F(A(X(**))))) : (A(G(*)) AND (* AND A(X(*)))) : A(G(E((** U **)))) : E(G((A(G(**)) OR **))) : ((** AND A((** U **))) OR A(G(**))) : E((** U A(G(**)))) : ((** OR A(G(**))) AND **) : (E((** U **)) OR E(X(**)))"
},
"net":
{
"arcs": 40,
"conflict_clusters": 12,
"places": 16,
"places_significant": 11,
"singleton_clusters": 0,
"transitions": 16
},
"result":
{
"preliminary_value": "yes yes yes no yes no yes yes yes no no unknown no unknown no yes ",
"value": "yes yes yes no yes no yes yes yes no no unknown no unknown no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 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 (F ((((3 <= Pout1) OR (2 <= Pout3)) AND ((3 <= Pout3) OR (Pback3 <= Pout1)) AND (1 <= Pm1)))) : E (F (A (X (((1 <= Pback1) AND (2 <= Pm1)))))) : (E (G (A (X ((3 <= Pback2))))) OR E (F ((P2 <= 1)))) : E (G (A (G (((3 <= P3) OR (1 <= Pout2)))))) : NOT(((A (G ((1 <= P2))) AND (Pback4 <= Pm1)) AND E (G ((Pback1 <= Pout1))))) : (A (G ((Pm3 + 1 <= P4))) OR ((((P3 <= Pout2) OR (1 <= Pm3)) AND (Pout4 + 1 <= P2)) AND (E (G ((0 <= 0))) OR A (X ((1 <= Pback2)))))) : E (F (((3 <= Pout3) AND A (X ((Pm2 <= Pback1)))))) : E ((((Pout3 <= Pback2) AND (Pback2 <= Pm3) AND (Pback3 <= 1)) U (2 <= Pback1))) : (E (X (((Pm3 <= Pback1) AND (2 <= Pout2) AND ((P2 <= Pout3) OR (3 <= Pout1))))) OR E (F (A (X ((P1 <= Pm2)))))) : NOT((E (((0 <= 0) U (P4 <= Pm3))) OR (((3 <= Pout4) OR (2 <= Pback3) OR (P2 <= 1)) OR E (X ((2 <= Pm4)))))) : A (G (E (((Pout4 <= P2) U (Pm2 <= Pback2))))) : E (G ((A (G ((2 <= P3))) OR (2 <= Pm4)))) : (((P4 <= Pback3) AND A (((P2 <= Pm1) U (Pback1 <= Pm2)))) OR A (G (((Pout2 <= P2) OR (2 <= Pback3) OR (P4 <= 1))))) : E (((1 <= P4) U A (G ((P2 <= Pout2))))) : ((((2 <= Pm4) AND (Pm4 <= P4)) OR A (G (((1 <= Pout2) OR (1 <= P3))))) AND (Pback3 <= Pback1)) : (E ((((Pm1 <= P4) OR (Pm1 <= Pout4)) U ((P4 <= Pback4) AND (1 <= Pout1)))) OR E (X ((P4 <= Pback2))))
lola: rewrite Frontend/Parser/formula_rewrite.k:476
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k: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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k: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 (F (A (X (((1 <= Pback1) AND (2 <= Pm1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX(((1 <= Pback1) AND (2 <= Pm1))))
lola: processed formula length: 38
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: 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: 6042 markings, 12774 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (A (X ((3 <= Pback2))))) OR E (F ((P2 <= 1))))
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: E (F ((P2 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((P2 <= 1)))
lola: processed formula length: 17
lola: 28 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: (P2 <= 1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 148 markings, 147 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= Pout3) AND A (X ((Pm2 <= Pback1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(((3 <= Pout3) AND AX((Pm2 <= Pback1))))
lola: processed formula length: 42
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: 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: 32187 markings, 80034 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (((Pm3 <= Pback1) AND (2 <= Pout2) AND ((P2 <= Pout3) OR (3 <= Pout1))))) OR E (F (A (X ((P1 <= Pm2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((P1 <= Pm2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX((P1 <= Pm2)))
lola: processed formula length: 19
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: 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: 452 markings, 797 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((Pm3 + 1 <= P4))) AND (((Pout4 <= 2) AND (Pback3 <= 1) AND (2 <= P2)) AND A (X ((Pm4 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((Pout4 <= 2) AND (Pback3 <= 1) AND (2 <= P2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Pout4 <= 2) AND (Pback3 <= 1) AND (2 <= P2))
lola: processed formula length: 46
lola: 27 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((Pm3 + 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:788
lola: processed formula: A (G ((Pm3 + 1 <= P4)))
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)
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: (P4 <= Pm3)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 51 markings, 50 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((((Pm1 <= P4) OR (Pm1 <= Pout4)) U ((P4 <= Pback4) AND (1 <= Pout1)))) OR E (X ((P4 <= Pback2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((Pm1 <= P4) OR (Pm1 <= Pout4)) U ((P4 <= Pback4) AND (1 <= Pout1))))
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 ((((Pm1 <= P4) OR (Pm1 <= Pout4)) U ((P4 <= Pback4) AND (1 <= Pout1))))
lola: processed formula length: 74
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 /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: ((P4 <= Pback4) AND (1 <= Pout1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 106 markings, 106 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= P3) OR (1 <= Pout2))))
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 (((3 <= P3) OR (1 <= Pout2))))
lola: processed formula length: 36
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: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: ((P3 <= 2) AND (Pout2 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 145 markings, 144 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((3 <= Pout1) OR (2 <= Pout3)) AND ((3 <= Pout3) OR (Pback3 <= Pout1)) AND (1 <= Pm1))))
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 ((((3 <= Pout1) OR (2 <= Pout3)) AND ((3 <= Pout3) OR (Pback3 <= Pout1)) AND (1 <= Pm1))))
lola: processed formula length: 97
lola: 28 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: (((3 <= Pout1) OR (2 <= Pout3)) AND ((3 <= Pout3) OR (Pback3 <= Pout1)) AND (1 <= Pm1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 28 markings, 27 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((A (G ((2 <= P3))) OR (2 <= Pm4))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((AG((2 <= P3)) OR (2 <= Pm4)))
lola: processed formula length: 33
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: 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: 2143691 markings, 7453776 edges, 428738 markings/sec, 0 secs
lola: 3914132 markings, 14177902 edges, 354088 markings/sec, 5 secs
lola: 5550225 markings, 20631569 edges, 327219 markings/sec, 10 secs
lola: 7118784 markings, 26918328 edges, 313712 markings/sec, 15 secs
lola: 8612838 markings, 33039751 edges, 298811 markings/sec, 20 secs
lola: 10064823 markings, 39007320 edges, 290397 markings/sec, 25 secs
lola: 11498968 markings, 44930711 edges, 286829 markings/sec, 30 secs
lola: 12896289 markings, 50809332 edges, 279464 markings/sec, 35 secs
lola: 14259397 markings, 56580030 edges, 272622 markings/sec, 40 secs
lola: 15595104 markings, 62292407 edges, 267141 markings/sec, 45 secs
lola: 16899473 markings, 67933718 edges, 260874 markings/sec, 50 secs
lola: 18284594 markings, 73748992 edges, 277024 markings/sec, 55 secs
lola: 19577734 markings, 79326123 edges, 258628 markings/sec, 60 secs
lola: 20870564 markings, 84894580 edges, 258566 markings/sec, 65 secs
lola: 22110856 markings, 90375381 edges, 248058 markings/sec, 70 secs
lola: 23360817 markings, 95839111 edges, 249992 markings/sec, 75 secs
lola: 24587598 markings, 101263028 edges, 245356 markings/sec, 80 secs
lola: 25852067 markings, 106768800 edges, 252894 markings/sec, 85 secs
lola: 27080085 markings, 112177070 edges, 245604 markings/sec, 90 secs
lola: 28278365 markings, 117511411 edges, 239656 markings/sec, 95 secs
lola: 29475029 markings, 122833622 edges, 239333 markings/sec, 100 secs
lola: 30666205 markings, 128112667 edges, 238235 markings/sec, 105 secs
lola: 31854606 markings, 133413011 edges, 237680 markings/sec, 110 secs
lola: 33024004 markings, 138660271 edges, 233880 markings/sec, 115 secs
lola: 34204645 markings, 143928422 edges, 236128 markings/sec, 120 secs
lola: 35422736 markings, 149305819 edges, 243618 markings/sec, 125 secs
lola: 36575478 markings, 154495465 edges, 230548 markings/sec, 130 secs
lola: 37712359 markings, 159644288 edges, 227376 markings/sec, 135 secs
lola: 38865463 markings, 164827880 edges, 230621 markings/sec, 140 secs
lola: 40002445 markings, 169986460 edges, 227396 markings/sec, 145 secs
lola: 41113188 markings, 175076476 edges, 222149 markings/sec, 150 secs
lola: 42258817 markings, 180222092 edges, 229126 markings/sec, 155 secs
lola: 43413683 markings, 185417988 edges, 230973 markings/sec, 160 secs
lola: 44531883 markings, 190499732 edges, 223640 markings/sec, 165 secs
lola: 45665447 markings, 195635182 edges, 226713 markings/sec, 170 secs
lola: 46799377 markings, 200768846 edges, 226786 markings/sec, 175 secs
lola: 47944275 markings, 205910662 edges, 228980 markings/sec, 180 secs
lola: 49061768 markings, 210988882 edges, 223499 markings/sec, 185 secs
lola: 50172731 markings, 216046871 edges, 222193 markings/sec, 190 secs
lola: 51286185 markings, 221123458 edges, 222691 markings/sec, 195 secs
lola: 52360229 markings, 226087596 edges, 214809 markings/sec, 200 secs
lola: 53460822 markings, 231141203 edges, 220119 markings/sec, 205 secs
lola: 54540436 markings, 236128066 edges, 215923 markings/sec, 210 secs
lola: 55671654 markings, 241217452 edges, 226244 markings/sec, 215 secs
lola: 56751518 markings, 246193201 edges, 215973 markings/sec, 220 secs
lola: 57840155 markings, 251174585 edges, 217727 markings/sec, 225 secs
lola: 58906745 markings, 256136885 edges, 213318 markings/sec, 230 secs
lola: 59992777 markings, 261117851 edges, 217206 markings/sec, 235 secs
lola: 61086362 markings, 266124106 edges, 218717 markings/sec, 240 secs
lola: 62167686 markings, 271093983 edges, 216265 markings/sec, 245 secs
lola: 63237482 markings, 276039923 edges, 213959 markings/sec, 250 secs
lola: 64312213 markings, 280991611 edges, 214946 markings/sec, 255 secs
lola: 65407442 markings, 285997835 edges, 219046 markings/sec, 260 secs
lola: 66491776 markings, 290946873 edges, 216867 markings/sec, 265 secs
lola: 67551831 markings, 295859855 edges, 212011 markings/sec, 270 secs
lola: 68631186 markings, 300793847 edges, 215871 markings/sec, 275 secs
lola: 69696138 markings, 305683247 edges, 212990 markings/sec, 280 secs
lola: 70752407 markings, 310608484 edges, 211254 markings/sec, 285 secs
lola: 71718705 markings, 315134649 edges, 193260 markings/sec, 290 secs
lola: 72809288 markings, 320122281 edges, 218117 markings/sec, 295 secs
lola: 73863104 markings, 325008147 edges, 210763 markings/sec, 300 secs
lola: 74921740 markings, 329931653 edges, 211727 markings/sec, 305 secs
lola: 75963063 markings, 334795379 edges, 208265 markings/sec, 310 secs
lola: 77007369 markings, 339648058 edges, 208861 markings/sec, 315 secs
lola: 78068439 markings, 344546420 edges, 212214 markings/sec, 320 secs
lola: 79114400 markings, 349425825 edges, 209192 markings/sec, 325 secs
lola: 80153180 markings, 354287410 edges, 207756 markings/sec, 330 secs
lola: 81180451 markings, 359121152 edges, 205454 markings/sec, 335 secs
lola: 82196855 markings, 363904151 edges, 203281 markings/sec, 340 secs
lola: 83248264 markings, 368777465 edges, 210282 markings/sec, 345 secs
lola: 84278763 markings, 373587849 edges, 206100 markings/sec, 350 secs
lola: 85298546 markings, 378364363 edges, 203957 markings/sec, 355 secs
lola: 86301611 markings, 383121406 edges, 200613 markings/sec, 360 secs
lola: 87345475 markings, 387978787 edges, 208773 markings/sec, 365 secs
lola: 88407352 markings, 392860186 edges, 212375 markings/sec, 370 secs
lola: 89445445 markings, 397698438 edges, 207619 markings/sec, 375 secs
lola: 90473590 markings, 402498598 edges, 205629 markings/sec, 380 secs
lola: 91499216 markings, 407272818 edges, 205125 markings/sec, 385 secs
lola: 92498300 markings, 412012988 edges, 199817 markings/sec, 390 secs
lola: 93532602 markings, 416853418 edges, 206860 markings/sec, 395 secs
lola: 94552866 markings, 421634665 edges, 204053 markings/sec, 400 secs
lola: 95554196 markings, 426398553 edges, 200266 markings/sec, 405 secs
lola: 96584265 markings, 431182791 edges, 206014 markings/sec, 410 secs
lola: 97587379 markings, 435915572 edges, 200623 markings/sec, 415 secs
lola: 98607843 markings, 440676181 edges, 204093 markings/sec, 420 secs
lola: 99605912 markings, 445370372 edges, 199614 markings/sec, 425 secs
lola: 100646462 markings, 450195701 edges, 208110 markings/sec, 430 secs
lola: 101656021 markings, 454939504 edges, 201912 markings/sec, 435 secs
lola: 102221742 markings, 457685048 edges, 113144 markings/sec, 440 secs
lola: local time limit reached - aborting
lola:
preliminary result: yes yes yes no unknown unknown yes unknown yes no unknown unknown unknown unknown unknown yes
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((1 <= P4) U A (G ((P2 <= Pout2)))))
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((1 <= P4) U AG((P2 <= Pout2)))
lola: processed formula length: 32
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: 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: 2000509 markings, 7795162 edges, 400102 markings/sec, 0 secs
lola: 3737266 markings, 15143066 edges, 347351 markings/sec, 5 secs
lola: 5369943 markings, 22199742 edges, 326535 markings/sec, 10 secs
lola: 6915775 markings, 29064477 edges, 309166 markings/sec, 15 secs
lola: 8402865 markings, 35774731 edges, 297418 markings/sec, 20 secs
lola: 9832326 markings, 42379583 edges, 285892 markings/sec, 25 secs
lola: 11267828 markings, 48894303 edges, 287100 markings/sec, 30 secs
lola: 12653051 markings, 55321230 edges, 277045 markings/sec, 35 secs
lola: 14050409 markings, 61766584 edges, 279472 markings/sec, 40 secs
lola: 15385534 markings, 68073686 edges, 267025 markings/sec, 45 secs
lola: 16703402 markings, 74354918 edges, 263574 markings/sec, 50 secs
lola: 18008595 markings, 80558637 edges, 261039 markings/sec, 55 secs
lola: 19272842 markings, 86699040 edges, 252849 markings/sec, 60 secs
lola: 20546768 markings, 92851212 edges, 254785 markings/sec, 65 secs
lola: 21899991 markings, 99136342 edges, 270645 markings/sec, 70 secs
lola: 23157907 markings, 105209102 edges, 251583 markings/sec, 75 secs
lola: 24420287 markings, 111268248 edges, 252476 markings/sec, 80 secs
lola: 25632680 markings, 117242413 edges, 242479 markings/sec, 85 secs
lola: 26891648 markings, 123260908 edges, 251794 markings/sec, 90 secs
lola: 28083701 markings, 129155484 edges, 238411 markings/sec, 95 secs
lola: 29282858 markings, 135046111 edges, 239831 markings/sec, 100 secs
lola: 30494152 markings, 141026629 edges, 242259 markings/sec, 105 secs
lola: 31681249 markings, 146881789 edges, 237419 markings/sec, 110 secs
lola: 32866748 markings, 152773869 edges, 237100 markings/sec, 115 secs
lola: 34054680 markings, 158601707 edges, 237586 markings/sec, 120 secs
lola: 35228857 markings, 164411499 edges, 234835 markings/sec, 125 secs
lola: 36409614 markings, 170214180 edges, 236151 markings/sec, 130 secs
lola: 37567464 markings, 176016773 edges, 231570 markings/sec, 135 secs
lola: 38733320 markings, 181791026 edges, 233171 markings/sec, 140 secs
lola: 39888374 markings, 187549719 edges, 231011 markings/sec, 145 secs
lola: 41085472 markings, 193439665 edges, 239420 markings/sec, 150 secs
lola: 42256818 markings, 199207389 edges, 234269 markings/sec, 155 secs
lola: 43365128 markings, 204864673 edges, 221662 markings/sec, 160 secs
lola: 44484345 markings, 210530211 edges, 223843 markings/sec, 165 secs
lola: 45617688 markings, 216227193 edges, 226669 markings/sec, 170 secs
lola: 46749255 markings, 221915180 edges, 226313 markings/sec, 175 secs
lola: 47844910 markings, 227488962 edges, 219131 markings/sec, 180 secs
lola: 48997569 markings, 233172510 edges, 230532 markings/sec, 185 secs
lola: 50123774 markings, 238841137 edges, 225241 markings/sec, 190 secs
lola: 51265629 markings, 244518058 edges, 228371 markings/sec, 195 secs
lola: 52370716 markings, 250110045 edges, 221017 markings/sec, 200 secs
lola: 53501479 markings, 255786231 edges, 226153 markings/sec, 205 secs
lola: 54594849 markings, 261364253 edges, 218674 markings/sec, 210 secs
lola: 55745126 markings, 267071754 edges, 230055 markings/sec, 215 secs
lola: 56857901 markings, 272654061 edges, 222555 markings/sec, 220 secs
lola: 57942178 markings, 278205128 edges, 216855 markings/sec, 225 secs
lola: 59043044 markings, 283759419 edges, 220173 markings/sec, 230 secs
lola: 60156527 markings, 289377720 edges, 222697 markings/sec, 235 secs
lola: 61213299 markings, 294827530 edges, 211354 markings/sec, 240 secs
lola: 62311728 markings, 300397512 edges, 219686 markings/sec, 245 secs
lola: 63390746 markings, 305887912 edges, 215804 markings/sec, 250 secs
lola: 64489475 markings, 311437955 edges, 219746 markings/sec, 255 secs
lola: 65582350 markings, 316979739 edges, 218575 markings/sec, 260 secs
lola: 66691296 markings, 322525825 edges, 221789 markings/sec, 265 secs
lola: 67742925 markings, 327946522 edges, 210326 markings/sec, 270 secs
lola: 68811918 markings, 333405306 edges, 213799 markings/sec, 275 secs
lola: 69891469 markings, 338899842 edges, 215910 markings/sec, 280 secs
lola: 70983324 markings, 344402791 edges, 218371 markings/sec, 285 secs
lola: 72036903 markings, 349841247 edges, 210716 markings/sec, 290 secs
lola: 73133546 markings, 355330250 edges, 219329 markings/sec, 295 secs
lola: 74185517 markings, 360741961 edges, 210394 markings/sec, 300 secs
lola: 75274574 markings, 366238202 edges, 217811 markings/sec, 305 secs
lola: 76353747 markings, 371734029 edges, 215835 markings/sec, 310 secs
lola: 77422295 markings, 377151662 edges, 213710 markings/sec, 315 secs
lola: 78493219 markings, 382607289 edges, 214185 markings/sec, 320 secs
lola: 79540329 markings, 387991540 edges, 209422 markings/sec, 325 secs
lola: 80575097 markings, 393381723 edges, 206954 markings/sec, 330 secs
lola: 81623154 markings, 398777483 edges, 209611 markings/sec, 335 secs
lola: 82674447 markings, 404195554 edges, 210259 markings/sec, 340 secs
lola: 83699152 markings, 409563063 edges, 204941 markings/sec, 345 secs
lola: 84793114 markings, 415054980 edges, 218792 markings/sec, 350 secs
lola: 85825417 markings, 420407843 edges, 206461 markings/sec, 355 secs
lola: 86882347 markings, 425814210 edges, 211386 markings/sec, 360 secs
lola: 87918246 markings, 431160352 edges, 207180 markings/sec, 365 secs
lola: 88977278 markings, 436530504 edges, 211806 markings/sec, 370 secs
lola: 89991693 markings, 441832209 edges, 202883 markings/sec, 375 secs
lola: 91031220 markings, 447172293 edges, 207905 markings/sec, 380 secs
lola: 92069597 markings, 452509043 edges, 207675 markings/sec, 385 secs
lola: 93111719 markings, 457856945 edges, 208424 markings/sec, 390 secs
lola: 94127181 markings, 463150604 edges, 203092 markings/sec, 395 secs
lola: 95126153 markings, 468384864 edges, 199794 markings/sec, 400 secs
lola: 96153107 markings, 473680052 edges, 205391 markings/sec, 405 secs
lola: 97189298 markings, 478987085 edges, 207238 markings/sec, 410 secs
lola: 98197587 markings, 484261139 edges, 201658 markings/sec, 415 secs
lola: 99193221 markings, 489463460 edges, 199127 markings/sec, 420 secs
lola: 100205055 markings, 494716939 edges, 202367 markings/sec, 425 secs
lola: 101231731 markings, 500021448 edges, 205335 markings/sec, 430 secs
lola: 102268765 markings, 505335787 edges, 207407 markings/sec, 435 secs
lola: local time limit reached - aborting
lola:
preliminary result: yes yes yes no unknown unknown yes unknown yes no unknown unknown unknown unknown unknown yes
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (((Pout4 <= P2) U (Pm2 <= Pback2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(E((Pout4 <= P2) U (Pm2 <= Pback2)))
lola: processed formula length: 38
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: 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: 1006 markings, 3202 edges
lola: ========================================
lola: subprocess 11 will run for 534 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((Pout3 <= Pback2) AND (Pback2 <= Pm3) AND (Pback3 <= 1)) U (2 <= Pback1)))
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 ((((Pout3 <= Pback2) AND (Pback2 <= Pm3) AND (Pback3 <= 1)) U (2 <= Pback1)))
lola: processed formula length: 79
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 /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: (2 <= Pback1)
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: state equation 0: solution produced
lola: sara is running 0 secs || 1460142 markings, 6938057 edges, 292028 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 1490589 markings, 7098392 edges
lola: ========================================
lola: subprocess 12 will run for 667 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((2 <= Pm4) AND (Pm4 <= P4)) OR A (G (((1 <= Pout2) OR (1 <= P3))))) AND (Pback3 <= Pback1))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 667 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= Pm4) AND (Pm4 <= P4))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= Pm4) AND (Pm4 <= P4))
lola: processed formula length: 28
lola: 27 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 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 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Pback3 <= Pback1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Pback3 <= Pback1)
lola: processed formula length: 18
lola: 27 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 1334 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= Pout2) OR (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 (((1 <= Pout2) OR (1 <= P3))))
lola: processed formula length: 36
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: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: ((Pout2 <= 0) AND (P3 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 151 markings, 150 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((Pm3 + 1 <= P4))) OR (((P3 <= Pout2) OR (1 <= Pm3)) AND (Pout4 + 1 <= P2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((Pm3 + 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 ((Pm3 + 1 <= P4)))
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)
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (P4 <= Pm3)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is not invariant.
lola: 51 markings, 50 edges
lola: ========================================
lola: subprocess 14 will run for 1334 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((P3 <= Pout2) OR (1 <= Pm3)) AND (Pout4 + 1 <= P2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((P3 <= Pout2) OR (1 <= Pm3)) AND (Pout4 + 1 <= P2))
lola: processed formula length: 54
lola: 27 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1334 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((P2 <= 0))) OR ((Pm1 + 1 <= Pback4) OR A (F ((Pout1 + 1 <= Pback1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1334 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Pm1 + 1 <= Pback4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Pm1 + 1 <= Pback4)
lola: processed formula length: 19
lola: 27 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 15 will run for 2668 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((P2 <= 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 ((P2 <= 0)))
lola: processed formula length: 17
lola: 28 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: (P2 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 151 markings, 150 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 2668 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((P4 <= Pback3) AND A (((P2 <= Pm1) U (Pback1 <= Pm2)))) OR A (G (((Pout2 <= P2) OR (2 <= Pback3) OR (P4 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2668 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (P4 <= Pback3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P4 <= Pback3)
lola: processed formula length: 14
lola: 27 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: 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: E (G ((A (G ((2 <= P3))) OR (2 <= Pm4))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((AG((2 <= P3)) OR (2 <= Pm4)))
lola: processed formula length: 33
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: 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: 2100665 markings, 7289266 edges, 420133 markings/sec, 0 secs
lola: 3891718 markings, 14092014 edges, 358211 markings/sec, 5 secs
lola: 5541971 markings, 20599705 edges, 330051 markings/sec, 10 secs
lola: 7126977 markings, 26951600 edges, 317001 markings/sec, 15 secs
lola: 8633585 markings, 33130031 edges, 301322 markings/sec, 20 secs
lola: 10113821 markings, 39212670 edges, 296047 markings/sec, 25 secs
lola: 11573168 markings, 45239955 edges, 291869 markings/sec, 30 secs
lola: 12995206 markings, 51214214 edges, 284408 markings/sec, 35 secs
lola: 14383658 markings, 57089718 edges, 277690 markings/sec, 40 secs
lola: 15722789 markings, 62852538 edges, 267826 markings/sec, 45 secs
lola: 17046532 markings, 68568759 edges, 264749 markings/sec, 50 secs
lola: 18457142 markings, 74488765 edges, 282122 markings/sec, 55 secs
lola: 19772484 markings, 80164437 edges, 263068 markings/sec, 60 secs
lola: 21075020 markings, 85798875 edges, 260507 markings/sec, 65 secs
lola: 22327376 markings, 91341233 edges, 250471 markings/sec, 70 secs
lola: 23604459 markings, 96912427 edges, 255417 markings/sec, 75 secs
lola: 24847658 markings, 102418594 edges, 248640 markings/sec, 80 secs
lola: 26130233 markings, 108004828 edges, 256515 markings/sec, 85 secs
lola: 27378802 markings, 113511708 edges, 249714 markings/sec, 90 secs
lola: 28611207 markings, 118967274 edges, 246481 markings/sec, 95 secs
lola: 29827734 markings, 124395956 edges, 243305 markings/sec, 100 secs
lola: 31040819 markings, 129799907 edges, 242617 markings/sec, 105 secs
lola: 32250875 markings, 135215353 edges, 242011 markings/sec, 110 secs
lola: 33454801 markings, 140591695 edges, 240785 markings/sec, 115 secs
lola: 34696104 markings, 146075746 edges, 248261 markings/sec, 120 secs
lola: 35917803 markings, 151509525 edges, 244340 markings/sec, 125 secs
lola: 37098043 markings, 156835075 edges, 236048 markings/sec, 130 secs
lola: 38269919 markings, 162126718 edges, 234375 markings/sec, 135 secs
lola: 39427543 markings, 167401268 edges, 231525 markings/sec, 140 secs
lola: 40587351 markings, 172658889 edges, 231962 markings/sec, 145 secs
lola: 41753709 markings, 177931454 edges, 233272 markings/sec, 150 secs
lola: 42926692 markings, 183240943 edges, 234597 markings/sec, 155 secs
lola: 44100322 markings, 188512837 edges, 234726 markings/sec, 160 secs
lola: 45246718 markings, 193747578 edges, 229279 markings/sec, 165 secs
lola: 46408420 markings, 199019546 edges, 232340 markings/sec, 170 secs
lola: 47587630 markings, 204309803 edges, 235842 markings/sec, 175 secs
lola: 48754525 markings, 209562976 edges, 233379 markings/sec, 180 secs
lola: 49884465 markings, 214735263 edges, 225988 markings/sec, 185 secs
lola: 51024325 markings, 219936179 edges, 227972 markings/sec, 190 secs
lola: 52136682 markings, 225062430 edges, 222471 markings/sec, 195 secs
lola: 53271350 markings, 230272745 edges, 226934 markings/sec, 200 secs
lola: 54386450 markings, 235403646 edges, 223020 markings/sec, 205 secs
lola: 55535692 markings, 240614242 edges, 229848 markings/sec, 210 secs
lola: 56656057 markings, 245741683 edges, 224073 markings/sec, 215 secs
lola: 57776340 markings, 250868754 edges, 224057 markings/sec, 220 secs
lola: 58868824 markings, 255958079 edges, 218497 markings/sec, 225 secs
lola: 59982824 markings, 261071726 edges, 222800 markings/sec, 230 secs
lola: 61105778 markings, 266213973 edges, 224591 markings/sec, 235 secs
lola: 62220361 markings, 271331651 edges, 222917 markings/sec, 240 secs
lola: 63314498 markings, 276404754 edges, 218827 markings/sec, 245 secs
lola: 64426852 markings, 281507134 edges, 222471 markings/sec, 250 secs
lola: 65550453 markings, 286644580 edges, 224720 markings/sec, 255 secs
lola: 66653480 markings, 291706677 edges, 220605 markings/sec, 260 secs
lola: 67735202 markings, 296720634 edges, 216344 markings/sec, 265 secs
lola: 68851070 markings, 301803198 edges, 223174 markings/sec, 270 secs
lola: 69932230 markings, 306800884 edges, 216232 markings/sec, 275 secs
lola: 71023270 markings, 311875230 edges, 218208 markings/sec, 280 secs
lola: 72116577 markings, 316933312 edges, 218661 markings/sec, 285 secs
lola: 73214291 markings, 322000369 edges, 219543 markings/sec, 290 secs
lola: 74308627 markings, 327047629 edges, 218867 markings/sec, 295 secs
lola: 75358555 markings, 332001022 edges, 209986 markings/sec, 300 secs
lola: 76445765 markings, 337008706 edges, 217442 markings/sec, 305 secs
lola: 77503530 markings, 341948221 edges, 211553 markings/sec, 310 secs
lola: 78580396 markings, 346936027 edges, 215373 markings/sec, 315 secs
lola: 79647280 markings, 351919686 edges, 213377 markings/sec, 320 secs
lola: 80704040 markings, 356890391 edges, 211352 markings/sec, 325 secs
lola: 81747335 markings, 361789928 edges, 208659 markings/sec, 330 secs
lola: 82812004 markings, 366738798 edges, 212934 markings/sec, 335 secs
lola: 83866708 markings, 371670082 edges, 210941 markings/sec, 340 secs
lola: 84917129 markings, 376564331 edges, 210084 markings/sec, 345 secs
lola: 85954779 markings, 381470596 edges, 207530 markings/sec, 350 secs
lola: 87010991 markings, 386392321 edges, 211242 markings/sec, 355 secs
lola: 88075803 markings, 391336081 edges, 212962 markings/sec, 360 secs
lola: 89131108 markings, 396264538 edges, 211061 markings/sec, 365 secs
lola: 90197541 markings, 401227334 edges, 213287 markings/sec, 370 secs
lola: 91247280 markings, 406108651 edges, 209948 markings/sec, 375 secs
lola: 92279039 markings, 410967520 edges, 206352 markings/sec, 380 secs
lola: 93328260 markings, 415899755 edges, 209844 markings/sec, 385 secs
lola: 94377362 markings, 420810989 edges, 209820 markings/sec, 390 secs
lola: 95406562 markings, 425696075 edges, 205840 markings/sec, 395 secs
lola: 96462710 markings, 430593277 edges, 211230 markings/sec, 400 secs
lola: 97488845 markings, 435445392 edges, 205227 markings/sec, 405 secs
lola: 98519472 markings, 440278230 edges, 206125 markings/sec, 410 secs
lola: 99545445 markings, 445099478 edges, 205195 markings/sec, 415 secs
lola: 100611961 markings, 450034250 edges, 213303 markings/sec, 420 secs
lola: 101646957 markings, 454895776 edges, 206999 markings/sec, 425 secs
lola: 102314502 markings, 458127905 edges, 133509 markings/sec, 430 secs
lola: 102317418 markings, 458141066 edges, 583 markings/sec, 435 secs
lola: 102317461 markings, 458141264 edges, 9 markings/sec, 440 secs
lola: 102321880 markings, 458159274 edges, 884 markings/sec, 445 secs
lola: 102322405 markings, 458161828 edges, 105 markings/sec, 450 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (((1 <= P4) U A (G ((P2 <= Pout2)))))
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((1 <= P4) U AG((P2 <= Pout2)))
lola: processed formula length: 32
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: 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: 2063305 markings, 8067557 edges, 412661 markings/sec, 0 secs
lola: 3792888 markings, 15400443 edges, 345917 markings/sec, 5 secs
lola: 5428314 markings, 22451769 edges, 327085 markings/sec, 10 secs
lola: 6971083 markings, 29312384 edges, 308554 markings/sec, 15 secs
lola: 8454829 markings, 36006448 edges, 296749 markings/sec, 20 secs
lola: 9877223 markings, 42586793 edges, 284479 markings/sec, 25 secs
lola: 11305964 markings, 49083144 edges, 285748 markings/sec, 30 secs
lola: 12689430 markings, 55499877 edges, 276693 markings/sec, 35 secs
lola: 14087436 markings, 61939662 edges, 279601 markings/sec, 40 secs
lola: 15422178 markings, 68252468 edges, 266948 markings/sec, 45 secs
lola: 16736758 markings, 74517285 edges, 262916 markings/sec, 50 secs
lola: 18036523 markings, 80696688 edges, 259953 markings/sec, 55 secs
lola: 19300512 markings, 86836458 edges, 252798 markings/sec, 60 secs
lola: 20571738 markings, 92973346 edges, 254245 markings/sec, 65 secs
lola: 21923997 markings, 99253468 edges, 270452 markings/sec, 70 secs
lola: 23179679 markings, 105311501 edges, 251136 markings/sec, 75 secs
lola: 24440880 markings, 111370629 edges, 252240 markings/sec, 80 secs
lola: 25606183 markings, 117108539 edges, 233061 markings/sec, 85 secs
lola: 26869378 markings, 123144834 edges, 252639 markings/sec, 90 secs
lola: 28063017 markings, 129065054 edges, 238728 markings/sec, 95 secs
lola: 29271332 markings, 134986682 edges, 241663 markings/sec, 100 secs
lola: 30487986 markings, 140996864 edges, 243331 markings/sec, 105 secs
lola: 31682678 markings, 146889681 edges, 238938 markings/sec, 110 secs
lola: 32854356 markings, 152711334 edges, 234336 markings/sec, 115 secs
lola: 33958786 markings, 158123469 edges, 220886 markings/sec, 120 secs
lola: 35045371 markings, 163508242 edges, 217317 markings/sec, 125 secs
lola: 36205330 markings, 169187070 edges, 231992 markings/sec, 130 secs
lola: 37351057 markings, 174938513 edges, 229145 markings/sec, 135 secs
lola: 38506757 markings, 180665807 edges, 231140 markings/sec, 140 secs
lola: 39641003 markings, 186346028 edges, 226849 markings/sec, 145 secs
lola: 40819832 markings, 192134502 edges, 235766 markings/sec, 150 secs
lola: 41975682 markings, 197849554 edges, 231170 markings/sec, 155 secs
lola: 43102541 markings, 203541302 edges, 225372 markings/sec, 160 secs
lola: 44227457 markings, 209228138 edges, 224983 markings/sec, 165 secs
lola: 45366106 markings, 214965515 edges, 227730 markings/sec, 170 secs
lola: 46516633 markings, 220711285 edges, 230105 markings/sec, 175 secs
lola: 47615403 markings, 226326372 edges, 219754 markings/sec, 180 secs
lola: 48733980 markings, 231915368 edges, 223715 markings/sec, 185 secs
lola: 49856150 markings, 237526668 edges, 224434 markings/sec, 190 secs
lola: 50997434 markings, 243165193 edges, 228257 markings/sec, 195 secs
lola: 52094975 markings, 248696075 edges, 219508 markings/sec, 200 secs
lola: 53198176 markings, 254283861 edges, 220640 markings/sec, 205 secs
lola: 54279014 markings, 259784483 edges, 216168 markings/sec, 210 secs
lola: 55382404 markings, 265355392 edges, 220678 markings/sec, 215 secs
lola: 56528405 markings, 270977458 edges, 229200 markings/sec, 220 secs
lola: 57601091 markings, 276450126 edges, 214537 markings/sec, 225 secs
lola: 58690539 markings, 281953446 edges, 217890 markings/sec, 230 secs
lola: 59783186 markings, 287490720 edges, 218529 markings/sec, 235 secs
lola: 60852411 markings, 292994363 edges, 213845 markings/sec, 240 secs
lola: 61942565 markings, 298561268 edges, 218031 markings/sec, 245 secs
lola: 63051064 markings, 304151626 edges, 221700 markings/sec, 250 secs
lola: 64152692 markings, 309733423 edges, 220326 markings/sec, 255 secs
lola: 65265570 markings, 315323458 edges, 222576 markings/sec, 260 secs
lola: 66336082 markings, 320841918 edges, 214102 markings/sec, 265 secs
lola: 67439390 markings, 326381675 edges, 220662 markings/sec, 270 secs
lola: 68523202 markings, 331899169 edges, 216762 markings/sec, 275 secs
lola: 69597107 markings, 337419458 edges, 214781 markings/sec, 280 secs
lola: 70703402 markings, 342967530 edges, 221259 markings/sec, 285 secs
lola: 71770306 markings, 348456766 edges, 213381 markings/sec, 290 secs
lola: 72866187 markings, 353982829 edges, 219176 markings/sec, 295 secs
lola: 73933425 markings, 359459119 edges, 213448 markings/sec, 300 secs
lola: 75026525 markings, 364977975 edges, 218620 markings/sec, 305 secs
lola: 76127229 markings, 370538612 edges, 220141 markings/sec, 310 secs
lola: 77181022 markings, 375947625 edges, 210759 markings/sec, 315 secs
lola: 78282499 markings, 381502377 edges, 220295 markings/sec, 320 secs
lola: 79324353 markings, 386903838 edges, 208371 markings/sec, 325 secs
lola: 80383929 markings, 392364869 edges, 211915 markings/sec, 330 secs
lola: 81439336 markings, 397808103 edges, 211081 markings/sec, 335 secs
lola: 82492394 markings, 403252134 edges, 210612 markings/sec, 340 secs
lola: 83529527 markings, 408677717 edges, 207427 markings/sec, 345 secs
lola: 84636260 markings, 414225697 edges, 221347 markings/sec, 350 secs
lola: 85664492 markings, 419585521 edges, 205646 markings/sec, 355 secs
lola: 86740062 markings, 425063274 edges, 215114 markings/sec, 360 secs
lola: 87774500 markings, 430428158 edges, 206888 markings/sec, 365 secs
lola: 88841477 markings, 435852487 edges, 213395 markings/sec, 370 secs
lola: 89868116 markings, 441199196 edges, 205328 markings/sec, 375 secs
lola: 90920939 markings, 446590048 edges, 210565 markings/sec, 380 secs
lola: 91962594 markings, 451958588 edges, 208331 markings/sec, 385 secs
lola: 93007561 markings, 457338932 edges, 208993 markings/sec, 390 secs
lola: 94039037 markings, 462701001 edges, 206295 markings/sec, 395 secs
lola: 95026077 markings, 467874998 edges, 197408 markings/sec, 400 secs
lola: 96041067 markings, 473114874 edges, 202998 markings/sec, 405 secs
lola: 97070799 markings, 478376012 edges, 205946 markings/sec, 410 secs
lola: 98065048 markings, 483584565 edges, 198850 markings/sec, 415 secs
lola: 99057547 markings, 488756632 edges, 198500 markings/sec, 420 secs
lola: 100060924 markings, 493953925 edges, 200675 markings/sec, 425 secs
lola: 101071423 markings, 499177828 edges, 202100 markings/sec, 430 secs
lola: 102090646 markings, 504424306 edges, 203845 markings/sec, 435 secs
lola: 103124529 markings, 509676864 edges, 206777 markings/sec, 440 secs
lola: 104135670 markings, 514916456 edges, 202228 markings/sec, 445 secs
lola: 105158511 markings, 520155964 edges, 204568 markings/sec, 450 secs
lola: 106134809 markings, 525321714 edges, 195260 markings/sec, 455 secs
lola: 107138733 markings, 530481012 edges, 200785 markings/sec, 460 secs
lola: 108132853 markings, 535674665 edges, 198824 markings/sec, 465 secs
lola: 109158704 markings, 540945864 edges, 205170 markings/sec, 470 secs
lola: 109960196 markings, 545157004 edges, 160298 markings/sec, 475 secs
lola: 110172974 markings, 546274153 edges, 42556 markings/sec, 480 secs
lola: 110175215 markings, 546285056 edges, 448 markings/sec, 485 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (((P4 <= Pback3) AND A (((P2 <= Pm1) U (Pback1 <= Pm2)))) OR A (G (((Pout2 <= P2) OR (2 <= Pback3) OR (P4 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (P4 <= Pback3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P4 <= Pback3)
lola: processed formula length: 14
lola: 27 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: ========================================
lola: ...considering subproblem: A (G (((Pout2 <= P2) OR (2 <= Pback3) OR (P4 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((Pout2 <= P2) OR (2 <= Pback3) OR (P4 <= 1))))
lola: processed formula length: 55
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: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: ((P2 + 1 <= Pout2) AND (Pback3 <= 1) AND (2 <= P4))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 104 markings, 103 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes no yes no yes yes yes no no unknown no unknown no yes
lola:
preliminary result: yes yes yes no yes no yes yes yes no no unknown no unknown no yes
lola: ========================================
lola: memory consumption: 21656 KB
lola: time consumption: 1853 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

BK_STOP 1552673710389

--------------------
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-00050"
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-00050, 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-155246583900031"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Kanban-PT-00050.tgz
mv Kanban-PT-00050 execution
cd execution
if [ "CTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "CTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;