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-158961408800027.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 Philosophers-PT-000005, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tajo-158961408800027
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 5.2K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K 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 6.2K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.4K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.8K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 7 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 21K 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 Philosophers-PT-000005-00
FORMULA_NAME Philosophers-PT-000005-01
FORMULA_NAME Philosophers-PT-000005-02
FORMULA_NAME Philosophers-PT-000005-03
FORMULA_NAME Philosophers-PT-000005-04
FORMULA_NAME Philosophers-PT-000005-05
FORMULA_NAME Philosophers-PT-000005-06
FORMULA_NAME Philosophers-PT-000005-07
FORMULA_NAME Philosophers-PT-000005-08
FORMULA_NAME Philosophers-PT-000005-09
FORMULA_NAME Philosophers-PT-000005-10
FORMULA_NAME Philosophers-PT-000005-11
FORMULA_NAME Philosophers-PT-000005-12
FORMULA_NAME Philosophers-PT-000005-13
FORMULA_NAME Philosophers-PT-000005-14
FORMULA_NAME Philosophers-PT-000005-15

=== Now, execution of the tool begins

BK_START 1590263274690

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Philosophers-PT-000005 @ 3570 seconds

FORMULA Philosophers-PT-000005-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000005-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000005-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000005-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000005-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000005-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000005-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000005-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000005-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000005-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000005-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000005-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000005-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000005-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000005-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000005-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3565
rslt: Output for LTLCardinality @ Philosophers-PT-000005

{
"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",
"--safe",
"--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:47:54 2020
",
"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": 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": "(Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5)",
"processed_size": 95,
"rewrites": 106
},
"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": 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": 106
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 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": "FALSE",
"processed_size": 5,
"rewrites": 106
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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": 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": "FALSE",
"processed_size": 5,
"rewrites": 106
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "A (F (((((Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5) OR (Think_1 + Think_2 + Think_3 + Think_4 + Think_5 <= Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5)) OR X (TRUE)) AND X ((Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5 + 1 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5)))))",
"processed_size": 329,
"rewrites": 106
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"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": 324
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (((Think_1 + Think_2 + Think_3 + Think_4 + Think_5 <= 2) OR (G (((3 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5))) AND F ((Think_1 + Think_2 + Think_3 + Think_4 + Think_5 <= 2)))))",
"processed_size": 189,
"rewrites": 106
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 5,
"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": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A ((X (X (F ((Fork_1 + 1 <= Eat_1)))) U (Fork_1 + 1 <= Eat_1)))",
"processed_size": 63,
"rewrites": 106
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (F ((X ((1 <= Catch1_4)) OR ((1 <= Eat_1) U (Catch2_3 <= Fork_1))))))",
"processed_size": 74,
"rewrites": 106
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"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": 445
},
"child":
[

{
"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": 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 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5)",
"processed_size": 49,
"rewrites": 106
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "A (X ((F (G ((3 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5))) OR X (G ((2 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5))))))",
"processed_size": 148,
"rewrites": 106
},
"result":
{
"edges": 35,
"markings": 23,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (X ((((Think_4 + 1 <= Fork_1) AND (Eat_3 + 1 <= Catch1_2)) OR G ((Eat_1 + 1 <= Catch1_3)))))",
"processed_size": 94,
"rewrites": 106
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 9,
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (((Eat_3 <= Catch1_1) OR (F ((Eat_3 <= Catch1_1)) AND F (G (((Eat_1 <= 0) OR X ((Eat_1 <= 0))))))))",
"processed_size": 101,
"rewrites": 106
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 10,
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X (X (G ((Eat_5 + 1 <= Catch1_4)))))",
"processed_size": 39,
"rewrites": 106
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 11,
"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": 891
},
"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 ((Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 <= 2)))",
"processed_size": 67,
"rewrites": 108
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 12,
"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": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (((1 <= Catch2_3) OR (G ((Eat_2 <= Think_5)) AND F ((1 <= Catch2_3)))))",
"processed_size": 73,
"rewrites": 106
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"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": 10,
"visible_transitions": 0
},
"processed": "A (F (G (((Think_1 + Think_2 + Think_3 + Think_4 + Think_5 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5) OR (Think_1 + Think_2 + Think_3 + Think_4 + Think_5 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5)))))",
"processed_size": 229,
"rewrites": 106
},
"result":
{
"edges": 12,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"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": 3565
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 25,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "A ((G ((Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 <= 0)) OR G (F ((G ((Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5 + 1 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5)) R (Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + 1 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5))))))",
"processed_size": 298,
"rewrites": 106
},
"result":
{
"edges": 78,
"markings": 40,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 25388,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "** : A(G(**)) : A(F(G(**))) : (A(X(**)) AND A((** OR (G(**) AND F(**))))) : TRUE : (** AND A(X((F(G(**)) OR X(G(**)))))) : A(F(((** OR X(TRUE)) AND X(*)))) : A((G(**) OR G(F((G(*) R *))))) : A((** OR (G(**) AND F(**)))) : FALSE : A((X(X(F(**))) U **)) : A(G(F((X(**) OR (** U **))))) : FALSE : A(X((* OR G(*)))) : A((** OR (F(**) AND F(G((* OR X(*))))))) : A(X(X(G(*))))"
},
"net":
{
"arcs": 80,
"conflict_clusters": 6,
"places": 25,
"places_significant": 15,
"singleton_clusters": 0,
"transitions": 25
},
"result":
{
"preliminary_value": "yes no no no yes no yes no no no no no no no yes no ",
"value": "yes no no no yes no yes no no no 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 place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 50/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 25
lola: finding significant places
lola: 25 places, 25 transitions, 15 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: (Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5)
lola: LP says that atomic proposition is always false: (2 <= Fork_3)
lola: LP says that atomic proposition is always false: (2 <= Catch2_2)
lola: LP says that atomic proposition is always false: (2 <= Catch2_2)
lola: LP says that atomic proposition is always false: (2 <= Fork_3)
lola: LP says that atomic proposition is always false: (2 <= Think_4)
lola: LP says that atomic proposition is always false: (3 <= Eat_2)
lola: A (((Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5) OR G (NOT(G (((0 <= Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5) AND X (F (())))))))) : A (G ((G ((Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 <= 2)) AND NOT(F (G (NOT(F ((0 <= Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5))))))))) : A (F (G (((Think_1 + Think_2 + Think_3 + Think_4 + Think_5 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5) OR (Think_1 + Think_2 + Think_3 + Think_4 + Think_5 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5))))) : A ((X ((Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5)) AND (G (((3 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5))) U (Think_1 + Think_2 + Think_3 + Think_4 + Think_5 <= 2)))) : A (G ((((1 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5) OR G (X ((Think_1 + Think_2 + Think_3 + Think_4 + Think_5 <= Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5)))) OR (G ((0 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5)) U (0 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5))))) : A (((3 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5) AND X ((NOT(F (((Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5) U NOT(F (G ((3 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5))))))) OR G (X ((2 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5))))))) : A (F (((((Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5) OR (Think_1 + Think_2 + Think_3 + Think_4 + Think_5 <= Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5)) OR X ((0 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5))) AND NOT(X ((Think_1 + Think_2 + Think_3 + Think_4 + Think_5 <= Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5)))))) : A ((G ((Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 <= 0)) OR G (X (F (NOT((F ((Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 <= Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5)) U (Think_1 + Think_2 + Think_3 + Think_4 + Think_5 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5)))))))) : A ((G ((Eat_2 <= Think_5)) U (1 <= Catch2_3))) : A (((((Fork_2 + 1 <= Catch1_2)) AND G (NOT(((2 <= Catch2_2) U F ((2 <= Catch2_2)))))) U (2 <= Fork_3))) : A ((F (X ((() U F (X (((0 <= Eat_1) U (Fork_1 + 1 <= Eat_1))))))) U (Fork_1 + 1 <= Eat_1))) : A (G (F (((X ((1 <= Catch1_4)) OR ((1 <= Eat_1) U (Catch2_3 <= Fork_1))) OR ((1 <= Catch1_4) U (2 <= Think_4)))))) : A ((F ((F ((Catch2_2 <= Catch1_3)) U F ((1 <= Catch2_2)))) AND F ((3 <= Eat_2)))) : A (X (NOT((((Fork_1 <= Think_4) OR (Catch1_2 <= Eat_3)) AND F ((Catch1_3 <= Eat_1)))))) : A ((G (NOT(G (F (((1 <= Eat_1) AND X ((1 <= Eat_1))))))) U (Eat_3 <= Catch1_1))) : A (X (NOT((X ((Catch1_4 <= Eat_5)) U F (X (F ((Catch1_4 <= Eat_5))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:329
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5)
lola: processed formula length: 95
lola: 106 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 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: 106 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 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 106 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 106 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((((Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5) OR (Think_1 + Think_2 + Think_3 + Think_4 + Think_5 <= Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5)) OR X (TRUE)) AND X ((Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5 + 1 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((((Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5) OR (Think_1 + Think_2 + Think_3 + Think_4 + Think_5 <= Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5)) OR X (TRUE)) AND X ((Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5 + 1 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5)))))
lola: processed formula length: 329
lola: 106 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: 11 markings, 10 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5))) AND A (((Think_1 + Think_2 + Think_3 + Think_4 + Think_5 <= 2) OR (G (((3 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5))) AND F ((Think_1 + Think_2 + Think_3 + Think_4 + Think_5 <= 2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((Think_1 + Think_2 + Think_3 + Think_4 + Think_5 <= 2) OR (G (((3 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5))) AND F ((Think_1 + Think_2 + Think_3 + Think_4 + Think_5 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((Think_1 + Think_2 + Think_3 + Think_4 + Think_5 <= 2) OR (G (((3 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5))) AND F ((Think_1 + Think_2 + Think_3 + Think_4 + Think_5 <= 2)))))
lola: processed formula length: 189
lola: 106 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: 9 markings, 9 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (X (F ((Fork_1 + 1 <= Eat_1)))) U (Fork_1 + 1 <= Eat_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (X (F ((Fork_1 + 1 <= Eat_1)))) U (Fork_1 + 1 <= Eat_1)))
lola: processed formula length: 63
lola: 106 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: 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 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((X ((1 <= Catch1_4)) OR ((1 <= Eat_1) U (Catch2_3 <= Fork_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((X ((1 <= Catch1_4)) OR ((1 <= Eat_1) U (Catch2_3 <= Fork_1))))))
lola: processed formula length: 74
lola: 106 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: 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 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((3 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5) AND A (X ((F (G ((3 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5))) OR X (G ((2 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5)
lola: processed formula length: 49
lola: 106 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((F (G ((3 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5))) OR X (G ((2 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F (G ((3 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5))) OR X (G ((2 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5))))))
lola: processed formula length: 148
lola: 106 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: 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 23 markings, 35 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((Think_4 + 1 <= Fork_1) AND (Eat_3 + 1 <= Catch1_2)) OR G ((Eat_1 + 1 <= Catch1_3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((((Think_4 + 1 <= Fork_1) AND (Eat_3 + 1 <= Catch1_2)) OR G ((Eat_1 + 1 <= Catch1_3)))))
lola: processed formula length: 94
lola: 106 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: 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 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((Eat_3 <= Catch1_1) OR (F ((Eat_3 <= Catch1_1)) AND F (G (((Eat_1 <= 0) OR X ((Eat_1 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((Eat_3 <= Catch1_1) OR (F ((Eat_3 <= Catch1_1)) AND F (G (((Eat_1 <= 0) OR X ((Eat_1 <= 0))))))))
lola: processed formula length: 101
lola: 106 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((Eat_5 + 1 <= Catch1_4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((Eat_5 + 1 <= Catch1_4)))))
lola: processed formula length: 39
lola: 106 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: 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 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 <= 2)))
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 ((Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 <= 2)))
lola: processed formula length: 67
lola: 108 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: (3 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5)
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: 4 markings, 3 edges
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((1 <= Catch2_3) OR (G ((Eat_2 <= Think_5)) AND F ((1 <= Catch2_3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((1 <= Catch2_3) OR (G ((Eat_2 <= Think_5)) AND F ((1 <= Catch2_3)))))
lola: processed formula length: 73
lola: 106 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (((Think_1 + Think_2 + Think_3 + Think_4 + Think_5 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5) OR (Think_1 + Think_2 + Think_3 + Think_4 + Think_5 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (((Think_1 + Think_2 + Think_3 + Think_4 + Think_5 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5) OR (Think_1 + Think_2 + Think_3 + Think_4 + Think_5 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5)))))
lola: processed formula length: 229
lola: 106 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: 9 markings, 12 edges
lola: ========================================
lola: subprocess 15 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((G ((Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 <= 0)) OR G (F ((G ((Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5 + 1 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5)) R (Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + 1 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G ((Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 <= 0)) OR G (F ((G ((Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5 + 1 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5)) R (Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + 1 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5))))))
lola: processed formula length: 298
lola: 106 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 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: 40 markings, 78 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no yes no yes no no no no no no no yes no
lola:
preliminary result: yes no no no yes no yes no no no no no no no yes no
lola: memory consumption: 25388 KB
lola: time consumption: 5 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1590263279553

--------------------
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="Philosophers-PT-000005"
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 Philosophers-PT-000005, 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-158961408800027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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