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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 3.3K Feb 11 22:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 11 22:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 7 23:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 7 23:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 109 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 347 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.4K Feb 5 00:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 5 00:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.9K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Feb 4 06:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 4 06:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Jan 31 23:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Jan 31 23:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_pt
-rw-r--r-- 1 mcc users 2 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 40K 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 LamportFastMutEx-COL-4-CTLCardinality-00
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-01
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-02
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-03
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-04
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-05
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-06
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-07
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-08
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-09
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-10
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-11
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-12
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-13
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-14
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552759246368

info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ LamportFastMutEx-COL-4 @ 3570 seconds

FORMULA LamportFastMutEx-COL-4-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-CTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-CTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3531
rslt: Output for CTLCardinality @ LamportFastMutEx-COL-4

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sat Mar 16 18:00:46 2019
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 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": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "AX(EF(((3 <= p79 + p78 + p77 + p76 + p75) AND (p54 + p53 + p52 + p51 + p50 <= 1))))",
"processed_size": 83,
"rewrites": 24
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 804,
"markings": 620,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "E (((p74 + p73 + p72 + p71 + p70 + 1 <= p55 + p56 + p57 + p58 + p59) U (3 <= p79 + p78 + p77 + p76 + p75)))",
"processed_size": 107,
"rewrites": 25
},
"result":
{
"edges": 104936,
"markings": 34123,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 35
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 25,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 25,
"visible_transitions": 0
},
"processed": "(3 <= p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10)",
"processed_size": 149,
"rewrites": 24
},
"result":
{
"edges": 19,
"markings": 20,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "(3 <= p0 + p1 + p2 + p3 + p4)",
"processed_size": 29,
"rewrites": 25
},
"result":
{
"edges": 1294,
"markings": 823,
"produced_by": "state space /EXEF",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "EX(AG(((p0 + p1 + p2 + p3 + p4 <= p30 + p31 + p32 + p33 + p34) OR (p30 + p31 + p32 + p33 + p34 <= p35 + p36 + p37 + p38 + p39))))",
"processed_size": 130,
"rewrites": 24
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 16801,
"markings": 11623,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 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": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (G ((p54 + p53 + p52 + p51 + p50 <= 1)))",
"processed_size": 42,
"rewrites": 24
},
"result":
{
"edges": 1098,
"markings": 678,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p95 + p96 + p97 + p98 + p99) AND (2 <= p45 + p46 + p47 + p48 + p49))))",
"processed_size": 83,
"rewrites": 23
},
"result":
{
"edges": 18,
"markings": 19,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 25,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 25,
"visible_transitions": 0
},
"processed": "A (G (((p54 + p53 + p52 + p51 + p50 <= 2) OR (p0 + p1 + p2 + p3 + p4 <= 1) OR (p55 + p56 + p57 + p58 + p59 <= 0) OR (p35 + p36 + p37 + p38 + p39 + 1 <= p30 + p31 + p32 + p33 + p34))))",
"processed_size": 186,
"rewrites": 24
},
"result":
{
"produced_by": "state equation",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "((p30 + p31 + p32 + p33 + p34 <= p125 + p126 + p127 + p128 + p129) OR (p94 + p93 + p92 + p91 + p90 <= 1))",
"processed_size": 106,
"rewrites": 25
},
"result":
{
"edges": 9046048,
"markings": 1914784,
"produced_by": "tscc_search",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 507
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "((p35 + p36 + p37 + p38 + p39 + 1 <= p94 + p93 + p92 + p91 + p90) AND (p55 + p56 + p57 + p58 + p59 <= 1))",
"processed_size": 105,
"rewrites": 26
},
"result":
{
"edges": 4026107,
"markings": 1311509,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 589
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 70,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 45,
"visible_transitions": 0
},
"processed": "(((p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100 + 1 <= p125 + p126 + p127 + p128 + p129) OR (p30 + p31 + p32 + p33 + p34 <= 2)) AND (p94 + p93 + p92 + p91 + p90 <= p74 + p73 + p72 + p71 + p70) AND (p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100 <= 0))",
"processed_size": 506,
"rewrites": 25
},
"result":
{
"edges": 168,
"markings": 85,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 160
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 3
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 707
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 50,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 45,
"visible_transitions": 0
},
"processed": "E (G ((((p84 + p83 + p82 + p81 + p80 <= 2) AND (p74 + p73 + p72 + p71 + p70 <= 0)) OR ((p74 + p73 + p72 + p71 + p70 <= p79 + p78 + p77 + p76 + p75) AND (1 <= p30 + p31 + p32 + p33 + p34) AND (2 <= p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10)))))",
"processed_size": 345,
"rewrites": 23
},
"result":
{
"edges": 1472,
"markings": 528,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 200
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 12,
"problems": 6
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 884
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 75,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 70,
"visible_transitions": 0
},
"processed": "EF((((3 <= p79 + p78 + p77 + p76 + p75) AND (p35 + p36 + p37 + p38 + p39 <= p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10) AND (p125 + p126 + p127 + p128 + p129 + 1 <= p74 + p73 + p72 + p71 + p70)) AND AF((p79 + p78 + p77 + p76 + p75 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100))))",
"processed_size": 510,
"rewrites": 24
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 19975,
"markings": 13485,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1179
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "A (((p55 + p56 + p57 + p58 + p59 <= 1) R (p0 + p1 + p2 + p3 + p4 <= 1)))",
"processed_size": 72,
"rewrites": 27
},
"result":
{
"edges": 13856,
"markings": 5351,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_release",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1769
},
"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": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (G ((p79 + p78 + p77 + p76 + p75 <= 1)))",
"processed_size": 42,
"rewrites": 24
},
"result":
{
"edges": 925,
"markings": 556,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3539
},
"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": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (F ((3 <= p94 + p93 + p92 + p91 + p90)))",
"processed_size": 42,
"rewrites": 23
},
"result":
{
"edges": 2514950,
"markings": 844456,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3531
},
"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": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (F ((3 <= p95 + p96 + p97 + p98 + p99)))",
"processed_size": 42,
"rewrites": 23
},
"result":
{
"edges": 5946,
"markings": 3080,
"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": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"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": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (F ((3 <= p95 + p96 + p97 + p98 + p99)))",
"processed_size": 42,
"rewrites": 23
},
"result":
{
"edges": 5946,
"markings": 3080,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 16,
"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"
}
},

{
"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": 30,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "(p84 + p83 + p82 + p81 + p80 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100)",
"processed_size": 205,
"rewrites": 22
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 17,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 77972,
"runtime": 39.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A((* R *)) : E(G(**)) : (E(F(**)) AND **) : (E(F(*)) OR A(G(*))) : (E(X(E(F(**)))) OR E((** U **))) : E(F(A(G(**)))) : A(X(E(F(**)))) : A(G(**)) : A(G(**)) : TRUE : A(F(**)) : E(F((** AND A(F(**))))) : A(X(A(G(*)))) : A(G(E(F(**)))) : E(X(A(G(**))))"
},
"net":
{
"arcs": 990,
"conflict_clusters": 13,
"places": 135,
"places_significant": 98,
"singleton_clusters": 0,
"transitions": 230
},
"result":
{
"preliminary_value": "yes yes no yes no yes no yes yes no yes no yes no yes no ",
"value": "yes yes no yes no yes no yes yes no yes no yes no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains High-Level net
lola: Places: 135, Transitions: 230
lola: @ trans T-setbi_24
lola: @ trans T-fordo_12
lola: @ trans T-awaity
lola: @ trans T-yeqi_15
lola: @ trans T-setbi_11
lola: @ trans T-await_13
lola: @ trans T-ynei_15
lola: @ trans T-yne0_4
lola: @ trans T-setbi_5
lola: @ trans T-sety0_23
lola: @ trans T-xeqi_10
lola: @ trans T-sety_9
lola: @ trans T-xnei_10
lola: @ trans T-yeq0_4
lola: @ trans T-setbi_2
lola: @ trans T-forod_13
lola: @ trans T-setx_3
lola: finished unfolding
lola: finished parsing
lola: closed net file model.pnml
lola: 365/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 135
lola: finding significant places
lola: 135 places, 230 transitions, 98 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLCardinality.xml
lola: place invariant simplifies atomic proposition
lola: before: (p88 + p87 + p86 + p85 + p89 <= p95 + p96 + p97 + p98 + p99)
lola: after: (1 <= p95 + p96 + p97 + p98 + p99)
lola: place invariant simplifies atomic proposition
lola: before: (p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10 <= p40 + p41 + p42 + p43 + p44)
lola: after: (p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (p54 + p53 + p52 + p51 + p50 <= p40 + p41 + p42 + p43 + p44)
lola: after: (p54 + p53 + p52 + p51 + p50 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (p40 + p41 + p42 + p43 + p44 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100)
lola: after: (1 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100)
lola: place invariant simplifies atomic proposition
lola: before: (p94 + p93 + p92 + p91 + p90 <= p88 + p87 + p86 + p85 + p89)
lola: after: (p94 + p93 + p92 + p91 + p90 <= 1)
lola: A (F (E (F (((1 <= p95 + p96 + p97 + p98 + p99) AND (2 <= p45 + p46 + p47 + p48 + p49)))))) : NOT(E (((2 <= p55 + p56 + p57 + p58 + p59) U (2 <= p0 + p1 + p2 + p3 + p4)))) : E (G ((((p84 + p83 + p82 + p81 + p80 <= 2) AND (p74 + p73 + p72 + p71 + p70 <= 0)) OR ((p74 + p73 + p72 + p71 + p70 <= p79 + p78 + p77 + p76 + p75) AND (1 <= p30 + p31 + p32 + p33 + p34) AND (2 <= p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10))))) : (E (F (A (F ((3 <= p95 + p96 + p97 + p98 + p99))))) AND (p84 + p83 + p82 + p81 + p80 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100)) : NOT((A (G ((p94 + p93 + p92 + p91 + p90 <= 2))) AND E (F ((2 <= p79 + p78 + p77 + p76 + p75))))) : (E (X (E (F ((3 <= p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10))))) OR E (((p74 + p73 + p72 + p71 + p70 + 1 <= p55 + p56 + p57 + p58 + p59) U (3 <= p79 + p78 + p77 + p76 + p75)))) : E (F (A (G (((p94 + p93 + p92 + p91 + p90 <= p35 + p36 + p37 + p38 + p39) OR (2 <= p55 + p56 + p57 + p58 + p59)))))) : A (X (E (F (((3 <= p79 + p78 + p77 + p76 + p75) AND (p54 + p53 + p52 + p51 + p50 <= 1)))))) : A (G (((p54 + p53 + p52 + p51 + p50 <= 2) OR (p0 + p1 + p2 + p3 + p4 <= 1) OR (p55 + p56 + p57 + p58 + p59 <= 0) OR (p35 + p36 + p37 + p38 + p39 + 1 <= p30 + p31 + p32 + p33 + p34)))) : A (G ((p54 + p53 + p52 + p51 + p50 <= 1))) : (E (G ((3 <= p130 + p131 + p132 + p133 + p134))) OR A (G ((0 <= 0)))) : A (F ((((p125 + p126 + p127 + p128 + p129 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100) AND (3 <= p30 + p31 + p32 + p33 + p34)) OR (p74 + p73 + p72 + p71 + p70 + 1 <= p94 + p93 + p92 + p91 + p90) OR (1 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100)))) : E (F ((((3 <= p79 + p78 + p77 + p76 + p75) AND (p35 + p36 + p37 + p38 + p39 <= p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10) AND (p125 + p126 + p127 + p128 + p129 + 1 <= p74 + p73 + p72 + p71 + p70)) AND A (F ((p79 + p78 + p77 + p76 + p75 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100)))))) : NOT(E (X (E (F ((3 <= p0 + p1 + p2 + p3 + p4)))))) : A (G (E (F (((p30 + p31 + p32 + p33 + p34 <= p125 + p126 + p127 + p128 + p129) OR (p94 + p93 + p92 + p91 + p90 <= 1)))))) : E (X (A (G (((p0 + p1 + p2 + p3 + p4 <= p30 + p31 + p32 + p33 + p34) OR (p30 + p31 + p32 + p33 + p34 <= p35 + p36 + p37 + p38 + p39))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:449
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:455
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F (((3 <= p79 + p78 + p77 + p76 + p75) AND (p54 + p53 + p52 + p51 + p50 <= 1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF(((3 <= p79 + p78 + p77 + p76 + p75) AND (p54 + p53 + p52 + p51 + p50 <= 1))))
lola: processed formula length: 83
lola: 24 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: 620 markings, 804 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (E (F ((3 <= p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10))))) OR E (((p74 + p73 + p72 + p71 + p70 + 1 <= p55 + p56 + p57 + p58 + p59) U (3 <= p79 + p78 + p77 + p76 + p75))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p74 + p73 + p72 + p71 + p70 + 1 <= p55 + p56 + p57 + p58 + p59) U (3 <= p79 + p78 + p77 + p76 + p75)))
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 (((p74 + p73 + p72 + p71 + p70 + 1 <= p55 + p56 + p57 + p58 + p59) U (3 <= p79 + p78 + p77 + p76 + p75)))
lola: processed formula length: 107
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p79 + p78 + p77 + p76 + p75)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-2-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 34123 markings, 104936 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((3 <= p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: (3 <= p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10)
lola: processed formula length: 149
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10)
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 /EXEF
lola: The predicate is reachable from some successor.
lola: 20 markings, 19 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((p0 + p1 + p2 + p3 + p4 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:624
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (3 <= p0 + p1 + p2 + p3 + p4)
lola: processed formula length: 29
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p0 + p1 + p2 + p3 + p4)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 823 markings, 1294 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G (((p0 + p1 + p2 + p3 + p4 <= p30 + p31 + p32 + p33 + p34) OR (p30 + p31 + p32 + p33 + p34 <= p35 + p36 + p37 + p38 + p39))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AG(((p0 + p1 + p2 + p3 + p4 <= p30 + p31 + p32 + p33 + p34) OR (p30 + p31 + p32 + p33 + p34 <= p35 + p36 + p37 + p38 + p39))))
lola: processed formula length: 130
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 11623 markings, 16801 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p54 + p53 + p52 + p51 + p50 <= 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 ((p54 + p53 + p52 + p51 + p50 <= 1)))
lola: processed formula length: 42
lola: 24 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: (2 <= p54 + p53 + p52 + p51 + p50)
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: 678 markings, 1098 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p95 + p96 + p97 + p98 + p99) AND (2 <= p45 + p46 + p47 + p48 + p49))))
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 (((1 <= p95 + p96 + p97 + p98 + p99) AND (2 <= p45 + p46 + p47 + p48 + p49))))
lola: processed formula length: 83
lola: 23 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: ((1 <= p95 + p96 + p97 + p98 + p99) AND (2 <= p45 + p46 + p47 + p48 + p49))
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
lola: The predicate is reachable.
lola: 19 markings, 18 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p54 + p53 + p52 + p51 + p50 <= 2) OR (p0 + p1 + p2 + p3 + p4 <= 1) OR (p55 + p56 + p57 + p58 + p59 <= 0) OR (p35 + p36 + p37 + p38 + p39 + 1 <= p30 + p31 + p32 + p33 + p34))))
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 (((p54 + p53 + p52 + p51 + p50 <= 2) OR (p0 + p1 + p2 + p3 + p4 <= 1) OR (p55 + p56 + p57 + p58 + p59 <= 0) OR (p35 + p36 + p37 + p38 + p39 + 1 <= p30 + p31 + p32 + p33 + p34))))
lola: processed formula length: 186
lola: 24 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: ((3 <= p54 + p53 + p52 + p51 + p50) AND (2 <= p0 + p1 + p2 + p3 + p4) AND (1 <= p55 + p56 + p57 + p58 + p59) AND (p30 + p31 + p32 + p33 + p34 <= p35 + p36 + p37 + p38 + p39))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-7-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((p30 + p31 + p32 + p33 + p34 <= p125 + p126 + p127 + p128 + p129) OR (p94 + p93 + p92 + p91 + p90 <= 1))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: ((p30 + p31 + p32 + p33 + p34 <= p125 + p126 + p127 + p128 + p129) OR (p94 + p93 + p92 + p91 + p90 <= 1))
lola: processed formula length: 106
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p125 + p126 + p127 + p128 + p129 + 1 <= p30 + p31 + p32 + p33 + p34) AND (2 <= p94 + p93 + p92 + p91 + p90))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p30 + p31 + p32 + p33 + p34 <= p125 + p126 + p127 + p128 + p129) OR (p94 + p93 + p92 + p91 + p90 <= 1))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-8-0.sara
lola: state equation: write sara problem file to CTLCardinality-8-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-8-0.sara.
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-8-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 863458 markings, 3021178 edges, 172692 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 1477845 markings, 6317493 edges, 122877 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 1914784 markings, 9046048 edges
lola: ========================================
lola: subprocess 9 will run for 507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((p94 + p93 + p92 + p91 + p90 <= p35 + p36 + p37 + p38 + p39) OR (2 <= p55 + p56 + p57 + p58 + p59))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p35 + p36 + p37 + p38 + p39 + 1 <= p94 + p93 + p92 + p91 + p90) AND (p55 + p56 + p57 + p58 + p59 <= 1))
lola: processed formula length: 105
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p35 + p36 + p37 + p38 + p39 + 1 <= p94 + p93 + p92 + p91 + p90) AND (p55 + p56 + p57 + p58 + p59 <= 1))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p94 + p93 + p92 + p91 + p90 <= p35 + p36 + p37 + p38 + p39) OR (2 <= p55 + p56 + p57 + p58 + p59))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-9-1.sara
lola: state equation: write sara problem file to CTLCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-9-1.sara.
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-9-0.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic
lola: state equation 1: solution produced

lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 679985 markings, 1590960 edges, 135997 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 1235682 markings, 3439364 edges, 111139 markings/sec, 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 1311509 markings, 4026107 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((p125 + p126 + p127 + p128 + p129 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100) AND (3 <= p30 + p31 + p32 + p33 + p34)) OR (p74 + p73 + p72 + p71 + p70 + 1 <= p94 + p93 + p92 + p91 + p90) OR (1 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100 + 1 <= p125 + p126 + p127 + p128 + p129) OR (p30 + p31 + p32 + p33 + p34 <= 2)) AND (p94 + p93 + p92 + p91 + p90 <= p74 + p73 + p72 + p71 + p70) AND (p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p11... (shortened)
lola: processed formula length: 506
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p125 + p126 + p127 + p128 + p129 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100) AND (3 <= p30 + p31 + p32 + p33 + p34)) OR (p74 + p73 + p72 + p71 + p70 + 1 <= p94 + p93 + p92 + p91 + p90) OR (1 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 85 markings, 168 edges
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p84 + p83 + p82 + p81 + p80 <= 2) AND (p74 + p73 + p72 + p71 + p70 <= 0)) OR ((p74 + p73 + p72 + p71 + p70 <= p79 + p78 + p77 + p76 + p75) AND (1 <= p30 + p31 + p32 + p33 + p34) AND (2 <= p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p84 + p83 + p82 + p81 + p80 <= 2) AND (p74 + p73 + p72 + p71 + p70 <= 0)) OR ((p74 + p73 + p72 + p71 + p70 <= p79 + p78 + p77 + p76 + p75) AND (1 <= p30 + p31 + p32 + p33 + p34) AND (2 <= p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10)))))
lola: processed formula length: 345
lola: 23 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((3 <= p84 + p83 + p82 + p81 + p80) OR (1 <= p74 + p73 + p72 + p71 + p70)) AND ((p79 + p78 + p77 + p76 + p75 + 1 <= p74 + p73 + p72 + p71 + p70) OR (p30 + p31 + p32 + p33 + p34 <= 0) OR (p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10 <= 1)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 528 markings, 1472 edges
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((3 <= p79 + p78 + p77 + p76 + p75) AND (p35 + p36 + p37 + p38 + p39 <= p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10) AND (p125 + p126 + p127 + p128 + p129 + 1 <= p74 + p73 + p72 + p71 + p70)) AND A (F ((p79 + p78 + p77 + p76 + p75 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((((3 <= p79 + p78 + p77 + p76 + p75) AND (p35 + p36 + p37 + p38 + p39 <= p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10) AND (p125 + p126 + p127 + p128 + p129 + 1 <= p74 + p73 + p72 + p71 + p70)) AND AF((p79 + p78 + p77 + p76 + p75 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p11... (shortened)
lola: processed formula length: 510
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 13485 markings, 19975 edges
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p55 + p56 + p57 + p58 + p59 <= 1) R (p0 + p1 + p2 + p3 + p4 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:619
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (((p55 + p56 + p57 + p58 + p59 <= 1) R (p0 + p1 + p2 + p3 + p4 <= 1)))
lola: processed formula length: 72
lola: 27 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: 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: (2 <= p0 + p1 + p2 + p3 + p4)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-13-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: Predicate Phi releases Predicate Psi on all paths.
lola: 5351 markings, 13856 edges
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((3 <= p94 + p93 + p92 + p91 + p90))) OR A (G ((p79 + p78 + p77 + p76 + p75 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p79 + p78 + p77 + p76 + p75 <= 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:788
lola: processed formula: A (G ((p79 + p78 + p77 + p76 + p75 <= 1)))
lola: processed formula length: 42
lola: 24 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: (2 <= p79 + p78 + p77 + p76 + p75)
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: 556 markings, 925 edges
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p94 + p93 + p92 + p91 + p90)))
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 <= p94 + p93 + p92 + p91 + p90)))
lola: processed formula length: 42
lola: 23 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 <= p94 + p93 + p92 + p91 + p90)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-15-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 621472 markings, 1323858 edges, 124294 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 844456 markings, 2514950 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 3531 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((3 <= p95 + p96 + p97 + p98 + p99))) AND (p84 + p83 + p82 + p81 + p80 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3531 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p95 + p96 + p97 + p98 + p99)))
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 <= p95 + p96 + p97 + p98 + p99)))
lola: processed formula length: 42
lola: 23 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 <= p95 + p96 + p97 + p98 + p99)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-15-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3080 markings, 5946 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 (F ((3 <= p95 + p96 + p97 + p98 + p99))) AND (p84 + p83 + p82 + p81 + p80 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p95 + p96 + p97 + p98 + p99)))
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 <= p95 + p96 + p97 + p98 + p99)))
lola: processed formula length: 42
lola: 23 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 <= p95 + p96 + p97 + p98 + p99)
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-16-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-16-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3080 markings, 5946 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (p84 + p83 + p82 + p81 + p80 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p84 + p83 + p82 + p81 + p80 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100)
lola: processed formula length: 205
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no yes no yes no yes yes no yes no yes no yes no
lola:
preliminary result: yes yes no yes no yes no yes yes no yes no yes no yes no
lola: memory consumption: 77972 KB
lola: time consumption: 39 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

BK_STOP 1552759285792

--------------------
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="LamportFastMutEx-COL-4"
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 LamportFastMutEx-COL-4, 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-155246584000139"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-4.tgz
mv LamportFastMutEx-COL-4 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 ;