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.r075-tajo-158922839500033.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 DNAwalker-PT-07track28RR, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tajo-158922839500033
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 292K
-rw-r--r-- 1 mcc users 3.2K Mar 31 04:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 31 04:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 29 20:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 29 20:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 13:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 28 13:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 06:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 27 06:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 12 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 108K Mar 24 05:37 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 DNAwalker-PT-07track28RR-00
FORMULA_NAME DNAwalker-PT-07track28RR-01
FORMULA_NAME DNAwalker-PT-07track28RR-02
FORMULA_NAME DNAwalker-PT-07track28RR-03
FORMULA_NAME DNAwalker-PT-07track28RR-04
FORMULA_NAME DNAwalker-PT-07track28RR-05
FORMULA_NAME DNAwalker-PT-07track28RR-06
FORMULA_NAME DNAwalker-PT-07track28RR-07
FORMULA_NAME DNAwalker-PT-07track28RR-08
FORMULA_NAME DNAwalker-PT-07track28RR-09
FORMULA_NAME DNAwalker-PT-07track28RR-10
FORMULA_NAME DNAwalker-PT-07track28RR-11
FORMULA_NAME DNAwalker-PT-07track28RR-12
FORMULA_NAME DNAwalker-PT-07track28RR-13
FORMULA_NAME DNAwalker-PT-07track28RR-14
FORMULA_NAME DNAwalker-PT-07track28RR-15

=== Now, execution of the tool begins

BK_START 1589537339760

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ DNAwalker-PT-07track28RR @ 3570 seconds

FORMULA DNAwalker-PT-07track28RR-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-07track28RR-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-07track28RR-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-07track28RR-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-07track28RR-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-07track28RR-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-07track28RR-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-07track28RR-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-07track28RR-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-07track28RR-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-07track28RR-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-07track28RR-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-07track28RR-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-07track28RR-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-07track28RR-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-07track28RR-09 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2045
rslt: Output for LTLCardinality @ DNAwalker-PT-07track28RR

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2019",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri May 15 10:08:59 2020
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 203
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": 4,
"visible_transitions": 0
},
"processed": "A (G ((G (F ((A6 <= A18))) OR G (((A3 <= B23) AND F ((A6 <= A18)))))))",
"processed_size": 70,
"rewrites": 146
},
"result":
{
"edges": 233,
"markings": 151,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 218
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X (X (G ((X (F ((B16 <= A9))) AND F ((A9 + 1 <= B16)))))))",
"processed_size": 61,
"rewrites": 146
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 234
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 234
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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 ((A9 <= A10)))",
"processed_size": 19,
"rewrites": 146
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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 (G ((A9 + 1 <= B6))))",
"processed_size": 26,
"rewrites": 146
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"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": 277
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (X ((F ((3 <= A3)) OR X (X (G ((3 <= A3)))))))",
"processed_size": 48,
"rewrites": 146
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 305
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 2,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (X ((F ((A26 <= A10)) U G (((A26 <= A10) OR G (((A4 <= A9) AND F ((2 <= A19)))))))))",
"processed_size": 86,
"rewrites": 146
},
"result":
{
"edges": 1619787,
"markings": 396200,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 13
},
"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": 339
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 339
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (((A3 + 1 <= A8) R (A8 + 1 <= A15)))",
"processed_size": 38,
"rewrites": 150
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 27
},
"threads": 1,
"type": "dfs"
},
"type": "universal_release"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 381
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 3,
"aconj": 1,
"adisj": 0,
"aneg": 3,
"comp": 5,
"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": 6,
"visible_transitions": 0
},
"processed": "A ((((2 <= A20) OR X (X (F (((A6 + 1 <= A15) OR (A21 <= 0)))))) U (X ((A11 + 1 <= A25)) R (A11 + 1 <= A25))))",
"processed_size": 110,
"rewrites": 146
},
"result":
{
"edges": 20,
"markings": 20,
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (((A3 <= A25) OR (F ((3 <= B6)) AND X (G ((A25 + 1 <= A3))))))",
"processed_size": 64,
"rewrites": 146
},
"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": 534
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"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 (X (G (((1 <= A13)))))",
"processed_size": 24,
"rewrites": 146
},
"result":
{
"edges": 40,
"markings": 32,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 667
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(A17 + 1 <= A7)",
"processed_size": 15,
"rewrites": 148
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 28
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 890
},
"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 (F (G ((A26 <= B23))))",
"processed_size": 24,
"rewrites": 146
},
"result":
{
"edges": 14,
"markings": 13,
"produced_by": "LTL model checker",
"value": false
},
"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": 1335
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (F (G (((A2 <= A13) AND (B5 <= B23)))))",
"processed_size": 41,
"rewrites": 146
},
"result":
{
"edges": 54,
"markings": 40,
"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": 2671
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2671
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(A27 <= 0)",
"processed_size": 10,
"rewrites": 146
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 33608,
"runtime": 1525.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(X((F(**) U G((** OR G((** AND F(**)))))))) : (A(X(G(**))) AND A(G((G(F(**)) OR G((** AND F(**))))))) : A(X(X(G((X(F(**)) AND F(*)))))) : (A(X(*)) AND A((F((* AND F(*))) OR X(G(*))))) : A(X(G(*))) : A(F(*)) : A(X((F(**) OR X(X(G(**)))))) : TRUE : (A((* R *)) AND A(X(**))) : A(X(X((F(**) OR (G(*) OR (* AND (F(*) OR G(*)))))))) : A(((** OR X(X(F(*)))) U (X(*) R *))) : A(F(G(**))) : A((** OR (F(**) AND X(G(*))))) : (* AND A(F((G((* AND F(*))) OR (G(*) AND (* AND F(*))))))) : A(X(G(**))) : A(F(G(**)))"
},
"net":
{
"arcs": 728,
"conflict_clusters": 7,
"places": 34,
"places_significant": 34,
"singleton_clusters": 0,
"transitions": 250
},
"result":
{
"preliminary_value": "no no no no no yes no yes no unknown no no yes no no no ",
"value": "no no no no no yes no yes no unknown no no 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: 284/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1088
lola: finding significant places
lola: 34 places, 250 transitions, 34 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: atomic prop true by contained trap!
lola: atomic prop true by contained trap!
lola: A (X ((F ((A26 <= A10)) U G (((A26 <= A10) OR (G ((A4 <= A9)) AND G (F ((2 <= A19))))))))) : A (G ((X ((3 <= A13)) AND G ((G ((A3 <= B23)) U X (X (G (X (F ((A6 <= A18))))))))))) : A (G (X ((((2 <= A14) U (A16 + 1 <= 0)) U X ((F (X ((B16 <= A9))) AND NOT(G ((B16 <= A9))))))))) : A (NOT((G (((A21 + 1 <= A2) OR G ((2 <= A13)))) U X ((A10 + 1 <= A9))))) : A (G ((((0 <= B16) AND NOT(F (X ((B6 <= A9))))) AND (X ((A5 <= A19)) U G ((0 <= B16)))))) : A ((NOT(G (((A17 + 1 <= A7) U NOT(X ((A7 <= A17)))))) U NOT(G ((A17 + 1 <= A7))))) : A (X ((F ((F ((3 <= A3)) U (3 <= A3))) OR NOT(X (NOT(G (X ((3 <= A3))))))))) : A (F (((G ((3 <= A21)) OR F ((0 <= A26))) OR NOT(((2 <= A10) U (1 <= A12)))))) : A ((NOT(((A8 <= A3) U (A15 <= A8))) AND X ((A8 <= A3)))) : A (X (X ((F ((3 <= A20)) OR NOT((F ((3 <= A25)) AND (G ((2 <= A25)) U (A20 <= 2)))))))) : A ((((2 <= A20) OR X (F (NOT(X (((A15 <= A6) AND (1 <= A21))))))) U NOT((X ((A25 <= A11)) U (A25 <= A11))))) : A (G (X (F (X (((G (F ((A20 <= A11))) U X (G ((A20 <= A11)))) U X (G ((A26 <= B23))))))))) : A (((A3 <= A25) OR (F ((3 <= B6)) AND NOT(X (((B6 <= A1) U F ((A3 <= A25)))))))) : A (NOT(((1 <= A27) OR G ((F ((2 <= B16)) U ((A25 + 1 <= A24) OR G ((2 <= B16)))))))) : A ((X (G (X (()))) AND G (X (((1 <= A13)))))) : A (X (F (G (((A2 <= A13) AND (B5 <= B23))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:185
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: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:318
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:116
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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: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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k: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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:374
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: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 190 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: 146 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 203 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (G ((3 <= A13)))) AND A (G ((G (F ((A6 <= A18))) OR G (((A3 <= B23) AND F ((A6 <= A18))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 203 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((G (F ((A6 <= A18))) OR G (((A3 <= B23) AND F ((A6 <= A18)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((G (F ((A6 <= A18))) OR G (((A3 <= B23) AND F ((A6 <= A18)))))))
lola: processed formula length: 70
lola: 146 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: 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: 151 markings, 233 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 218 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((X (F ((B16 <= A9))) AND F ((A9 + 1 <= B16)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((X (F ((B16 <= A9))) AND F ((A9 + 1 <= B16)))))))
lola: processed formula length: 61
lola: 146 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: 11 markings, 11 edges
lola: ========================================
lola: subprocess 3 will run for 234 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((A9 <= A10))) AND A ((F (((A2 <= A21) AND F ((A13 <= 1)))) OR X (G ((A9 <= A10))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 234 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((A9 <= A10)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((A9 <= A10)))
lola: processed formula length: 19
lola: 146 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: 10 markings, 10 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((A9 + 1 <= B6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((A9 + 1 <= B6))))
lola: processed formula length: 26
lola: 146 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 5 will run for 277 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((3 <= A3)) OR X (X (G ((3 <= A3)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((3 <= A3)) OR X (X (G ((3 <= A3)))))))
lola: processed formula length: 48
lola: 146 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 6 will run for 305 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((A26 <= A10)) U G (((A26 <= A10) OR G (((A4 <= A9) AND F ((2 <= A19)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((A26 <= A10)) U G (((A26 <= A10) OR G (((A4 <= A9) AND F ((2 <= A19)))))))))
lola: processed formula length: 86
lola: 146 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 13 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: 396200 markings, 1619787 edges
lola: ========================================
lola: subprocess 7 will run for 339 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((A3 + 1 <= A8) R (A8 + 1 <= A15))) AND A (X ((A8 <= A3))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 339 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((A3 + 1 <= A8) R (A8 + 1 <= A15)))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (((A3 + 1 <= A8) R (A8 + 1 <= A15)))
lola: processed formula length: 38
lola: 150 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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: Predicate Phi does not release Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 381 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X ((F ((3 <= A20)) OR (G ((A25 <= 2)) OR ((3 <= A20) AND (F ((A25 <= 1)) OR G ((3 <= A20)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((F ((3 <= A20)) OR (G ((A25 <= 2)) OR ((3 <= A20) AND (F ((A25 <= 1)) OR G ((3 <= A20)))))))))
lola: processed formula length: 103
lola: 146 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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1923770 markings, 6017379 edges, 384754 markings/sec, 0 secs
lola: 3381615 markings, 12435721 edges, 291569 markings/sec, 5 secs
lola: 5109947 markings, 18801251 edges, 345666 markings/sec, 10 secs
lola: 6366814 markings, 24408332 edges, 251373 markings/sec, 15 secs
lola: 7733302 markings, 30179842 edges, 273298 markings/sec, 20 secs
lola: 8826709 markings, 35905049 edges, 218681 markings/sec, 25 secs
lola: 9909812 markings, 42018039 edges, 216621 markings/sec, 30 secs
lola: 10754072 markings, 47875693 edges, 168852 markings/sec, 35 secs
lola: 12440254 markings, 53934158 edges, 337236 markings/sec, 40 secs
lola: 13734466 markings, 59711578 edges, 258842 markings/sec, 45 secs
lola: 15206734 markings, 65572797 edges, 294454 markings/sec, 50 secs
lola: 16301008 markings, 71458874 edges, 218855 markings/sec, 55 secs
lola: 17408559 markings, 77393993 edges, 221510 markings/sec, 60 secs
lola: 18264061 markings, 83066487 edges, 171100 markings/sec, 65 secs
lola: 19518523 markings, 88645004 edges, 250892 markings/sec, 70 secs
lola: 20886851 markings, 94663507 edges, 273666 markings/sec, 75 secs
lola: 21908315 markings, 100237124 edges, 204293 markings/sec, 80 secs
lola: 22953654 markings, 105890190 edges, 209068 markings/sec, 85 secs
lola: 23735135 markings, 111306349 edges, 156296 markings/sec, 90 secs
lola: 25109645 markings, 117275260 edges, 274902 markings/sec, 95 secs
lola: 26373336 markings, 123291238 edges, 252738 markings/sec, 100 secs
lola: 27392780 markings, 129008206 edges, 203889 markings/sec, 105 secs
lola: 28472748 markings, 135040549 edges, 215994 markings/sec, 110 secs
lola: 29346875 markings, 140875258 edges, 174825 markings/sec, 115 secs
lola: 30089855 markings, 146420586 edges, 148596 markings/sec, 120 secs
lola: 31055688 markings, 152160340 edges, 193167 markings/sec, 125 secs
lola: 31957601 markings, 157808018 edges, 180383 markings/sec, 130 secs
lola: 32701538 markings, 163137722 edges, 148787 markings/sec, 135 secs
lola: 33475589 markings, 168842764 edges, 154810 markings/sec, 140 secs
lola: 34169800 markings, 174138673 edges, 138842 markings/sec, 145 secs
lola: 34763505 markings, 179428889 edges, 118741 markings/sec, 150 secs
lola: 35771430 markings, 184654299 edges, 201585 markings/sec, 155 secs
lola: 37343628 markings, 190668682 edges, 314440 markings/sec, 160 secs
lola: 38644939 markings, 196371507 edges, 260262 markings/sec, 165 secs
lola: 40195147 markings, 202188060 edges, 310042 markings/sec, 170 secs
lola: 41362004 markings, 208259274 edges, 233371 markings/sec, 175 secs
lola: 42346569 markings, 213802678 edges, 196913 markings/sec, 180 secs
lola: 43350499 markings, 219128330 edges, 200786 markings/sec, 185 secs
lola: 44102628 markings, 224290976 edges, 150426 markings/sec, 190 secs
lola: 45180576 markings, 229315939 edges, 215590 markings/sec, 195 secs
lola: 46656429 markings, 234920532 edges, 295171 markings/sec, 200 secs
lola: 47735746 markings, 240593580 edges, 215863 markings/sec, 205 secs
lola: 48667709 markings, 245808812 edges, 186393 markings/sec, 210 secs
lola: 49668166 markings, 250991602 edges, 200091 markings/sec, 215 secs
lola: 50416429 markings, 256153304 edges, 149653 markings/sec, 220 secs
lola: 51451145 markings, 261289578 edges, 206943 markings/sec, 225 secs
lola: 52865465 markings, 266904780 edges, 282864 markings/sec, 230 secs
lola: 53964424 markings, 272614533 edges, 219792 markings/sec, 235 secs
lola: 54899408 markings, 277944366 edges, 186997 markings/sec, 240 secs
lola: 55920537 markings, 283636000 edges, 204226 markings/sec, 245 secs
lola: 56870441 markings, 289111184 edges, 189981 markings/sec, 250 secs
lola: 57700831 markings, 294652133 edges, 166078 markings/sec, 255 secs
lola: 58446267 markings, 300119083 edges, 149087 markings/sec, 260 secs
lola: 59110793 markings, 305199141 edges, 132905 markings/sec, 265 secs
lola: 60023994 markings, 310510002 edges, 182640 markings/sec, 270 secs
lola: 60850230 markings, 315673964 edges, 165247 markings/sec, 275 secs
lola: 61525189 markings, 320535641 edges, 134992 markings/sec, 280 secs
lola: 62229722 markings, 325676813 edges, 140907 markings/sec, 285 secs
lola: 62900823 markings, 330550975 edges, 134220 markings/sec, 290 secs
lola: 63457396 markings, 335465686 edges, 111315 markings/sec, 295 secs
lola: 63958623 markings, 339961492 edges, 100245 markings/sec, 300 secs
lola: 65500438 markings, 345745224 edges, 308363 markings/sec, 305 secs
lola: 66813206 markings, 351524365 edges, 262554 markings/sec, 310 secs
lola: 67890285 markings, 357171373 edges, 215416 markings/sec, 315 secs
lola: 68815000 markings, 362307017 edges, 184943 markings/sec, 320 secs
lola: 69884067 markings, 367872087 edges, 213813 markings/sec, 325 secs
lola: 70674429 markings, 373089797 edges, 158072 markings/sec, 330 secs
lola: 71596149 markings, 378297328 edges, 184344 markings/sec, 335 secs
lola: 73179245 markings, 384430414 edges, 316619 markings/sec, 340 secs
lola: 74392344 markings, 390208522 edges, 242620 markings/sec, 345 secs
lola: 75476929 markings, 396185706 edges, 216917 markings/sec, 350 secs
lola: 76337398 markings, 401616365 edges, 172094 markings/sec, 355 secs
lola: 77338321 markings, 407252840 edges, 200185 markings/sec, 360 secs
lola: 78296475 markings, 412688886 edges, 191631 markings/sec, 365 secs
lola: 79085273 markings, 417532779 edges, 157760 markings/sec, 370 secs
lola: 79823753 markings, 422847018 edges, 147696 markings/sec, 375 secs
lola: local time limit reached - aborting
lola:
preliminary result: no no no no no unknown no yes no unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 381 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= A20) OR X (X (F (((A6 + 1 <= A15) OR (A21 <= 0)))))) U (X ((A11 + 1 <= A25)) R (A11 + 1 <= A25))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((2 <= A20) OR X (X (F (((A6 + 1 <= A15) OR (A21 <= 0)))))) U (X ((A11 + 1 <= A25)) R (A11 + 1 <= A25))))
lola: processed formula length: 110
lola: 146 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: 20 markings, 20 edges
lola: ========================================
lola: subprocess 10 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((A3 <= A25) OR (F ((3 <= B6)) AND X (G ((A25 + 1 <= A3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((A3 <= A25) OR (F ((3 <= B6)) AND X (G ((A25 + 1 <= A3))))))
lola: processed formula length: 64
lola: 146 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 534 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G (((1 <= A13)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((1 <= A13)))))
lola: processed formula length: 24
lola: 146 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: 32 markings, 40 edges
lola: ========================================
lola: subprocess 12 will run for 667 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((A7 <= A17)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (A17 + 1 <= A7)
lola: processed formula length: 15
lola: 148 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 13 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((A26 <= B23))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((A26 <= B23))))
lola: processed formula length: 24
lola: 146 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 13 markings, 14 edges
lola: ========================================
lola: subprocess 14 will run for 1335 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (((A2 <= A13) AND (B5 <= B23)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (((A2 <= A13) AND (B5 <= B23)))))
lola: processed formula length: 41
lola: 146 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: 40 markings, 54 edges
lola: ========================================
lola: subprocess 15 will run for 2671 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A27 <= 0) AND A (F ((G (((A24 <= A25) AND F ((B16 <= 1)))) OR (G ((B16 <= 1)) AND ((A24 <= A25) AND F ((B16 <= 1))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2671 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A27 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (A27 <= 0)
lola: processed formula length: 10
lola: 146 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (X (X ((F ((3 <= A20)) OR (G ((A25 <= 2)) OR ((3 <= A20) AND (F ((A25 <= 1)) OR G ((3 <= A20)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((F ((3 <= A20)) OR (G ((A25 <= 2)) OR ((3 <= A20) AND (F ((A25 <= 1)) OR G ((3 <= A20)))))))))
lola: processed formula length: 103
lola: 146 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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2026549 markings, 6359938 edges, 405310 markings/sec, 0 secs
lola: 3419837 markings, 12617918 edges, 278658 markings/sec, 5 secs
lola: 5168328 markings, 19088266 edges, 349698 markings/sec, 10 secs
lola: 6626663 markings, 25400061 edges, 291667 markings/sec, 15 secs
lola: 8009938 markings, 31625980 edges, 276655 markings/sec, 20 secs
lola: 9064280 markings, 37182501 edges, 210868 markings/sec, 25 secs
lola: 10037288 markings, 42891290 edges, 194602 markings/sec, 30 secs
lola: 10967867 markings, 48631601 edges, 186116 markings/sec, 35 secs
lola: 12610982 markings, 54767230 edges, 328623 markings/sec, 40 secs
lola: 14022065 markings, 60723638 edges, 282217 markings/sec, 45 secs
lola: 15461885 markings, 66861591 edges, 287964 markings/sec, 50 secs
lola: 16496739 markings, 72512941 edges, 206971 markings/sec, 55 secs
lola: 17570625 markings, 78279394 edges, 214777 markings/sec, 60 secs
lola: 18377850 markings, 83853350 edges, 161445 markings/sec, 65 secs
lola: 19787453 markings, 89568483 edges, 281921 markings/sec, 70 secs
lola: 21065217 markings, 95574001 edges, 255553 markings/sec, 75 secs
lola: 22060119 markings, 101029237 edges, 198980 markings/sec, 80 secs
lola: 23079618 markings, 106759173 edges, 203900 markings/sec, 85 secs
lola: 23846838 markings, 112085848 edges, 153444 markings/sec, 90 secs
lola: 25322891 markings, 118130860 edges, 295211 markings/sec, 95 secs
lola: 26474931 markings, 123832280 edges, 230408 markings/sec, 100 secs
lola: 27462620 markings, 129392237 edges, 197538 markings/sec, 105 secs
lola: 28499854 markings, 135206943 edges, 207447 markings/sec, 110 secs
lola: 29360694 markings, 140973346 edges, 172168 markings/sec, 115 secs
lola: 30065022 markings, 146221322 edges, 140866 markings/sec, 120 secs
lola: 31008026 markings, 151883880 edges, 188601 markings/sec, 125 secs
lola: 31933012 markings, 157630823 edges, 184997 markings/sec, 130 secs
lola: 32703203 markings, 163149481 edges, 154038 markings/sec, 135 secs
lola: 33430994 markings, 168508957 edges, 145558 markings/sec, 140 secs
lola: 34115828 markings, 173659391 edges, 136967 markings/sec, 145 secs
lola: 34707544 markings, 178928780 edges, 118343 markings/sec, 150 secs
lola: 35419640 markings, 183530615 edges, 142419 markings/sec, 155 secs
lola: 37012988 markings, 189068243 edges, 318670 markings/sec, 160 secs
lola: 38105917 markings, 194441059 edges, 218586 markings/sec, 165 secs
lola: 39756249 markings, 200477947 edges, 330066 markings/sec, 170 secs
lola: 41015462 markings, 206415703 edges, 251843 markings/sec, 175 secs
lola: 42029600 markings, 212074406 edges, 202828 markings/sec, 180 secs
lola: 43058928 markings, 217637400 edges, 205866 markings/sec, 185 secs
lola: 43897888 markings, 222868208 edges, 167792 markings/sec, 190 secs
lola: 44756000 markings, 227862635 edges, 171622 markings/sec, 195 secs
lola: 46365375 markings, 233669609 edges, 321875 markings/sec, 200 secs
lola: 47526802 markings, 239463576 edges, 232285 markings/sec, 205 secs
lola: 48461004 markings, 244729774 edges, 186840 markings/sec, 210 secs
lola: 49499315 markings, 250150837 edges, 207662 markings/sec, 215 secs
lola: 50317103 markings, 255463859 edges, 163558 markings/sec, 220 secs
lola: 51256176 markings, 260520966 edges, 187815 markings/sec, 225 secs
lola: 52708905 markings, 266280854 edges, 290546 markings/sec, 230 secs
lola: 53838799 markings, 271930988 edges, 225979 markings/sec, 235 secs
lola: 54804867 markings, 277395279 edges, 193214 markings/sec, 240 secs
lola: 55811297 markings, 283013550 edges, 201286 markings/sec, 245 secs
lola: 56778944 markings, 288572573 edges, 193529 markings/sec, 250 secs
lola: 57620390 markings, 294069762 edges, 168289 markings/sec, 255 secs
lola: 58383193 markings, 299650128 edges, 152561 markings/sec, 260 secs
lola: 59036857 markings, 304703584 edges, 130733 markings/sec, 265 secs
lola: 59953301 markings, 310097049 edges, 183289 markings/sec, 270 secs
lola: 60796712 markings, 315292310 edges, 168682 markings/sec, 275 secs
lola: 61486719 markings, 320263555 edges, 138001 markings/sec, 280 secs
lola: 62183560 markings, 325335011 edges, 139368 markings/sec, 285 secs
lola: 62866814 markings, 330314241 edges, 136651 markings/sec, 290 secs
lola: 63441727 markings, 335326393 edges, 114983 markings/sec, 295 secs
lola: 63959198 markings, 339966527 edges, 103494 markings/sec, 300 secs
lola: 65484588 markings, 345679081 edges, 305078 markings/sec, 305 secs
lola: 66752558 markings, 351216036 edges, 253594 markings/sec, 310 secs
lola: 67823599 markings, 356812718 edges, 214208 markings/sec, 315 secs
lola: 68708484 markings, 361780705 edges, 176977 markings/sec, 320 secs
lola: 69808045 markings, 367406639 edges, 219912 markings/sec, 325 secs
lola: 70575246 markings, 372404768 edges, 153440 markings/sec, 330 secs
lola: 71336510 markings, 377332736 edges, 152253 markings/sec, 335 secs
lola: 72907334 markings, 383352571 edges, 314165 markings/sec, 340 secs
lola: 74154408 markings, 388937025 edges, 249415 markings/sec, 345 secs
lola: 75238686 markings, 394845739 edges, 216856 markings/sec, 350 secs
lola: 76131648 markings, 400273655 edges, 178592 markings/sec, 355 secs
lola: 77045184 markings, 405636413 edges, 182707 markings/sec, 360 secs
lola: 78041715 markings, 411231261 edges, 199306 markings/sec, 365 secs
lola: 78912797 markings, 416304854 edges, 174216 markings/sec, 370 secs
lola: 79682550 markings, 421827148 edges, 153951 markings/sec, 375 secs
lola: 80397414 markings, 427059780 edges, 142973 markings/sec, 380 secs
lola: 81008420 markings, 431754173 edges, 122201 markings/sec, 385 secs
lola: 82048250 markings, 437487189 edges, 207966 markings/sec, 390 secs
lola: 82860074 markings, 442581626 edges, 162365 markings/sec, 395 secs
lola: 83605168 markings, 447864345 edges, 149019 markings/sec, 400 secs
lola: 84182069 markings, 452322258 edges, 115380 markings/sec, 405 secs
lola: 84885110 markings, 457517628 edges, 140608 markings/sec, 410 secs
lola: 85490099 markings, 462311856 edges, 120998 markings/sec, 415 secs
lola: 86023686 markings, 467066400 edges, 106717 markings/sec, 420 secs
lola: 86923095 markings, 471967390 edges, 179882 markings/sec, 425 secs
lola: 88465195 markings, 477950972 edges, 308420 markings/sec, 430 secs
lola: 89601961 markings, 483495740 edges, 227353 markings/sec, 435 secs
lola: 90595374 markings, 489013706 edges, 198683 markings/sec, 440 secs
lola: 91372622 markings, 493954351 edges, 155450 markings/sec, 445 secs
lola: 92344823 markings, 499355611 edges, 194440 markings/sec, 450 secs
lola: 93328576 markings, 504805445 edges, 196751 markings/sec, 455 secs
lola: 94147093 markings, 509851572 edges, 163703 markings/sec, 460 secs
lola: 94862375 markings, 515011412 edges, 143056 markings/sec, 465 secs
lola: 95547870 markings, 520101281 edges, 137099 markings/sec, 470 secs
lola: 96261839 markings, 525014385 edges, 142794 markings/sec, 475 secs
lola: 97282499 markings, 530576511 edges, 204132 markings/sec, 480 secs
lola: 98079374 markings, 535875951 edges, 159375 markings/sec, 485 secs
lola: 98752922 markings, 540825978 edges, 134710 markings/sec, 490 secs
lola: 99434826 markings, 545873612 edges, 136381 markings/sec, 495 secs
lola: 100137935 markings, 550918901 edges, 140622 markings/sec, 500 secs
lola: 100719140 markings, 556005708 edges, 116241 markings/sec, 505 secs
lola: 101234955 markings, 560630243 edges, 103163 markings/sec, 510 secs
lola: 102560471 markings, 566349188 edges, 265103 markings/sec, 515 secs
lola: 103892870 markings, 572170946 edges, 266480 markings/sec, 520 secs
lola: 104981617 markings, 577769263 edges, 217749 markings/sec, 525 secs
lola: 105980512 markings, 583503987 edges, 199779 markings/sec, 530 secs
lola: 106816454 markings, 588831543 edges, 167188 markings/sec, 535 secs
lola: 107777310 markings, 594412934 edges, 192171 markings/sec, 540 secs
lola: 108722229 markings, 599967162 edges, 188984 markings/sec, 545 secs
lola: 109464711 markings, 604702660 edges, 148496 markings/sec, 550 secs
lola: 110214293 markings, 609794366 edges, 149916 markings/sec, 555 secs
lola: 110937778 markings, 615203963 edges, 144697 markings/sec, 560 secs
lola: 111631292 markings, 620495583 edges, 138703 markings/sec, 565 secs
lola: 112169206 markings, 625140517 edges, 107583 markings/sec, 570 secs
lola: 112965079 markings, 630360978 edges, 159175 markings/sec, 575 secs
lola: 113903335 markings, 635935783 edges, 187651 markings/sec, 580 secs
lola: 114763666 markings, 641034618 edges, 172066 markings/sec, 585 secs
lola: 115535143 markings, 646488392 edges, 154295 markings/sec, 590 secs
lola: 116256493 markings, 651877881 edges, 144270 markings/sec, 595 secs
lola: 116898952 markings, 656817422 edges, 128492 markings/sec, 600 secs
lola: 117573424 markings, 661930187 edges, 134894 markings/sec, 605 secs
lola: 118294579 markings, 667400968 edges, 144231 markings/sec, 610 secs
lola: 118809809 markings, 671343827 edges, 103046 markings/sec, 615 secs
lola: 119058533 markings, 673292644 edges, 49745 markings/sec, 620 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no no no yes no yes no unknown no no yes no no no
lola:
preliminary result: no no no no no yes no yes no unknown no no yes no no no
lola: memory consumption: 33608 KB
lola: time consumption: 1525 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1589538864774

--------------------
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="DNAwalker-PT-07track28RR"
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 DNAwalker-PT-07track28RR, 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 r075-tajo-158922839500033"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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