Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r150-smll-158961529300101.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 Referendum-PT-0015, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-smll-158961529300101
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 340K
-rw-r--r-- 1 mcc users 9.1K Apr 12 08:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 40K Apr 12 08:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Apr 11 09:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 23K Apr 11 09:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 13K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 10 14:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 10 14:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 9 21:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Apr 9 21:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 18K Mar 24 05:38 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 Referendum-PT-0015-00
FORMULA_NAME Referendum-PT-0015-01
FORMULA_NAME Referendum-PT-0015-02
FORMULA_NAME Referendum-PT-0015-03
FORMULA_NAME Referendum-PT-0015-04
FORMULA_NAME Referendum-PT-0015-05
FORMULA_NAME Referendum-PT-0015-06
FORMULA_NAME Referendum-PT-0015-07
FORMULA_NAME Referendum-PT-0015-08
FORMULA_NAME Referendum-PT-0015-09
FORMULA_NAME Referendum-PT-0015-10
FORMULA_NAME Referendum-PT-0015-11
FORMULA_NAME Referendum-PT-0015-12
FORMULA_NAME Referendum-PT-0015-13
FORMULA_NAME Referendum-PT-0015-14
FORMULA_NAME Referendum-PT-0015-15

=== Now, execution of the tool begins

BK_START 1589963165452

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Referendum-PT-0015 @ 3570 seconds

FORMULA Referendum-PT-0015-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0015-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0015-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0015-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0015-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0015-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0015-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0015-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0015-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0015-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0015-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0015-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0015-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0015-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0015-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0015-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3188
rslt: Output for LTLCardinality @ Referendum-PT-0015

{
"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": "Wed May 20 08:26:05 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 60,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 45,
"visible_transitions": 0
},
"processed": "A (X (G (((voting_15 + voting_14 + voting_13 + voting_12 + voting_11 + voting_10 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9 + 1 <= voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9) OR X ((voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + 1 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_9 + voted_yes_8 + voted_yes_7 + voted_yes_6 + voted_yes_5 + voted_yes_4 + voted_yes_1 + voted_yes_2 + voted_yes_3))))))",
"processed_size": 819,
"rewrites": 96
},
"result":
{
"edges": 663270,
"markings": 106319,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 0,
"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": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "A (X (G ((voting_15 + voting_14 + voting_13 + voting_12 + voting_11 + voting_10 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9 <= voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9))))",
"processed_size": 384,
"rewrites": 96
},
"result":
{
"edges": 17,
"markings": 17,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"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": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "A (F (((2 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_9 + voted_yes_8 + voted_yes_7 + voted_yes_6 + voted_yes_5 + voted_yes_4 + voted_yes_1 + voted_yes_2 + voted_yes_3) OR X (X (F ((voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_9 + voted_yes_8 + voted_yes_7 + voted_yes_6 + voted_yes_5 + voted_yes_4 + voted_yes_1 + voted_yes_2 + voted_yes_3 <= 2)))))))",
"processed_size": 466,
"rewrites": 96
},
"result":
{
"edges": 31,
"markings": 32,
"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": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 75,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 45,
"visible_transitions": 0
},
"processed": "A (F (((voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_9 + voted_yes_8 + voted_yes_7 + voted_yes_6 + voted_yes_5 + voted_yes_4 + voted_yes_1 + voted_yes_2 + voted_yes_3) AND (X ((1 <= voting_15 + voting_14 + voting_13 + voting_12 + voting_11 + voting_10 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9)) AND F (G ((voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_9 + voted_yes_8 + voted_yes_7 + voted_yes_6 + voted_yes_5 + voted_yes_4 + voted_yes_1 + voted_yes_2 + voted_yes_3 + 1 <= voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9)))))))",
"processed_size": 1047,
"rewrites": 96
},
"result":
{
"edges": 19,
"markings": 18,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 75,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 45,
"visible_transitions": 0
},
"processed": "A (F (G ((X ((voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + 1 <= voting_15 + voting_14 + voting_13 + voting_12 + voting_11 + voting_10 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9)) AND (F ((voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_9 + voted_yes_8 + voted_yes_7 + voted_yes_6 + voted_yes_5 + voted_yes_4 + voted_yes_1 + voted_yes_2 + voted_yes_3 <= 1)) OR X (G ((voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + 1 <= voting_15 + voting_14 + voting_13 + voting_12 + voting_11 + voting_10 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9))))))))",
"processed_size": 1013,
"rewrites": 96
},
"result":
{
"edges": 21,
"markings": 20,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "(voting_15 + voting_14 + voting_13 + voting_12 + voting_11 + voting_10 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9 + 1 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_9 + voted_yes_8 + voted_yes_7 + voted_yes_6 + voted_yes_5 + voted_yes_4 + voted_yes_1 + voted_yes_2 + voted_yes_3)",
"processed_size": 391,
"rewrites": 98
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 31
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "A (X (F ((voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_9 + voted_yes_8 + voted_yes_7 + voted_yes_6 + voted_yes_5 + voted_yes_4 + voted_yes_1 + voted_yes_2 + voted_yes_3 <= voting_15 + voting_14 + voting_13 + voting_12 + voting_11 + voting_10 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9))))",
"processed_size": 399,
"rewrites": 96
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (F (G (((ready + 1 <= voted_no_13) AND (((1 <= ready) AND (voting_8 <= voted_no_9)) U X ((voting_8 <= voted_no_9)))))))",
"processed_size": 121,
"rewrites": 96
},
"result":
{
"edges": 19,
"markings": 18,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A ((F ((ready <= voted_yes_9)) U G (((voted_no_4 <= voting_5) OR (voting_10 + 1 <= ready)))))",
"processed_size": 94,
"rewrites": 96
},
"result":
{
"edges": 22,
"markings": 20,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 7,
"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": 7,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"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 (((voted_yes_6 + 1 <= ready) U X (G ((ready <= voted_yes_6)))))",
"processed_size": 65,
"rewrites": 96
},
"result":
{
"edges": 430565485,
"markings": 28697814,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 8,
"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": 455
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (X (G ((X (X (F ((voting_12 + 1 <= ready)))) AND (F ((voted_yes_2 + 1 <= ready)) OR G (F ((voting_12 + 1 <= ready))))))))",
"processed_size": 123,
"rewrites": 96
},
"result":
{
"edges": 17,
"markings": 17,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 531
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 531
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G (F ((voted_no_15 <= 0))))",
"processed_size": 30,
"rewrites": 96
},
"result":
{
"edges": 20,
"markings": 19,
"produced_by": "LTL model checker",
"value": false
},
"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"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 797
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (F ((ready + 1 <= voted_no_15))))",
"processed_size": 38,
"rewrites": 96
},
"result":
{
"edges": 17,
"markings": 17,
"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": 1062
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A ((F (((voted_yes_3 <= ready) OR (ready <= voting_5))) OR G (((voting_4 <= ready) OR (ready <= voting_5)))))",
"processed_size": 111,
"rewrites": 96
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 1594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 2,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 166,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 46,
"visible_transitions": 0
},
"processed": "A ((((2 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_9 + voted_yes_8 + voted_yes_7 + voted_yes_6 + voted_yes_5 + voted_yes_4 + voted_yes_1 + voted_yes_2 + voted_yes_3) AND (voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 <= voting_15 + voting_14 + voting_13 + voting_12 + voting_11 + voting_10 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9) AND (ready <= voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9)) OR (((voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 <= voting_15 + voting_14 + voting_13 + voting_12 + voting_11 + voting_10 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9) U ((2 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_9 + voted_yes_8 + voted_yes_7 + voted_yes_6 + voted_yes_5 + voted_yes_4 + voted_yes_1 + voted_yes_2 + voted_yes_3) AND (voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_9 + voted_yes_8 + voted_yes_7 + voted_yes_6 + voted_yes_5 + voted_yes_4 + voted_yes_1 + voted_yes_2 + voted_yes_3 <= voting_15 + voting_14 + voting_13 + voting_12 + voting_11 + voting_10 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9))) U (voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_9 + voted_yes_8 + voted_yes_7 + voted_yes_6 + voted_yes_5 + voted_yes_4 + voted_yes_1 + voted_yes_2 + voted_yes_3 <= voting_15 + voting_14 + voting_13 + voting_12 + voting_11 + voting_10 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9))))",
"processed_size": 2206,
"rewrites": 96
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 3188
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3188
},
"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": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "(voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 <= ready)",
"processed_size": 209,
"rewrites": 96
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "(voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 <= ready)",
"processed_size": 209,
"rewrites": 96
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 16,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "(voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + 1 <= voting_15 + voting_14 + voting_13 + voting_12 + voting_11 + voting_10 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9)",
"processed_size": 376,
"rewrites": 98
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 31
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 24924,
"runtime": 382.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(X(G((* OR X(*))))) : A(X(G(**))) : A(F((** OR X(X(F(*)))))) : A(F((** AND (X(**) AND F(G(*)))))) : A(F(G((X(*) AND (F(*) OR X(G(*))))))) : (A(F(**)) AND **) : (A(X(F(**))) AND A(F(**))) : A((** OR ((** U **) U **))) : A(G(F(**))) : A(F(G((** AND (** U X(**)))))) : (A((F(**) U G(**))) AND A(X(X(*)))) : A((** U X(G(**)))) : A((F(**) OR G(**))) : A(X(G((X(X(F(*))) AND (F(*) OR G(F(*))))))) : A(G(**)) : (A(G(F(**))) AND A(G((X(X(G(**))) OR **))))"
},
"net":
{
"arcs": 76,
"conflict_clusters": 46,
"places": 46,
"places_significant": 31,
"singleton_clusters": 0,
"transitions": 31
},
"result":
{
"preliminary_value": "no no yes no no yes yes yes no no no yes yes no no no ",
"value": "no no yes no no yes yes yes no no no yes yes no no 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: 77/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 46
lola: finding significant places
lola: 46 places, 31 transitions, 31 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 false: (2 <= voted_no_1)
lola: LP says that atomic proposition is always false: (2 <= voted_no_9)
lola: A (G (NOT(X (((voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 <= voting_15 + voting_14 + voting_13 + voting_12 + voting_11 + voting_10 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9) AND X ((voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_9 + voted_yes_8 + voted_yes_7 + voted_yes_6 + voted_yes_5 + voted_yes_4 + voted_yes_1 + voted_yes_2 + voted_yes_3 <= voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9))))))) : A (G (X ((voting_15 + voting_14 + voting_13 + voting_12 + voting_11 + voting_10 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9 <= voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9)))) : A (F (((2 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_9 + voted_yes_8 + voted_yes_7 + voted_yes_6 + voted_yes_5 + voted_yes_4 + voted_yes_1 + voted_yes_2 + voted_yes_3) OR X (X (F (NOT(G ((3 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_9 + voted_yes_8 + voted_yes_7 + voted_yes_6 + voted_yes_5 + voted_yes_4 + voted_yes_1 + voted_yes_2 + voted_yes_3))))))))) : A (F ((((voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_9 + voted_yes_8 + voted_yes_7 + voted_yes_6 + voted_yes_5 + voted_yes_4 + voted_yes_1 + voted_yes_2 + voted_yes_3) AND X ((1 <= voting_15 + voting_14 + voting_13 + voting_12 + voting_11 + voting_10 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9))) AND G (X (NOT(G (((0 <= ready) AND F ((voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_9 + voted_yes_8 + voted_yes_7 + voted_yes_6 + voted_yes_5 + voted_yes_4 + voted_yes_1 + voted_yes_2 + voted_yes_3)))))))))) : A (G (F (X (G (X (G (NOT((G ((2 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_9 + voted_yes_8 + voted_yes_7 + voted_yes_6 + voted_yes_5 + voted_yes_4 + voted_yes_1 + voted_yes_2 + voted_yes_3)) U X ((voting_15 + voting_14 + voting_13 + voting_12 + voting_11 + voting_10 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9 <= voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9))))))))))) : A ((F ((voting_15 + voting_14 + voting_13 + voting_12 + voting_11 + voting_10 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9 <= voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9)) AND (G (((voting_15 + voting_14 + voting_13 + voting_12 + voting_11 + voting_10 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9 + 1 <= 0) AND X ((voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 <= ready)))) U (voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 <= ready)))) : A ((X (((ready <= voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9) U F ((voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_9 + voted_yes_8 + voted_yes_7 + voted_yes_6 + voted_yes_5 + voted_yes_4 + voted_yes_1 + voted_yes_2 + voted_yes_3 <= voting_15 + voting_14 + voting_13 + voting_12 + voting_11 + voting_10 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9)))) AND F (((voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_9 + voted_yes_8 + voted_yes_7 + voted_yes_6 + voted_yes_5 + voted_yes_4 + voted_yes_1 + voted_yes_2 + voted_yes_3 <= voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9) U (F ((voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_9 + voted_yes_8 + voted_yes_7 + voted_yes_6 + voted_yes_5 + voted_yes_4 + voted_yes_1 + voted_yes_2 + voted_yes_3 <= voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9)) U ((ready <= voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9) U (voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_9 + voted_yes_8 + voted_yes_7 + voted_yes_6 + voted_yes_5 + voted_yes_4 + voted_yes_1 + voted_yes_2 + voted_yes_3 <= voting_15 + voting_14 + voting_13 + voting_12 + voting_11 + voting_10 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9))))))) : A ((((2 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_9 + voted_yes_8 + voted_yes_7 + voted_yes_6 + voted_yes_5 + voted_yes_4 + voted_yes_1 + voted_yes_2 + voted_yes_3) AND (voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 <= voting_15 + voting_14 + voting_13 + voting_12 + voting_11 + voting_10 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9) AND (ready <= voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9)) OR (((voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 <= voting_15 + voting_14 + voting_13 + voting_12 + voting_11 + voting_10 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9) U ((2 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_9 + voted_yes_8 + voted_yes_7 + voted_yes_6 + voted_yes_5 + voted_yes_4 + voted_yes_1 + voted_yes_2 + voted_yes_3) AND (voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_9 + voted_yes_8 + voted_yes_7 + voted_yes_6 + voted_yes_5 + voted_yes_4 + voted_yes_1 + voted_yes_2 + voted_yes_3 <= voting_15 + voting_14 + voting_13 + voting_12 + voting_11 + voting_10 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9))) U (voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_9 + voted_yes_8 + voted_yes_7 + voted_yes_6 + voted_yes_5 + voted_yes_4 + voted_yes_1 + voted_yes_2 + voted_yes_3 <= voting_15 + voting_14 + voting_13 + voting_12 + voting_11 + voting_10 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9)))) : A (NOT(X (F (G (X (NOT(((ready + 1 <= voted_no_15) OR ((voted_no_10 <= 0) AND G ((2 <= voted_no_1))))))))))) : A (X (X (F (G (X (((ready + 1 <= voted_no_13) AND (((1 <= ready) AND (voting_8 <= voted_no_9)) U X ((voting_8 <= voted_no_9)))))))))) : A (((F ((ready <= voted_yes_9)) U G (((voted_no_4 <= voting_5) OR (voting_10 + 1 <= ready)))) AND X (NOT(X ((ready <= voted_yes_9)))))) : A (((voted_yes_6 + 1 <= ready) U X (G ((ready <= voted_yes_6))))) : A ((F (((voted_yes_3 <= ready) OR (ready <= voting_5))) OR G (((voting_4 <= ready) OR (ready <= voting_5))))) : A (X (NOT((((ready <= voted_no_9) OR F ((ready <= voting_12))) U F ((G ((ready <= voted_yes_2)) U G (X (X ((ready <= voting_12)))))))))) : A (G ((ready + 1 <= voted_no_11))) : A (G ((NOT(X (X (NOT(G (((voted_yes_13 + 1 <= voting_14))))))) U (voted_no_15 <= 0))))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:116
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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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:374
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:335
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:431
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:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:297
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G (((voting_15 + voting_14 + voting_13 + voting_12 + voting_11 + voting_10 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9 + 1 <= voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9) OR X ((voted_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((voting_15 + voting_14 + voting_13 + voting_12 + voting_11 + voting_10 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9 + 1 <= voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9) OR X ((voted_... (shortened)
lola: processed formula length: 819
lola: 96 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: 106319 markings, 663270 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((voting_15 + voting_14 + voting_13 + voting_12 + voting_11 + voting_10 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9 <= voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((voting_15 + voting_14 + voting_13 + voting_12 + voting_11 + voting_10 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9 <= voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9))))
lola: processed formula length: 384
lola: 96 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: 17 markings, 17 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_9 + voted_yes_8 + voted_yes_7 + voted_yes_6 + voted_yes_5 + voted_yes_4 + voted_yes_1 + voted_yes_2 + voted_yes_3) OR X (X (F ((voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_9 + voted_yes_8 + voted_yes_7 + voted_yes_6 + voted_yes_5 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((2 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_9 + voted_yes_8 + voted_yes_7 + voted_yes_6 + voted_yes_5 + voted_yes_4 + voted_yes_1 + voted_yes_2 + voted_yes_3) OR X (X (F ((voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_9 + voted_yes_8 + voted_yes_7 + voted_yes_6 + voted_yes_5 +... (shortened)
lola: processed formula length: 466
lola: 96 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: 32 markings, 31 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_9 + voted_yes_8 + voted_yes_7 + voted_yes_6 + voted_yes_5 + voted_yes_4 + voted_yes_1 + vo... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_9 + voted_yes_8 + voted_yes_7 + voted_yes_6 + voted_yes_5 + voted_yes_4 + voted_yes_1 + vo... (shortened)
lola: processed formula length: 1047
lola: 96 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: 18 markings, 19 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((X ((voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + 1 <= voting_15 + voting_14 + voting_13 + voting_12 + voting_11 + voting_10 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9)) AND (F ((... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((X ((voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + 1 <= voting_15 + voting_14 + voting_13 + voting_12 + voting_11 + voting_10 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9)) AND (F ((... (shortened)
lola: processed formula length: 1013
lola: 96 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 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: 20 markings, 21 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (F ((voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_9 + voted_yes_8 + voted_yes_7 + voted_yes_6 + voted_yes_5 + voted_yes_4 + voted_yes_1 + voted_yes_2 + voted_yes_3 <= voting_15 + voting_14 + voting_13 + voting_12 + voting_11 + voting_10 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9))))... (shortened)
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 (F ((voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_9 + voted_yes_8 + voted_yes_7 + voted_yes_6 + voted_yes_5 + voted_yes_4 + voted_yes_1 + voted_yes_2 + voted_yes_3 <= voting_15 + voting_14 + voting_13 + voting_12 + voting_11 + voting_10 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (voting_15 + voting_14 + voting_13 + voting_12 + voting_11 + voting_10 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9 + 1 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_9 + voted_yes_8 + voted_yes_7 + voted_yes_6 + voted_yes_5 + voted_yes_4 + voted_yes_1 + voted_yes_2 + voted_yes_3)
lola: processed formula length: 391
lola: 98 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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_9 + voted_yes_8 + voted_yes_7 + voted_yes_6 + voted_yes_5 + voted_yes_4 + voted_yes_1 + voted_yes_2 + voted_yes_3 <= voting_15 + voting_14 + voting_13 + voting_12 + voting_11 + voting_10 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_9 + voted_yes_8 + voted_yes_7 + voted_yes_6 + voted_yes_5 + voted_yes_4 + voted_yes_1 + voted_yes_2 + voted_yes_3 <= voting_15 + voting_14 + voting_13 + voting_12 + voting_11 + voting_10 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9))))
lola: processed formula length: 399
lola: 96 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: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (((ready + 1 <= voted_no_13) AND (((1 <= ready) AND (voting_8 <= voted_no_9)) U X ((voting_8 <= voted_no_9)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (((ready + 1 <= voted_no_13) AND (((1 <= ready) AND (voting_8 <= voted_no_9)) U X ((voting_8 <= voted_no_9)))))))
lola: processed formula length: 121
lola: 96 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: 18 markings, 19 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((F ((ready <= voted_yes_9)) U G (((voted_no_4 <= voting_5) OR (voting_10 + 1 <= ready))))) AND A (X (X ((voted_yes_9 + 1 <= ready)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((ready <= voted_yes_9)) U G (((voted_no_4 <= voting_5) OR (voting_10 + 1 <= ready)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((ready <= voted_yes_9)) U G (((voted_no_4 <= voting_5) OR (voting_10 + 1 <= ready)))))
lola: processed formula length: 94
lola: 96 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: 20 markings, 22 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((voted_yes_6 + 1 <= ready) U X (G ((ready <= voted_yes_6)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((voted_yes_6 + 1 <= ready) U X (G ((ready <= voted_yes_6)))))
lola: processed formula length: 65
lola: 96 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: 837884 markings, 6728947 edges, 167577 markings/sec, 0 secs
lola: 1508974 markings, 12872607 edges, 134218 markings/sec, 5 secs
lola: 2201357 markings, 18952648 edges, 138477 markings/sec, 10 secs
lola: 2829026 markings, 24811368 edges, 125534 markings/sec, 15 secs
lola: 3436091 markings, 30591097 edges, 121413 markings/sec, 20 secs
lola: 4021178 markings, 36304659 edges, 117017 markings/sec, 25 secs
lola: 4544723 markings, 41818006 edges, 104709 markings/sec, 30 secs
lola: 4976000 markings, 47458626 edges, 86255 markings/sec, 35 secs
lola: 5342971 markings, 53544543 edges, 73394 markings/sec, 40 secs
lola: 5703893 markings, 59588316 edges, 72184 markings/sec, 45 secs
lola: 6040915 markings, 65548283 edges, 67404 markings/sec, 50 secs
lola: 6335721 markings, 71337419 edges, 58961 markings/sec, 55 secs
lola: 6688347 markings, 77339855 edges, 70525 markings/sec, 60 secs
lola: 7027972 markings, 83304486 edges, 67925 markings/sec, 65 secs
lola: 7334165 markings, 89111774 edges, 61239 markings/sec, 70 secs
lola: 7647611 markings, 94941644 edges, 62689 markings/sec, 75 secs
lola: 7962141 markings, 100760335 edges, 62906 markings/sec, 80 secs
lola: 8255316 markings, 106492416 edges, 58635 markings/sec, 85 secs
lola: 8552522 markings, 112253358 edges, 59441 markings/sec, 90 secs
lola: 8838633 markings, 117961637 edges, 57222 markings/sec, 95 secs
lola: 9112192 markings, 123645275 edges, 54712 markings/sec, 100 secs
lola: 9368225 markings, 129205511 edges, 51207 markings/sec, 105 secs
lola: 9677802 markings, 134815151 edges, 61915 markings/sec, 110 secs
lola: 10400359 markings, 141171738 edges, 144511 markings/sec, 115 secs
lola: 11044556 markings, 147187222 edges, 128839 markings/sec, 120 secs
lola: 11649719 markings, 153016028 edges, 121033 markings/sec, 125 secs
lola: 12213751 markings, 158728221 edges, 112806 markings/sec, 130 secs
lola: 12711570 markings, 164228395 edges, 99564 markings/sec, 135 secs
lola: 13088147 markings, 170270658 edges, 75315 markings/sec, 140 secs
lola: 13435950 markings, 176342493 edges, 69561 markings/sec, 145 secs
lola: 13744285 markings, 182284608 edges, 61667 markings/sec, 150 secs
lola: 14069633 markings, 188279185 edges, 65070 markings/sec, 155 secs
lola: 14388043 markings, 194219656 edges, 63682 markings/sec, 160 secs
lola: 14689269 markings, 200094501 edges, 60245 markings/sec, 165 secs
lola: 14986791 markings, 206010127 edges, 59504 markings/sec, 170 secs
lola: 15284265 markings, 211905670 edges, 59495 markings/sec, 175 secs
lola: 15563616 markings, 217732646 edges, 55870 markings/sec, 180 secs
lola: 15824961 markings, 223523508 edges, 52269 markings/sec, 185 secs
lola: 16272380 markings, 229299968 edges, 89484 markings/sec, 190 secs
lola: 16860955 markings, 234947203 edges, 117715 markings/sec, 195 secs
lola: 17412828 markings, 240481342 edges, 110375 markings/sec, 200 secs
lola: 17919819 markings, 245893087 edges, 101398 markings/sec, 205 secs
lola: 18289314 markings, 251475964 edges, 73899 markings/sec, 210 secs
lola: 18605970 markings, 257317009 edges, 63331 markings/sec, 215 secs
lola: 18900178 markings, 263072168 edges, 58842 markings/sec, 220 secs
lola: 19196649 markings, 268860513 edges, 59294 markings/sec, 225 secs
lola: 19485774 markings, 274614306 edges, 57825 markings/sec, 230 secs
lola: 19759508 markings, 280345571 edges, 54747 markings/sec, 235 secs
lola: 20019271 markings, 285996634 edges, 51953 markings/sec, 240 secs
lola: 20344354 markings, 291578853 edges, 65017 markings/sec, 245 secs
lola: 20917802 markings, 297237985 edges, 114690 markings/sec, 250 secs
lola: 21424531 markings, 302646395 edges, 101346 markings/sec, 255 secs
lola: 21794782 markings, 308152219 edges, 74050 markings/sec, 260 secs
lola: 22078051 markings, 313861970 edges, 56654 markings/sec, 265 secs
lola: 22370007 markings, 319626116 edges, 58391 markings/sec, 270 secs
lola: 22644479 markings, 325349180 edges, 54894 markings/sec, 275 secs
lola: 22898835 markings, 330960102 edges, 50871 markings/sec, 280 secs
lola: 23269999 markings, 336502828 edges, 74233 markings/sec, 285 secs
lola: 23779989 markings, 341932797 edges, 101998 markings/sec, 290 secs
lola: 24140041 markings, 347381248 edges, 72010 markings/sec, 295 secs
lola: 24420149 markings, 353137696 edges, 56022 markings/sec, 300 secs
lola: 24682720 markings, 358797614 edges, 52514 markings/sec, 305 secs
lola: 24914674 markings, 364298353 edges, 46391 markings/sec, 310 secs
lola: 25420228 markings, 369766587 edges, 101111 markings/sec, 315 secs
lola: 25741244 markings, 375264807 edges, 64203 markings/sec, 320 secs
lola: 26000202 markings, 380902711 edges, 51792 markings/sec, 325 secs
lola: 26298379 markings, 386458930 edges, 59635 markings/sec, 330 secs
lola: 26688638 markings, 391804067 edges, 78052 markings/sec, 335 secs
lola: 26937245 markings, 397429877 edges, 49721 markings/sec, 340 secs
lola: 27299977 markings, 402788516 edges, 72546 markings/sec, 345 secs
lola: 27544988 markings, 408395138 edges, 49002 markings/sec, 350 secs
lola: 27858870 markings, 413657509 edges, 62776 markings/sec, 355 secs
lola: 28135645 markings, 418932898 edges, 55355 markings/sec, 360 secs
lola: 28396766 markings, 424147131 edges, 52224 markings/sec, 365 secs
lola: 28632566 markings, 429093265 edges, 47160 markings/sec, 370 secs
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: 28697814 markings, 430565485 edges
lola: ========================================
lola: subprocess 9 will run for 455 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((X (X (F ((voting_12 + 1 <= ready)))) AND (F ((voted_yes_2 + 1 <= ready)) OR G (F ((voting_12 + 1 <= ready))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((X (X (F ((voting_12 + 1 <= ready)))) AND (F ((voted_yes_2 + 1 <= ready)) OR G (F ((voting_12 + 1 <= ready))))))))
lola: processed formula length: 123
lola: 96 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 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: 17 markings, 17 edges
lola: ========================================
lola: subprocess 10 will run for 531 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F ((voted_no_15 <= 0)))) AND A (G ((X (X (G (((voted_yes_13 + 1 <= voting_14))))) OR (voted_no_15 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 531 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((voted_no_15 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((voted_no_15 <= 0))))
lola: processed formula length: 30
lola: 96 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: 19 markings, 20 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 11 will run for 637 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((ready + 1 <= voted_no_11)))
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 ((ready + 1 <= voted_no_11)))
lola: processed formula length: 34
lola: 98 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 797 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((ready + 1 <= voted_no_15))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((ready + 1 <= voted_no_15))))
lola: processed formula length: 38
lola: 96 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: 17 markings, 17 edges
lola: subprocess 13 will run for 1062 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A ((F (((voted_yes_3 <= ready) OR (ready <= voting_5))) OR G (((voting_4 <= ready) OR (ready <= voting_5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (((voted_yes_3 <= ready) OR (ready <= voting_5))) OR G (((voting_4 <= ready) OR (ready <= voting_5)))))
lola: processed formula length: 111
lola: 96 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 14 will run for 1594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_9 + voted_yes_8 + voted_yes_7 + voted_yes_6 + voted_yes_5 + voted_yes_4 + voted_yes_1 + voted_yes_2 + voted_yes_3) AND (voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_n... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((2 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_9 + voted_yes_8 + voted_yes_7 + voted_yes_6 + voted_yes_5 + voted_yes_4 + voted_yes_1 + voted_yes_2 + voted_yes_3) AND (voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_n... (shortened)
lola: processed formula length: 2206
lola: 96 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: 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 15 will run for 3188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((voting_15 + voting_14 + voting_13 + voting_12 + voting_11 + voting_10 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9 <= voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9))) AND (voted_no_10 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 <= ready)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 <= ready)
lola: processed formula length: 209
lola: 96 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (F ((voting_15 + voting_14 + voting_13 + voting_12 + voting_11 + voting_10 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9 <= voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9))) AND (voted_no_10 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 <= ready)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 <= ready)
lola: processed formula length: 209
lola: 96 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: ========================================
lola: ...considering subproblem: A (F ((voting_15 + voting_14 + voting_13 + voting_12 + voting_11 + voting_10 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9 <= voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + 1 <= voting_15 + voting_14 + voting_13 + voting_12 + voting_11 + voting_10 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9)
lola: processed formula length: 376
lola: 98 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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no yes yes yes no no no yes yes no no no
lola:
preliminary result: no no yes no no yes yes yes no no no yes yes no no no
lola: ========================================
lola: memory consumption: 24924 KB
lola: time consumption: 382 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1589963547258

--------------------
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="Referendum-PT-0015"
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 Referendum-PT-0015, 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 r150-smll-158961529300101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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