fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r165-oct2-158972938900033
Last Updated
Jun 28, 2020

About the Execution of 2019-Gold for Ring-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15919.180 904169.00 907340.00 553.30 FFFFF?FFFTFTTTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r165-oct2-158972938900033.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-4028
Executing tool win2019
Input is Ring-PT-none, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-oct2-158972938900033
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 3.4K Apr 12 10:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 12 10:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 11 12:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 11 12:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 14 12:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 14 12:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 10 16:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 10 16:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 9 22:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K Apr 9 22:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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 47K 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 Ring-PT-none-00
FORMULA_NAME Ring-PT-none-01
FORMULA_NAME Ring-PT-none-02
FORMULA_NAME Ring-PT-none-03
FORMULA_NAME Ring-PT-none-04
FORMULA_NAME Ring-PT-none-05
FORMULA_NAME Ring-PT-none-06
FORMULA_NAME Ring-PT-none-07
FORMULA_NAME Ring-PT-none-08
FORMULA_NAME Ring-PT-none-09
FORMULA_NAME Ring-PT-none-10
FORMULA_NAME Ring-PT-none-11
FORMULA_NAME Ring-PT-none-12
FORMULA_NAME Ring-PT-none-13
FORMULA_NAME Ring-PT-none-14
FORMULA_NAME Ring-PT-none-15

=== Now, execution of the tool begins

BK_START 1590263745008

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Ring-PT-none @ 3570 seconds

FORMULA Ring-PT-none-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Ring-PT-none-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Ring-PT-none-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Ring-PT-none-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Ring-PT-none-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Ring-PT-none-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Ring-PT-none-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Ring-PT-none-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Ring-PT-none-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Ring-PT-none-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Ring-PT-none-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Ring-PT-none-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Ring-PT-none-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Ring-PT-none-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Ring-PT-none-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Ring-PT-none-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2666
rslt: Output for LTLCardinality @ Ring-PT-none

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

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

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

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A ((X (G ((P98 + 1 <= P77))) R (P5 <= 0)))",
"processed_size": 42,
"rewrites": 137
},
"result":
{
"edges": 7564,
"markings": 4660,
"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
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 3,
"G": 0,
"U": 0,
"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": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (F ((F ((P41 <= P101)) OR X (F ((P105 <= P59))))))",
"processed_size": 52,
"rewrites": 137
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 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 (F (G ((1 <= P94))))",
"processed_size": 22,
"rewrites": 137
},
"result":
{
"edges": 30,
"markings": 27,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"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": 8,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 521
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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 (X ((P56 <= P127)))",
"processed_size": 21,
"rewrites": 137
},
"result":
{
"edges": 12,
"markings": 13,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 625
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X (X (X (G ((P59 + 1 <= P28))))))",
"processed_size": 36,
"rewrites": 137
},
"result":
{
"edges": 31,
"markings": 31,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 782
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 782
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(P95 + 1 <= P83)",
"processed_size": 16,
"rewrites": 137
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1042
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"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 (X (X (F ((P65 <= P110)))))",
"processed_size": 29,
"rewrites": 137
},
"result":
{
"edges": 19,
"markings": 19,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 13,
"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": 1564
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (F (G ((P115 <= P127))))",
"processed_size": 26,
"rewrites": 137
},
"result":
{
"edges": 60,
"markings": 53,
"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": 3128
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (F (G ((((P94 <= P1)) OR (P94 <= P1)))))",
"processed_size": 42,
"rewrites": 137
},
"result":
{
"edges": 15,
"markings": 14,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 22300,
"runtime": 880.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "FALSE : FALSE : A(F(G((** OR **)))) : FALSE : (A(X(G((** AND F(**))))) AND (A(F(G(**))) AND A(X(G(**))))) : A(F(G((F(**) AND (F(G(*)) OR (X(X(*)) OR **)))))) : A(F(G(*))) : A(X(X(X(G(*))))) : A((X(G(*)) R *)) : A(F((F(**) OR X(F(**))))) : FALSE : TRUE : A(X(**)) : TRUE : (A(X(F(*))) AND (* AND A((* R *)))) : A(X(X(F(**))))"
},
"net":
{
"arcs": 410,
"conflict_clusters": 33,
"places": 139,
"places_significant": 75,
"singleton_clusters": 0,
"transitions": 87
},
"result":
{
"preliminary_value": "no no no no no unknown no no no yes no yes yes yes no no ",
"value": "no no no no no unknown no no no yes no yes yes yes 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: 226/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 139
lola: finding significant places
lola: 139 places, 87 transitions, 75 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: (3 <= P14)
lola: LP says that atomic proposition is always false: (2 <= P85)
lola: LP says that atomic proposition is always false: (3 <= P132)
lola: LP says that atomic proposition is always false: (2 <= P85)
lola: LP says that atomic proposition is always false: (3 <= P129)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= P36)
lola: after: (1 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= P36)
lola: after: (1 <= 0)
lola: LP says that atomic proposition is always false: (3 <= P57)
lola: LP says that atomic proposition is always false: (2 <= P27)
lola: place invariant simplifies atomic proposition
lola: before: (P36 <= P18)
lola: after: (1 <= P18)
lola: place invariant simplifies atomic proposition
lola: before: (P22 <= P13)
lola: after: (0 <= 0)
lola: LP says that atomic proposition is always false: (2 <= P111)
lola: LP says that atomic proposition is always false: (3 <= P109)
lola: LP says that atomic proposition is always false: (3 <= P109)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= P29)
lola: after: (1 <= 0)
lola: LP says that atomic proposition is always false: (2 <= P26)
lola: LP says that atomic proposition is always false: (2 <= P50)
lola: LP says that atomic proposition is always false: (2 <= P50)
lola: LP says that atomic proposition is always false: (3 <= P15)
lola: A (((X ((P108 <= P35)) U G ((P108 <= P35))) U X ((3 <= P14)))) : A (((2 <= P85) AND (X (G (((3 <= P132) AND X ((2 <= P85))))) OR (((3 <= P129) OR X ((P111 <= P71))) U (P48 <= P132))))) : A (((0 <= 0) U X (G (X ((((P94 <= P1)) OR ((3 <= P57) U (P94 <= P1)))))))) : A (F (NOT((G ((0 <= P95)) AND F (G (NOT(F (())))))))) : A (G (((X (((P96 <= P98) AND F ((1 <= P18)))) AND F (G ((1 <= P94)))) AND X ((P96 <= P98))))) : A (X (X (F (G ((NOT((G (F ((P78 <= P68))) AND X (X ((P78 <= P68))))) U (P78 <= P68))))))) : A (F (NOT(G (F ((P127 + 1 <= P115)))))) : A (X (X (X (NOT(((P59 + 1 <= P28) U F ((P28 <= P59)))))))) : A (NOT((X ((G ((0 <= P93)) U F ((P77 <= P98)))) U (1 <= P5)))) : A (F ((F ((P41 <= P101)) OR (((1 <= P126) U (0 <= 0)) AND F (((2 <= P111) OR X ((P105 <= P59)))))))) : A (X (F ((F (NOT(F ((3 <= P109)))) U X (F (X (F ((3 <= P109))))))))) : A (NOT(F ((1 <= 0)))) : A ((NOT(G (F (((0 <= P97) U X (X ((P26 <= 1))))))) U X ((P56 <= P127)))) : A (G (((X (((P54 <= P16) AND X (G ((2 <= P50))))) OR F (NOT(X ((2 <= P50))))) OR X ((P114 <= P54))))) : A ((F (NOT(X ((P59 <= P62)))) AND NOT(((P83 <= P95) OR ((P59 <= P62) U ((3 <= P15) U (P127 <= P68))))))) : A (X (F ((X ((P91 <= P6)) U ((P91 <= P6) U X ((P65 <= P110)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:169
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:335
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 137 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 137 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 137 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 137 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 137 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 5 will run for 324 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: 137 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 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((P98 + 1 <= P77))) R (P5 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((P98 + 1 <= P77))) R (P5 <= 0)))
lola: processed formula length: 42
lola: 137 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: 4660 markings, 7564 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((P41 <= P101)) OR X (F ((P105 <= P59))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((F ((P41 <= P101)) OR X (F ((P105 <= P59))))))
lola: processed formula length: 52
lola: 137 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (G (((P96 <= P98) AND F ((1 <= P18)))))) AND (A (F (G ((1 <= P94)))) AND A (X (G ((P96 <= P98))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((1 <= P94))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((1 <= P94))))
lola: processed formula length: 22
lola: 137 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: 27 markings, 30 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((F ((P78 <= P68)) AND (F (G ((P68 + 1 <= P78))) OR (X (X ((P68 + 1 <= P78))) OR (P78 <= P68)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F ((P78 <= P68)) AND (F (G ((P68 + 1 <= P78))) OR (X (X ((P68 + 1 <= P78))) OR (P78 <= P68)))))))
lola: processed formula length: 107
lola: 137 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 15 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: 1916552 markings, 5954815 edges, 383310 markings/sec, 0 secs
lola: 3513522 markings, 11771722 edges, 319394 markings/sec, 5 secs
lola: 5196323 markings, 17592018 edges, 336560 markings/sec, 10 secs
lola: 6705417 markings, 23408711 edges, 301819 markings/sec, 15 secs
lola: 8291127 markings, 29185636 edges, 317142 markings/sec, 20 secs
lola: 10009095 markings, 34883213 edges, 343594 markings/sec, 25 secs
lola: 11575657 markings, 40284744 edges, 313312 markings/sec, 30 secs
lola: 13042744 markings, 45481940 edges, 293417 markings/sec, 35 secs
lola: 14294114 markings, 50715619 edges, 250274 markings/sec, 40 secs
lola: 15488138 markings, 55925605 edges, 238805 markings/sec, 45 secs
lola: 16529766 markings, 60854058 edges, 208326 markings/sec, 50 secs
lola: 17886970 markings, 66340375 edges, 271441 markings/sec, 55 secs
lola: 19232716 markings, 71293514 edges, 269149 markings/sec, 60 secs
lola: 20172797 markings, 75789998 edges, 188016 markings/sec, 65 secs
lola: 21352355 markings, 80145258 edges, 235912 markings/sec, 70 secs
lola: 22451408 markings, 84541070 edges, 219811 markings/sec, 75 secs
lola: 23392083 markings, 88983253 edges, 188135 markings/sec, 80 secs
lola: 24538217 markings, 93531089 edges, 229227 markings/sec, 85 secs
lola: 26227910 markings, 99552332 edges, 337939 markings/sec, 90 secs
lola: 27821611 markings, 105445450 edges, 318740 markings/sec, 95 secs
lola: 29343006 markings, 111207156 edges, 304279 markings/sec, 100 secs
lola: 30712174 markings, 116904506 edges, 273834 markings/sec, 105 secs
lola: 32290600 markings, 122607139 edges, 315685 markings/sec, 110 secs
lola: 33675325 markings, 128220416 edges, 276945 markings/sec, 115 secs
lola: 35035080 markings, 133797319 edges, 271951 markings/sec, 120 secs
lola: 36395002 markings, 139362421 edges, 271984 markings/sec, 125 secs
lola: 37721816 markings, 144927505 edges, 265363 markings/sec, 130 secs
lola: 39169453 markings, 150653372 edges, 289527 markings/sec, 135 secs
lola: 40796794 markings, 156677478 edges, 325468 markings/sec, 140 secs
lola: 42314309 markings, 162308162 edges, 303503 markings/sec, 145 secs
lola: 43866461 markings, 167962626 edges, 310430 markings/sec, 150 secs
lola: 45345651 markings, 173441191 edges, 295838 markings/sec, 155 secs
lola: 46582953 markings, 178469691 edges, 247460 markings/sec, 160 secs
lola: 47986171 markings, 183900294 edges, 280644 markings/sec, 165 secs
lola: 49349935 markings, 189315562 edges, 272753 markings/sec, 170 secs
lola: 50523801 markings, 194678310 edges, 234773 markings/sec, 175 secs
lola: 51658367 markings, 200055515 edges, 226913 markings/sec, 180 secs
lola: 52815619 markings, 205418827 edges, 231450 markings/sec, 185 secs
lola: 53841969 markings, 210657167 edges, 205270 markings/sec, 190 secs
lola: 54898804 markings, 216015131 edges, 211367 markings/sec, 195 secs
lola: 56015232 markings, 221142447 edges, 223286 markings/sec, 200 secs
lola: 57169930 markings, 226399484 edges, 230940 markings/sec, 205 secs
lola: 58448432 markings, 231663339 edges, 255700 markings/sec, 210 secs
lola: 59656118 markings, 237019864 edges, 241537 markings/sec, 215 secs
lola: 60856818 markings, 241603882 edges, 240140 markings/sec, 220 secs
lola: 61684899 markings, 246325742 edges, 165616 markings/sec, 225 secs
lola: 62925328 markings, 251582107 edges, 248086 markings/sec, 230 secs
lola: 63875927 markings, 255782310 edges, 190120 markings/sec, 235 secs
lola: 64846542 markings, 260528605 edges, 194123 markings/sec, 240 secs
lola: 66097547 markings, 265286946 edges, 250201 markings/sec, 245 secs
lola: 66824208 markings, 269506845 edges, 145332 markings/sec, 250 secs
lola: 68102490 markings, 274572435 edges, 255656 markings/sec, 255 secs
lola: 69062708 markings, 278765242 edges, 192044 markings/sec, 260 secs
lola: 70617263 markings, 284588827 edges, 310911 markings/sec, 265 secs
lola: 72018369 markings, 290243943 edges, 280221 markings/sec, 270 secs
lola: 73416052 markings, 295850657 edges, 279537 markings/sec, 275 secs
lola: 74711752 markings, 301363025 edges, 259140 markings/sec, 280 secs
lola: 75976942 markings, 306824905 edges, 253038 markings/sec, 285 secs
lola: 77336694 markings, 312340868 edges, 271950 markings/sec, 290 secs
lola: 78768308 markings, 317779929 edges, 286323 markings/sec, 295 secs
lola: 80130125 markings, 323100137 edges, 272363 markings/sec, 300 secs
lola: 81376158 markings, 328282538 edges, 249207 markings/sec, 305 secs
lola: 82623892 markings, 333591608 edges, 249547 markings/sec, 310 secs
lola: 83752810 markings, 339038705 edges, 225784 markings/sec, 315 secs
lola: 84786618 markings, 344312722 edges, 206762 markings/sec, 320 secs
lola: 85833180 markings, 349574017 edges, 209312 markings/sec, 325 secs
lola: 87055639 markings, 355037395 edges, 244492 markings/sec, 330 secs
lola: 88206157 markings, 359505375 edges, 230104 markings/sec, 335 secs
lola: 88981105 markings, 363968088 edges, 154990 markings/sec, 340 secs
lola: 90101194 markings, 368211359 edges, 224018 markings/sec, 345 secs
lola: 90915122 markings, 372597731 edges, 162786 markings/sec, 350 secs
lola: 91599038 markings, 376330868 edges, 136783 markings/sec, 355 secs
lola: 92857274 markings, 380772401 edges, 251647 markings/sec, 360 secs
lola: 93876215 markings, 385644010 edges, 203788 markings/sec, 365 secs
lola: 95489932 markings, 391381853 edges, 322743 markings/sec, 370 secs
lola: 97008838 markings, 396944196 edges, 303781 markings/sec, 375 secs
lola: 98391924 markings, 402442981 edges, 276617 markings/sec, 380 secs
lola: 99756259 markings, 407958210 edges, 272867 markings/sec, 385 secs
lola: 101256137 markings, 413428486 edges, 299976 markings/sec, 390 secs
lola: 102600945 markings, 418876429 edges, 268962 markings/sec, 395 secs
lola: 103930102 markings, 424363730 edges, 265831 markings/sec, 400 secs
lola: 105262777 markings, 429813185 edges, 266535 markings/sec, 405 secs
lola: 106543495 markings, 435173731 edges, 256144 markings/sec, 410 secs
lola: 107903458 markings, 440607122 edges, 271993 markings/sec, 415 secs
lola: 109396408 markings, 446114766 edges, 298590 markings/sec, 420 secs
lola: 110592777 markings, 450577087 edges, 239274 markings/sec, 425 secs
lola: 110967036 markings, 451950205 edges, 74852 markings/sec, 430 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 521 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((P56 <= P127)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((P56 <= P127)))
lola: processed formula length: 21
lola: 137 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: 13 markings, 12 edges
lola: ========================================
lola: subprocess 11 will run for 625 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (G ((P59 + 1 <= P28))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (G ((P59 + 1 <= P28))))))
lola: processed formula length: 36
lola: 137 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: 31 markings, 31 edges
lola: ========================================
lola: subprocess 12 will run for 782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (F ((P62 + 1 <= P59)))) AND ((P95 + 1 <= P83) AND A (((P62 + 1 <= P59) R (P68 + 1 <= P127)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (P95 + 1 <= P83)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P95 + 1 <= P83)
lola: processed formula length: 16
lola: 137 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 1042 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((P65 <= P110)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((P65 <= P110)))))
lola: processed formula length: 29
lola: 137 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: 19 markings, 19 edges
lola: ========================================
lola: subprocess 14 will run for 1564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((P115 <= P127))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((P115 <= P127))))
lola: processed formula length: 26
lola: 137 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: 53 markings, 60 edges
lola: ========================================
lola: subprocess 15 will run for 3128 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((((P94 <= P1)) OR (P94 <= P1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((((P94 <= P1)) OR (P94 <= P1)))))
lola: processed formula length: 42
lola: 137 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: 14 markings, 15 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (G ((F ((P78 <= P68)) AND (F (G ((P68 + 1 <= P78))) OR (X (X ((P68 + 1 <= P78))) OR (P78 <= P68)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F ((P78 <= P68)) AND (F (G ((P68 + 1 <= P78))) OR (X (X ((P68 + 1 <= P78))) OR (P78 <= P68)))))))
lola: processed formula length: 107
lola: 137 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 15 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: 1932252 markings, 6000043 edges, 386450 markings/sec, 0 secs
lola: 3551997 markings, 11922989 edges, 323949 markings/sec, 5 secs
lola: 5215467 markings, 17669897 edges, 332694 markings/sec, 10 secs
lola: 6684285 markings, 23322260 edges, 293764 markings/sec, 15 secs
lola: 8172656 markings, 28794392 edges, 297674 markings/sec, 20 secs
lola: 9822894 markings, 34232696 edges, 330048 markings/sec, 25 secs
lola: 11384664 markings, 39569359 edges, 312354 markings/sec, 30 secs
lola: 12847734 markings, 44804076 edges, 292614 markings/sec, 35 secs
lola: 14185528 markings, 50201889 edges, 267559 markings/sec, 40 secs
lola: 15447680 markings, 55738338 edges, 252430 markings/sec, 45 secs
lola: 16590362 markings, 61109251 edges, 228536 markings/sec, 50 secs
lola: 17971754 markings, 66710011 edges, 276278 markings/sec, 55 secs
lola: 19325722 markings, 71616492 edges, 270794 markings/sec, 60 secs
lola: 20311056 markings, 76383948 edges, 197067 markings/sec, 65 secs
lola: 21363822 markings, 80619271 edges, 210553 markings/sec, 70 secs
lola: 22587499 markings, 85042097 edges, 244735 markings/sec, 75 secs
lola: 23585406 markings, 89435847 edges, 199581 markings/sec, 80 secs
lola: 24682181 markings, 94066057 edges, 219355 markings/sec, 85 secs
lola: 26347141 markings, 99970623 edges, 332992 markings/sec, 90 secs
lola: 27917864 markings, 105801916 edges, 314145 markings/sec, 95 secs
lola: 29407497 markings, 111485327 edges, 297927 markings/sec, 100 secs
lola: 30799531 markings, 117215245 edges, 278407 markings/sec, 105 secs
lola: 32349535 markings, 122829939 edges, 310001 markings/sec, 110 secs
lola: 33715969 markings, 128390873 edges, 273287 markings/sec, 115 secs
lola: 35089504 markings, 134029664 edges, 274707 markings/sec, 120 secs
lola: 36461101 markings, 139646668 edges, 274319 markings/sec, 125 secs
lola: 37790631 markings, 145169251 edges, 265906 markings/sec, 130 secs
lola: 39231528 markings, 150858347 edges, 288179 markings/sec, 135 secs
lola: 40771175 markings, 156570254 edges, 307929 markings/sec, 140 secs
lola: 42189876 markings, 161859739 edges, 283740 markings/sec, 145 secs
lola: 43693935 markings, 167311032 edges, 300812 markings/sec, 150 secs
lola: 45147305 markings, 172649887 edges, 290674 markings/sec, 155 secs
lola: 46372662 markings, 177604315 edges, 245071 markings/sec, 160 secs
lola: 47691813 markings, 182844590 edges, 263830 markings/sec, 165 secs
lola: 49123478 markings, 188306910 edges, 286333 markings/sec, 170 secs
lola: 50290853 markings, 193610134 edges, 233475 markings/sec, 175 secs
lola: 51455902 markings, 199075095 edges, 233010 markings/sec, 180 secs
lola: 52622579 markings, 204451715 edges, 233335 markings/sec, 185 secs
lola: 53649257 markings, 209668219 edges, 205336 markings/sec, 190 secs
lola: 54689695 markings, 214983974 edges, 208088 markings/sec, 195 secs
lola: 55808157 markings, 220186905 edges, 223692 markings/sec, 200 secs
lola: 56989981 markings, 225614349 edges, 236365 markings/sec, 205 secs
lola: 58191397 markings, 230726823 edges, 240283 markings/sec, 210 secs
lola: 59454624 markings, 236112491 edges, 252645 markings/sec, 215 secs
lola: 60664059 markings, 240701319 edges, 241887 markings/sec, 220 secs
lola: 61424233 markings, 245207204 edges, 152035 markings/sec, 225 secs
lola: 62647295 markings, 250381422 edges, 244612 markings/sec, 230 secs
lola: 63819288 markings, 254780918 edges, 234399 markings/sec, 235 secs
lola: 64568809 markings, 259245868 edges, 149904 markings/sec, 240 secs
lola: 65718685 markings, 264196904 edges, 229975 markings/sec, 245 secs
lola: 66541453 markings, 268134797 edges, 164554 markings/sec, 250 secs
lola: 67713448 markings, 273050908 edges, 234399 markings/sec, 255 secs
lola: 69012338 markings, 277549798 edges, 259778 markings/sec, 260 secs
lola: 70143616 markings, 282758935 edges, 226256 markings/sec, 265 secs
lola: 71577326 markings, 288377842 edges, 286742 markings/sec, 270 secs
lola: 72928073 markings, 293927122 edges, 270149 markings/sec, 275 secs
lola: 74278497 markings, 299471113 edges, 270085 markings/sec, 280 secs
lola: 75536196 markings, 304959889 edges, 251540 markings/sec, 285 secs
lola: 76812157 markings, 310374517 edges, 255192 markings/sec, 290 secs
lola: 78238070 markings, 315777494 edges, 285183 markings/sec, 295 secs
lola: 79620854 markings, 321040647 edges, 276557 markings/sec, 300 secs
lola: 80841355 markings, 326148291 edges, 244100 markings/sec, 305 secs
lola: 82158674 markings, 331409125 edges, 263464 markings/sec, 310 secs
lola: 83276604 markings, 336767728 edges, 223586 markings/sec, 315 secs
lola: 84360493 markings, 342098793 edges, 216778 markings/sec, 320 secs
lola: 85372504 markings, 347382513 edges, 202402 markings/sec, 325 secs
lola: 86524941 markings, 352703757 edges, 230487 markings/sec, 330 secs
lola: 87726161 markings, 357902452 edges, 240244 markings/sec, 335 secs
lola: 88490055 markings, 361764606 edges, 152779 markings/sec, 340 secs
lola: 89682623 markings, 366549644 edges, 238514 markings/sec, 345 secs
lola: 90395455 markings, 370631875 edges, 142566 markings/sec, 350 secs
lola: 91520081 markings, 374783661 edges, 224925 markings/sec, 355 secs
lola: 92334773 markings, 379085941 edges, 162938 markings/sec, 360 secs
lola: 93221633 markings, 383261671 edges, 177372 markings/sec, 365 secs
lola: 94812494 markings, 389016512 edges, 318172 markings/sec, 370 secs
lola: 96387901 markings, 394757861 edges, 315081 markings/sec, 375 secs
lola: 97919855 markings, 400468312 edges, 306391 markings/sec, 380 secs
lola: 99261246 markings, 405938055 edges, 268278 markings/sec, 385 secs
lola: 100732468 markings, 411464958 edges, 294244 markings/sec, 390 secs
lola: 102145593 markings, 416996727 edges, 282625 markings/sec, 395 secs
lola: 103513590 markings, 422660751 edges, 273599 markings/sec, 400 secs
lola: 104836786 markings, 428044416 edges, 264639 markings/sec, 405 secs
lola: 106132846 markings, 433492594 edges, 259212 markings/sec, 410 secs
lola: 107479846 markings, 439076104 edges, 269400 markings/sec, 415 secs
lola: 109012597 markings, 444640270 edges, 306550 markings/sec, 420 secs
lola: 110441284 markings, 450020766 edges, 285737 markings/sec, 425 secs
lola: 110909060 markings, 451754035 edges, 93555 markings/sec, 430 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no no no unknown no no no yes no yes yes yes no no
lola:
preliminary result: no no no no no unknown no no no yes no yes yes yes no no
lola: memory consumption: 22300 KB
lola: time consumption: 880 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1590264649177

--------------------
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="Ring-PT-none"
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 Ring-PT-none, 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 r165-oct2-158972938900033"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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