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

About the Execution of 2019-Gold for Sudoku-PT-AN02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4264.160 28436.00 7363.00 12.50 FTTFTFTTFFFFFTFF 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.r238-oct2-159033569000081.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 Sudoku-PT-AN02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r238-oct2-159033569000081
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 4.3K May 14 03:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 14 03:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 13 21:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 27K May 13 21:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.6K May 14 10:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 14 10:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 10:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 23K May 14 10:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.5K May 13 15:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 13 15:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 13 10:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 13 10:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.3K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 6.0K May 12 20:42 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 Sudoku-PT-AN02-00
FORMULA_NAME Sudoku-PT-AN02-01
FORMULA_NAME Sudoku-PT-AN02-02
FORMULA_NAME Sudoku-PT-AN02-03
FORMULA_NAME Sudoku-PT-AN02-04
FORMULA_NAME Sudoku-PT-AN02-05
FORMULA_NAME Sudoku-PT-AN02-06
FORMULA_NAME Sudoku-PT-AN02-07
FORMULA_NAME Sudoku-PT-AN02-08
FORMULA_NAME Sudoku-PT-AN02-09
FORMULA_NAME Sudoku-PT-AN02-10
FORMULA_NAME Sudoku-PT-AN02-11
FORMULA_NAME Sudoku-PT-AN02-12
FORMULA_NAME Sudoku-PT-AN02-13
FORMULA_NAME Sudoku-PT-AN02-14
FORMULA_NAME Sudoku-PT-AN02-15

=== Now, execution of the tool begins

BK_START 1590588594110

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Sudoku-PT-AN02 @ 3570 seconds

FORMULA Sudoku-PT-AN02-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN02-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN02-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN02-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN02-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN02-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN02-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN02-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN02-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN02-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN02-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN02-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN02-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN02-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN02-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN02-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3542
rslt: Output for LTLCardinality @ Sudoku-PT-AN02

{
"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": "Wed May 27 14:09:54 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 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": 100
},
"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": 100
},
"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": 100
},
"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": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 28,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "A ((X ((G ((3 <= Board_1_0_0 + Board_1_0_1 + Board_1_1_0 + Board_1_1_1 + Board_0_0_0 + Board_0_0_1 + Board_0_1_0 + Board_0_1_1)) OR F ((Columns_0_0 + Columns_0_1 + Columns_1_0 + Columns_1_1 <= Board_1_0_0 + Board_1_0_1 + Board_1_1_0 + Board_1_1_1 + Board_0_0_0 + Board_0_0_1 + Board_0_1_0 + Board_0_1_1)))) U (3 <= Board_1_0_0 + Board_1_0_1 + Board_1_1_0 + Board_1_1_1 + Board_0_0_0 + Board_0_0_1 + Board_0_1_0 + Board_0_1_1)))",
"processed_size": 427,
"rewrites": 100
},
"result":
{
"edges": 32,
"markings": 21,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "A (X ((F ((Board_1_0_0 + Board_1_0_1 + Board_1_1_0 + Board_1_1_1 + Board_0_0_0 + Board_0_0_1 + Board_0_1_0 + Board_0_1_1 <= Rows_0_0 + Rows_0_1 + Rows_1_1 + Rows_1_0)) OR (2 <= Board_1_0_0 + Board_1_0_1 + Board_1_1_0 + Board_1_1_1 + Board_0_0_0 + Board_0_0_1 + Board_0_1_0 + Board_0_1_1))))",
"processed_size": 290,
"rewrites": 100
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "A (X (X (X (G ((Cells_0_0 + Cells_0_1 + Cells_1_0 + Cells_1_1 + 1 <= Board_1_0_0 + Board_1_0_1 + Board_1_1_0 + Board_1_1_1 + Board_0_0_0 + Board_0_0_1 + Board_0_1_0 + Board_0_1_1))))))",
"processed_size": 184,
"rewrites": 100
},
"result":
{
"edges": 18,
"markings": 12,
"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": 356
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "A (X (TRUE))",
"processed_size": 12,
"rewrites": 100
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"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": "(Board_1_0_1 <= Columns_1_0)",
"processed_size": 28,
"rewrites": 100
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A ((F ((Rows_0_1 + 1 <= Cells_0_0)) OR X (G (((Rows_0_1 <= Columns_0_0) AND (Board_1_0_1 <= Columns_1_0))))))",
"processed_size": 109,
"rewrites": 100
},
"result":
{
"edges": 11,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 1,
"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": 6,
"visible_transitions": 0
},
"processed": "A ((F ((Cells_0_1 <= Rows_0_0)) OR X (G ((F ((Columns_1_0 <= Board_0_0_1)) AND F ((Columns_0_0 <= Rows_1_1)))))))",
"processed_size": 113,
"rewrites": 100
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 2,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 28,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "A (G (((X (((Board_1_0_0 + Board_1_0_1 + Board_1_1_0 + Board_1_1_1 + Board_0_0_0 + Board_0_0_1 + Board_0_1_0 + Board_0_1_1 + 1 <= Cells_0_0 + Cells_0_1 + Cells_1_0 + Cells_1_1) OR (Rows_0_0 + Rows_0_1 + Rows_1_1 + Rows_1_0 <= 0))) U (1 <= Rows_0_0 + Rows_0_1 + Rows_1_1 + Rows_1_0)) OR (F ((1 <= Rows_0_0 + Rows_0_1 + Rows_1_1 + Rows_1_0)) AND F (G ((1 <= Rows_0_0 + Rows_0_1 + Rows_1_1 + Rows_1_0)))))))",
"processed_size": 405,
"rewrites": 100
},
"result":
{
"edges": 9,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"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 (X (G ((F ((Rows_1_0 <= Board_1_0_1)) AND ((Rows_0_1 <= Board_0_1_1) OR (Rows_1_0 <= Board_1_0_1))))))",
"processed_size": 104,
"rewrites": 100
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "((Board_1_0_0 + Board_1_0_1 + Board_1_1_0 + Board_1_1_1 + Board_0_0_0 + Board_0_0_1 + Board_0_1_0 + Board_0_1_1 <= 1))",
"processed_size": 118,
"rewrites": 102
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G (F ((Cells_0_1 <= 0))))",
"processed_size": 28,
"rewrites": 100
},
"result":
{
"edges": 11,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"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 ((Rows_0_1 + 1 <= Columns_1_0))))",
"processed_size": 41,
"rewrites": 100
},
"result":
{
"edges": 7,
"markings": 6,
"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": 1783
},
"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": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (F (G ((Rows_0_0 + Rows_0_1 + Rows_1_1 + Rows_1_0 <= 2))))",
"processed_size": 60,
"rewrites": 100
},
"result":
{
"edges": 210,
"markings": 59,
"produced_by": "LTL model checker",
"value": true
},
"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": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 28,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "A (F (((2 <= Columns_0_0 + Columns_0_1 + Columns_1_0 + Columns_1_1) OR ((Board_1_0_0 + Board_1_0_1 + Board_1_1_0 + Board_1_1_1 + Board_0_0_0 + Board_0_0_1 + Board_0_1_0 + Board_0_1_1 <= Cells_0_0 + Cells_0_1 + Cells_1_0 + Cells_1_1) U (Rows_0_0 + Rows_0_1 + Rows_1_1 + Rows_1_0 <= Board_1_0_0 + Board_1_0_1 + Board_1_1_0 + Board_1_1_1 + Board_0_0_0 + Board_0_0_1 + Board_0_1_0 + Board_0_1_1)))))",
"processed_size": 395,
"rewrites": 100
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 1
},
"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": 22688,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(X(X(X(G(*))))) : A(X(TRUE)) : A(F(**)) : A(G(((X(*) U **) OR (F(**) AND F(G(**)))))) : A(F(G(*))) : A((X((G(**) OR F(**))) U **)) : A(F((** OR (** U **)))) : A(X((F(**) OR **))) : A(G(F(*))) : FALSE : A(F(G(*))) : FALSE : (** AND A((F(*) OR X(G(**))))) : A((F(**) OR X(G((F(**) AND F(**)))))) : FALSE : A(X(G((F(**) AND (** OR **)))))"
},
"net":
{
"arcs": 32,
"conflict_clusters": 9,
"places": 20,
"places_significant": 8,
"singleton_clusters": 0,
"transitions": 8
},
"result":
{
"preliminary_value": "no yes yes no yes no yes yes no no no no no yes no no ",
"value": "no yes yes no yes no yes yes no no no no no 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: 28/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 640
lola: finding significant places
lola: 20 places, 8 transitions, 8 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: place invariant simplifies atomic proposition
lola: before: (Rows_0_0 + Rows_0_1 + Rows_1_1 + Rows_1_0 <= Columns_0_0 + Columns_0_1 + Columns_1_0 + Columns_1_1)
lola: after: (0 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (Columns_0_0 + Columns_0_1 + Columns_1_0 + Columns_1_1 <= Rows_0_0 + Rows_0_1 + Rows_1_1 + Rows_1_0)
lola: after: (0 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (Rows_0_0 + Rows_0_1 + Rows_1_1 + Rows_1_0 <= Cells_0_0 + Cells_0_1 + Cells_1_0 + Cells_1_1)
lola: after: (0 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (Rows_0_0 + Rows_0_1 + Rows_1_1 + Rows_1_0 <= Cells_0_0 + Cells_0_1 + Cells_1_0 + Cells_1_1)
lola: after: (0 <= 0)
lola: LP says that atomic proposition is always false: (2 <= Cells_0_1)
lola: LP says that atomic proposition is always false: (2 <= Columns_1_1)
lola: LP says that atomic proposition is always false: (2 <= Cells_0_1)
lola: LP says that atomic proposition is always false: (2 <= Board_1_0_0)
lola: LP says that atomic proposition is always false: (2 <= Board_1_0_0)
lola: LP says that atomic proposition is always false: (3 <= Board_1_1_0)
lola: LP says that atomic proposition is always false: (2 <= Rows_0_0)
lola: A (X (G (NOT(X (F (X ((Board_1_0_0 + Board_1_0_1 + Board_1_1_0 + Board_1_1_1 + Board_0_0_0 + Board_0_0_1 + Board_0_1_0 + Board_0_1_1 <= Cells_0_0 + Cells_0_1 + Cells_1_0 + Cells_1_1)))))))) : A (G (X ((X ((0 <= 0)) OR X ((Board_1_0_0 + Board_1_0_1 + Board_1_1_0 + Board_1_1_1 + Board_0_0_0 + Board_0_0_1 + Board_0_1_0 + Board_0_1_1 <= Columns_0_0 + Columns_0_1 + Columns_1_0 + Columns_1_1)))))) : A (F (((2 <= Board_1_0_0 + Board_1_0_1 + Board_1_1_0 + Board_1_1_1 + Board_0_0_0 + Board_0_0_1 + Board_0_1_0 + Board_0_1_1)))) : A (G ((((1 <= 0) OR F (G ((1 <= Rows_0_0 + Rows_0_1 + Rows_1_1 + Rows_1_0)))) U (NOT(X (((Cells_0_0 + Cells_0_1 + Cells_1_0 + Cells_1_1 <= Board_1_0_0 + Board_1_0_1 + Board_1_1_0 + Board_1_1_1 + Board_0_0_0 + Board_0_0_1 + Board_0_1_0 + Board_0_1_1) AND (1 <= Rows_0_0 + Rows_0_1 + Rows_1_1 + Rows_1_0)))) U (1 <= Rows_0_0 + Rows_0_1 + Rows_1_1 + Rows_1_0))))) : A (X (F (NOT(G (X (NOT(G (X (NOT(G (F ((3 <= Rows_0_0 + Rows_0_1 + Rows_1_1 + Rows_1_0))))))))))))) : A (((((1 <= 0) OR G (X ((3 <= Board_1_0_0 + Board_1_0_1 + Board_1_1_0 + Board_1_1_1 + Board_0_0_0 + Board_0_0_1 + Board_0_1_0 + Board_0_1_1)))) OR X (F ((Columns_0_0 + Columns_0_1 + Columns_1_0 + Columns_1_1 <= Board_1_0_0 + Board_1_0_1 + Board_1_1_0 + Board_1_1_1 + Board_0_0_0 + Board_0_0_1 + Board_0_1_0 + Board_0_1_1)))) U (3 <= Board_1_0_0 + Board_1_0_1 + Board_1_1_0 + Board_1_1_1 + Board_0_0_0 + Board_0_0_1 + Board_0_1_0 + Board_0_1_1))) : A ((X (((2 <= Columns_0_0 + Columns_0_1 + Columns_1_0 + Columns_1_1) AND (Rows_0_0 + Rows_0_1 + Rows_1_1 + Rows_1_0 <= Board_1_0_0 + Board_1_0_1 + Board_1_1_0 + Board_1_1_1 + Board_0_0_0 + Board_0_0_1 + Board_0_1_0 + Board_0_1_1))) U F (((2 <= Columns_0_0 + Columns_0_1 + Columns_1_0 + Columns_1_1) OR ((Board_1_0_0 + Board_1_0_1 + Board_1_1_0 + Board_1_1_1 + Board_0_0_0 + Board_0_0_1 + Board_0_1_0 + Board_0_1_1 <= Cells_0_0 + Cells_0_1 + Cells_1_0 + Cells_1_1) U (Rows_0_0 + Rows_0_1 + Rows_1_1 + Rows_1_0 <= Board_1_0_0 + Board_1_0_1 + Board_1_1_0 + Board_1_1_1 + Board_0_0_0 + Board_0_0_1 + Board_0_1_0 + Board_0_1_1)))))) : A ((F (X ((Board_1_0_0 + Board_1_0_1 + Board_1_1_0 + Board_1_1_1 + Board_0_0_0 + Board_0_0_1 + Board_0_1_0 + Board_0_1_1 <= Rows_0_0 + Rows_0_1 + Rows_1_1 + Rows_1_0))) OR X ((2 <= Board_1_0_0 + Board_1_0_1 + Board_1_1_0 + Board_1_1_1 + Board_0_0_0 + Board_0_0_1 + Board_0_1_0 + Board_0_1_1)))) : A (X (G (NOT(G ((((2 <= Cells_0_1) U (2 <= Columns_1_1)) OR X (X (((2 <= Cells_0_1) U (1 <= Cells_0_1)))))))))) : A ((((1 <= Columns_0_0) AND ((2 <= Board_1_0_0) U (1 <= Columns_0_0))) AND F (G (X ((2 <= Board_1_0_0)))))) : A (G (F ((((3 <= Board_1_1_0) AND X (X (F (G ((Cells_1_0 <= Rows_0_0)))))) U NOT(F ((Columns_1_0 <= Rows_0_1))))))) : A ((NOT(X (F ((Cells_1_1 <= 0)))) U NOT(((0 <= Cells_1_0) OR G ((1 <= Cells_1_0)))))) : A (((Board_1_0_1 <= Columns_1_0) AND (NOT(G ((Cells_0_0 <= Rows_0_1))) OR G (X (((Rows_0_1 <= Columns_0_0) AND (Board_1_0_1 <= Columns_1_0))))))) : A ((F ((F ((Columns_1_1 <= Cells_0_0)) U (Cells_0_1 <= Rows_0_0))) OR X (G ((F ((Columns_1_0 <= Board_0_0_1)) AND F ((Columns_0_0 <= Rows_1_1))))))) : A (X (X (((Board_0_1_0 <= Columns_1_0) AND X (G ((2 <= Rows_0_0))))))) : A (X (G (((Rows_0_1 <= Board_0_1_1) U (Rows_1_0 <= Board_1_0_1)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:374
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:145
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: 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: 100 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: 100 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: 100 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: A ((X ((G ((3 <= Board_1_0_0 + Board_1_0_1 + Board_1_1_0 + Board_1_1_1 + Board_0_0_0 + Board_0_0_1 + Board_0_1_0 + Board_0_1_1)) OR F ((Columns_0_0 + Columns_0_1 + Columns_1_0 + Columns_1_1 <= Board_1_0_0 + Board_1_0_1 + Board_1_1_0 + Board_1_1_1 + Board_0_0_0 + Board_0_0_1 + Board_0_1_0 + Board_0_1_1)))) U (3 <= Board_1_0_0 + Board_1_0_1 + Board_1_1_0 + Board_1_1_1 + Board_0_0_0 + Board_0_0_1 + B... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((G ((3 <= Board_1_0_0 + Board_1_0_1 + Board_1_1_0 + Board_1_1_1 + Board_0_0_0 + Board_0_0_1 + Board_0_1_0 + Board_0_1_1)) OR F ((Columns_0_0 + Columns_0_1 + Columns_1_0 + Columns_1_1 <= Board_1_0_0 + Board_1_0_1 + Board_1_1_0 + Board_1_1_1 + Board_0_0_0 + Board_0_0_1 + Board_0_1_0 + Board_0_1_1)))) U (3 <= Board_1_0_0 + Board_1_0_1 + Board_1_1_0 + Board_1_1_1 + Board_0_0_0 + Board_0_0_1 + B... (shortened)
lola: processed formula length: 427
lola: 100 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: 21 markings, 32 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((Board_1_0_0 + Board_1_0_1 + Board_1_1_0 + Board_1_1_1 + Board_0_0_0 + Board_0_0_1 + Board_0_1_0 + Board_0_1_1 <= Rows_0_0 + Rows_0_1 + Rows_1_1 + Rows_1_0)) OR (2 <= Board_1_0_0 + Board_1_0_1 + Board_1_1_0 + Board_1_1_1 + Board_0_0_0 + Board_0_0_1 + Board_0_1_0 + Board_0_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((Board_1_0_0 + Board_1_0_1 + Board_1_1_0 + Board_1_1_1 + Board_0_0_0 + Board_0_0_1 + Board_0_1_0 + Board_0_1_1 <= Rows_0_0 + Rows_0_1 + Rows_1_1 + Rows_1_0)) OR (2 <= Board_1_0_0 + Board_1_0_1 + Board_1_1_0 + Board_1_1_1 + Board_0_0_0 + Board_0_0_1 + Board_0_1_0 + Board_0_1_1))))
lola: processed formula length: 290
lola: 100 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: 9 markings, 8 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (G ((Cells_0_0 + Cells_0_1 + Cells_1_0 + Cells_1_1 + 1 <= Board_1_0_0 + Board_1_0_1 + Board_1_1_0 + Board_1_1_1 + Board_0_0_0 + Board_0_0_1 + Board_0_1_0 + Board_0_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (G ((Cells_0_0 + Cells_0_1 + Cells_1_0 + Cells_1_1 + 1 <= Board_1_0_0 + Board_1_0_1 + Board_1_1_0 + Board_1_1_1 + Board_0_0_0 + Board_0_0_1 + Board_0_1_0 + Board_0_1_1))))))
lola: processed formula length: 184
lola: 100 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: 12 markings, 18 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 100 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: 9 markings, 8 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((Board_1_0_1 <= Columns_1_0) AND A ((F ((Rows_0_1 + 1 <= Cells_0_0)) OR X (G (((Rows_0_1 <= Columns_0_0) AND (Board_1_0_1 <= Columns_1_0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Board_1_0_1 <= Columns_1_0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Board_1_0_1 <= Columns_1_0)
lola: processed formula length: 28
lola: 100 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((Rows_0_1 + 1 <= Cells_0_0)) OR X (G (((Rows_0_1 <= Columns_0_0) AND (Board_1_0_1 <= Columns_1_0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((Rows_0_1 + 1 <= Cells_0_0)) OR X (G (((Rows_0_1 <= Columns_0_0) AND (Board_1_0_1 <= Columns_1_0))))))
lola: processed formula length: 109
lola: 100 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: 9 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((Cells_0_1 <= Rows_0_0)) OR X (G ((F ((Columns_1_0 <= Board_0_0_1)) AND F ((Columns_0_0 <= Rows_1_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((Cells_0_1 <= Rows_0_0)) OR X (G ((F ((Columns_1_0 <= Board_0_0_1)) AND F ((Columns_0_0 <= Rows_1_1)))))))
lola: processed formula length: 113
lola: 100 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 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((X (((Board_1_0_0 + Board_1_0_1 + Board_1_1_0 + Board_1_1_1 + Board_0_0_0 + Board_0_0_1 + Board_0_1_0 + Board_0_1_1 + 1 <= Cells_0_0 + Cells_0_1 + Cells_1_0 + Cells_1_1) OR (Rows_0_0 + Rows_0_1 + Rows_1_1 + Rows_1_0 <= 0))) U (1 <= Rows_0_0 + Rows_0_1 + Rows_1_1 + Rows_1_0)) OR (F ((1 <= Rows_0_0 + Rows_0_1 + Rows_1_1 + Rows_1_0)) AND F (G ((1 <= Rows_0_0 + Rows_0_1 + Rows_1_1 + Rows_1_0))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (((X (((Board_1_0_0 + Board_1_0_1 + Board_1_1_0 + Board_1_1_1 + Board_0_0_0 + Board_0_0_1 + Board_0_1_0 + Board_0_1_1 + 1 <= Cells_0_0 + Cells_0_1 + Cells_1_0 + Cells_1_1) OR (Rows_0_0 + Rows_0_1 + Rows_1_1 + Rows_1_0 <= 0))) U (1 <= Rows_0_0 + Rows_0_1 + Rows_1_1 + Rows_1_0)) OR (F ((1 <= Rows_0_0 + Rows_0_1 + Rows_1_1 + Rows_1_0)) AND F (G ((1 <= Rows_0_0 + Rows_0_1 + Rows_1_1 + Rows_1_0))... (shortened)
lola: processed formula length: 405
lola: 100 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 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: 8 markings, 9 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((F ((Rows_1_0 <= Board_1_0_1)) AND ((Rows_0_1 <= Board_0_1_1) OR (Rows_1_0 <= Board_1_0_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((F ((Rows_1_0 <= Board_1_0_1)) AND ((Rows_0_1 <= Board_0_1_1) OR (Rows_1_0 <= Board_1_0_1))))))
lola: processed formula length: 104
lola: 100 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: 9 markings, 9 edges
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= Board_1_0_0 + Board_1_0_1 + Board_1_1_0 + Board_1_1_1 + Board_0_0_0 + Board_0_0_1 + Board_0_1_0 + Board_0_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((Board_1_0_0 + Board_1_0_1 + Board_1_1_0 + Board_1_1_1 + Board_0_0_0 + Board_0_0_1 + Board_0_1_0 + Board_0_1_1 <= 1))
lola: processed formula length: 118
lola: 102 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: 9 markings, 8 edges
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((Cells_0_1 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((Cells_0_1 <= 0))))
lola: processed formula length: 28
lola: 100 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 9 markings, 11 edges
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((Rows_0_1 + 1 <= Columns_1_0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((Rows_0_1 + 1 <= Columns_1_0))))
lola: processed formula length: 41
lola: 100 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 7 edges
lola: ========================================
lola: subprocess 14 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((Rows_0_0 + Rows_0_1 + Rows_1_1 + Rows_1_0 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((Rows_0_0 + Rows_0_1 + Rows_1_1 + Rows_1_0 <= 2))))
lola: processed formula length: 60
lola: 100 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 59 markings, 210 edges
lola: ========================================
lola: subprocess 15 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= Columns_0_0 + Columns_0_1 + Columns_1_0 + Columns_1_1) OR ((Board_1_0_0 + Board_1_0_1 + Board_1_1_0 + Board_1_1_1 + Board_0_0_0 + Board_0_0_1 + Board_0_1_0 + Board_0_1_1 <= Cells_0_0 + Cells_0_1 + Cells_1_0 + Cells_1_1) U (Rows_0_0 + Rows_0_1 + Rows_1_1 + Rows_1_0 <= Board_1_0_0 + Board_1_0_1 + Board_1_1_0 + Board_1_1_1 + Board_0_0_0 + Board_0_0_1 + Board_0_1_0 + Board_0_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((2 <= Columns_0_0 + Columns_0_1 + Columns_1_0 + Columns_1_1) OR ((Board_1_0_0 + Board_1_0_1 + Board_1_1_0 + Board_1_1_1 + Board_0_0_0 + Board_0_0_1 + Board_0_1_0 + Board_0_1_1 <= Cells_0_0 + Cells_0_1 + Cells_1_0 + Cells_1_1) U (Rows_0_0 + Rows_0_1 + Rows_1_1 + Rows_1_0 <= Board_1_0_0 + Board_1_0_1 + Board_1_1_0 + Board_1_1_1 + Board_0_0_0 + Board_0_0_1 + Board_0_1_0 + Board_0_1_1)))))
lola: processed formula length: 395
lola: 100 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes no yes no yes yes no no no no no yes no no
lola:
preliminary result: no yes yes no yes no yes yes no no no no no yes no no
lola: memory consumption: 22688 KB
lola: time consumption: 4 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1590588622546

--------------------
content from stderr:

grep: GenericPropertiesVerdict.xml: No such file or directory
grep: GenericPropertiesVerdict.xml: No such file or directory

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="Sudoku-PT-AN02"
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 Sudoku-PT-AN02, 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 r238-oct2-159033569000081"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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