Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r135-tajo-158961408800051.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool win2019
Input is PhilosophersDyn-COL-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tajo-158961408800051
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.8K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_pt
-rw-r--r-- 1 mcc users 3 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 32K Apr 27 15:14 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 PhilosophersDyn-COL-10-00
FORMULA_NAME PhilosophersDyn-COL-10-01
FORMULA_NAME PhilosophersDyn-COL-10-02
FORMULA_NAME PhilosophersDyn-COL-10-03
FORMULA_NAME PhilosophersDyn-COL-10-04
FORMULA_NAME PhilosophersDyn-COL-10-05
FORMULA_NAME PhilosophersDyn-COL-10-06
FORMULA_NAME PhilosophersDyn-COL-10-07
FORMULA_NAME PhilosophersDyn-COL-10-08
FORMULA_NAME PhilosophersDyn-COL-10-09
FORMULA_NAME PhilosophersDyn-COL-10-10
FORMULA_NAME PhilosophersDyn-COL-10-11
FORMULA_NAME PhilosophersDyn-COL-10-12
FORMULA_NAME PhilosophersDyn-COL-10-13
FORMULA_NAME PhilosophersDyn-COL-10-14
FORMULA_NAME PhilosophersDyn-COL-10-15

=== Now, execution of the tool begins

BK_START 1590263488190

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ PhilosophersDyn-COL-10 @ 3570 seconds
check_solution: Constraint R91 = 0 is above its equality of -1
check_solution: Constraint R92 = 0 is above its equality of -1
check_solution: Constraint R93 = 0 is above its equality of -1
check_solution: Constraint R94 = 0 is above its equality of -1
check_solution: Constraint R95 = 0 is above its equality of -1
check_solution: Constraint R96 = 0 is above its equality of -1
check_solution: Constraint R97 = 0 is above its equality of -1
check_solution: Constraint R98 = 0 is above its equality of -1
check_solution: Constraint R99 = 0 is above its equality of -1
check_solution: Constraint R100 = 0 is above its equality of -1

Seriously low accuracy found ||*|| = 1 (rel. error 1)
check_solution: Constraint R91 = 0 is above its equality of -1
check_solution: Constraint R92 = 0 is above its equality of -1
check_solution: Constraint R93 = 0 is above its equality of -1
check_solution: Constraint R94 = 0 is above its equality of -1
check_solution: Constraint R95 = 0 is above its equality of -1
check_solution: Constraint R96 = 0 is above its equality of -1
check_solution: Constraint R97 = 0 is above its equality of -1
check_solution: Constraint R98 = 0 is above its equality of -1
check_solution: Constraint R99 = 0 is above its equality of -1
check_solution: Constraint R100 = 0 is above its equality of -1

Seriously low accuracy found ||*|| = 1 (rel. error 1)

FORMULA PhilosophersDyn-COL-10-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3542
rslt: Output for LTLCardinality @ PhilosophersDyn-COL-10

{
"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=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sat May 23 19:51:28 2020
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 236
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "A (F ((F ((2 <= p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166)) AND G ((3 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)))))",
"processed_size": 171,
"rewrites": 149
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 253
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "A (X (TRUE))",
"processed_size": 12,
"rewrites": 149
},
"result":
{
"edges": 90,
"markings": 91,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 272
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 50,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "A (F ((((p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166 + 1 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159) U X ((2 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39))) OR F ((p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 <= p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166)))))",
"processed_size": 375,
"rewrites": 149
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 295
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "((1 <= p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166))",
"processed_size": 76,
"rewrites": 149
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 322
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 1,
"aneg": 3,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 60,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 40,
"visible_transitions": 0
},
"processed": "A (X ((((p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + 1 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= 2)) OR (F ((p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)) OR X (G ((p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 <= 2)))))))",
"processed_size": 431,
"rewrites": 149
},
"result":
{
"edges": 90,
"markings": 91,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 354
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "A (G (F ((2 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149))))",
"processed_size": 86,
"rewrites": 149
},
"result":
{
"edges": 13,
"markings": 13,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 393
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "A (G (F ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))))",
"processed_size": 66,
"rewrites": 149
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 442
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 50,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "A (((2 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159) OR ((2 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159) OR (G ((p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)) AND F ((2 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159))))))",
"processed_size": 393,
"rewrites": 149
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 506
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"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": 20,
"visible_transitions": 0
},
"processed": "A (F (G ((p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + 1 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149))))",
"processed_size": 156,
"rewrites": 149
},
"result":
{
"edges": 14,
"markings": 13,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 590
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 40,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "A (((2 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149) OR F (((p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149) OR (2 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)))))",
"processed_size": 309,
"rewrites": 149
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 708
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 4,
"G": 4,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 120,
"taut": 0,
"tconj": 4,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "A (G (((p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166) OR (F ((p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166)) AND F (G ((F (((p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166 + 1 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10) AND G ((1 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)))) AND (F ((p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166)) OR ((p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166 + 1 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10) AND G ((1 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)))))))))))",
"processed_size": 882,
"rewrites": 149
},
"result":
{
"edges": 19719,
"markings": 6503,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 19
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 885
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 40,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "A ((F ((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= 1)) OR G (((2 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166)))))",
"processed_size": 273,
"rewrites": 149
},
"result":
{
"edges": 205,
"markings": 84,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1180
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 100,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 40,
"visible_transitions": 0
},
"processed": "A (G (F (((p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) OR G ((F (((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= 1) AND (p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39))) AND ((p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) OR ((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= 1) AND (p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39)))))))))",
"processed_size": 691,
"rewrites": 149
},
"result":
{
"edges": 14,
"markings": 14,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1771
},
"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": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "A (G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)))",
"processed_size": 128,
"rewrites": 151
},
"result":
{
"edges": 8,
"markings": 9,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3542
},
"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": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "A (G ((p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= 1)))",
"processed_size": 72,
"rewrites": 151
},
"result":
{
"edges": 5,
"markings": 6,
"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": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 210576,
"runtime": 28.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A((** OR (** OR (G(**) AND F(**))))) : A(G((** OR (F(**) AND F(G((F((** AND G(**))) AND (F(**) OR (** AND G(**)))))))))) : (A((* OR (* R *))) AND A(G(**))) : (** AND A(X(X(X(G(**)))))) : (A(F((F(**) AND G(**)))) AND A((F(**) OR X(G(**))))) : A(F(G(*))) : A((** OR F(**))) : A(X(TRUE)) : A(F(((** U X(**)) OR F(**)))) : TRUE : A(G(F((** OR G((F(**) AND (** OR **))))))) : A(G(F(**))) : A(G(F(**))) : (A(F((G(*) OR (* AND *)))) AND A(G(*))) : A(X((* OR (F(*) OR X(G(*)))))) : A((F(*) OR G(**)))"
},
"net":
{
"arcs": 18280,
"conflict_clusters": 1,
"places": 170,
"places_significant": 141,
"singleton_clusters": 0,
"transitions": 2310
},
"result":
{
"preliminary_value": "no no no no no no yes yes yes yes no no no no yes no ",
"value": "no no no no no no yes yes yes yes no no no 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: 170, Transitions: 2310
lola: @ trans Leave
lola: @ trans Initialize
lola: @ trans Join
lola: @ trans Eat
lola: @ trans TakeRight
lola: @ trans TakeLeft
lola: @ trans SearchForks
lola: finished unfolding
lola: finished parsing
lola: closed net file model.pnml
lola: 2480/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 5440
lola: finding significant places
lola: 170 places, 2310 transitions, 141 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 LTLCardinality.xml
lola: LP says that atomic proposition is always true: (p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p73 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p72 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p71 + p70 + p69 + p59 + p49 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)
lola: LP says that atomic proposition is always true: (p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p73 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p72 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p71 + p70 + p69 + p59 + p49 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)
lola: LP says that atomic proposition is always true: (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p73 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p72 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p71 + p70 + p69 + p59 + p49 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)
lola: A (((2 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159) OR (G ((p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)) U (2 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)))) : A (NOT(F (NOT((F (G ((F ((p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166)) U ((p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166 + 1 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10) AND G ((1 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)))))) U (p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166)))))) : A ((NOT(((1 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159) AND ((p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) U (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)))) AND G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)))) : A ((((1 <= p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166)) AND G (X (G (X (X (G ((3 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29))))))))) : A ((F ((F ((2 <= p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166)) AND G ((3 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)))) AND (F ((2 <= p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166)) OR X (G ((p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)))))) : A (F (NOT((X (G (F ((p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)))) OR X ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p73 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p72 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p71 + p70 + p69 + p59 + p49 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + 1 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10)))))) : A (((2 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149) OR F (((p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149) OR (2 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149))))) : A ((NOT(X (((2 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10) OR ((1 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159))))) U X (X (())))) : A (F ((((p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166 + 1 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159) U X ((2 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39))) OR F (((p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 <= p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166) U (p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 <= p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166)))))) : A (G ((0 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39))) : A (NOT(G (F (G (NOT(((p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) OR G (((p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) U ((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= 1) AND (p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39))))))))))) : A (NOT(X (X (X (((0 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) U F (X (G (NOT(X (X ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))))))))))))) : A (G (F (((p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p73 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p72 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p71 + p70 + p69 + p59 + p49 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) U (2 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149))))) : A (NOT((G (((p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159) U ((p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)))) OR F ((2 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10))))) : A (X (NOT(((((p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) OR (3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)) AND G ((p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + 1 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159))) AND X (F ((3 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39))))))) : A ((NOT(G ((2 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29))) OR G (((2 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:536
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 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: 149 rewrites
lola: closed formula file LTLCardinality.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 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((F ((2 <= p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166)) AND G ((3 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159))))) AND A ((F ((2 <= p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166)) OR X (G ((p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((2 <= p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166)) AND G ((3 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((F ((2 <= p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166)) AND G ((3 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)))))
lola: processed formula length: 171
lola: 149 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 149 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 91 markings, 90 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166 + 1 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159) U X ((2 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39))) OR F ((p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 <= p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((((p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166 + 1 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159) U X ((2 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39))) OR F ((p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 <= p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166)))))
lola: processed formula length: 375
lola: 149 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166)) AND A (X (X (X (G ((3 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166))
lola: processed formula length: 76
lola: 149 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + 1 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= 2)) OR (F ((p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)) OR X (G ((p30 + p31 + p32 + p33 + p34 + p35 + p3... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((((p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + 1 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= 2)) OR (F ((p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)) OR X (G ((p30 + p31 + p32 + p33 + p34 + p35 + p3... (shortened)
lola: processed formula length: 431
lola: 149 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 91 markings, 90 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((2 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((2 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149))))
lola: processed formula length: 86
lola: 149 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 13 markings, 13 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))))
lola: processed formula length: 66
lola: 149 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((2 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159) OR ((2 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159) OR (G ((p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)) AND F ((2 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((2 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159) OR ((2 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159) OR (G ((p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)) AND F ((2 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159))))))
lola: processed formula length: 393
lola: 149 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: ========================================
lola: subprocess 9 will run for 506 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + 1 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + 1 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149))))
lola: processed formula length: 156
lola: 149 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 13 markings, 14 edges
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((2 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149) OR F (((p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149) OR (2 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((2 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149) OR F (((p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149) OR (2 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)))))
lola: processed formula length: 309
lola: 149 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166) OR (F ((p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166)) AND F (G ((F (((p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166 + 1 <= p19 + p18 + p17 + p16 + p15 + p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (((p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166) OR (F ((p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166)) AND F (G ((F (((p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166 + 1 <= p19 + p18 + p17 + p16 + p15 + p1... (shortened)
lola: processed formula length: 882
lola: 149 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 19 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6503 markings, 19719 edges
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= 1)) OR G (((2 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= 1)) OR G (((2 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p160 + p161 + p162 + p163 + p164 + p165 + p169 + p168 + p167 + p166)))))
lola: processed formula length: 273
lola: 149 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 84 markings, 205 edges
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (((p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) OR G ((F (((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= 1) AND (p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39))) AND ((p140 + p141 + p142 + p143 + p144 + p145 + p146 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) OR G ((F (((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= 1) AND (p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39))) AND ((p140 + p141 + p142 + p143 + p144 + p145 + p146 + p... (shortened)
lola: processed formula length: 691
lola: 149 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 14 markings, 14 edges
lola: ========================================
lola: subprocess 14 will run for 1771 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 <= 0) OR ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + 1 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) R (p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))) AND A (G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p150 + p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1771 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)))
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 ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)))
lola: processed formula length: 128
lola: 151 rewrites
lola: closed formula file LTLCardinality.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: (p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)
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: 9 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 3542 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((G (((p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + 1 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39))) OR ((p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + 1 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10) AND ((p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + 1 <= p30 + p31 + p32 + p33 + p34 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3542 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= 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 ((p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= 1)))
lola: processed formula length: 72
lola: 151 rewrites
lola: closed formula file LTLCardinality.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 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + 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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no yes yes yes yes no no no no yes no
lola:
preliminary result: no no no no no no yes yes yes yes no no no no yes no
lola: memory consumption: 210576 KB
lola: time consumption: 28 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1590263516321

--------------------
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="PhilosophersDyn-COL-10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2019"
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-4028"
echo " Executing tool win2019"
echo " Input is PhilosophersDyn-COL-10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r135-tajo-158961408800051"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-COL-10.tgz
mv PhilosophersDyn-COL-10 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; 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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;