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.r105-oct2-158940199700107.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 JoinFreeModules-PT-0050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-oct2-158940199700107
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 4.2K Apr 7 18:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 7 18:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 6 20:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 6 20:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 14 12:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 6 04:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 6 04:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 5 10:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 5 10:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 282K Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME JoinFreeModules-PT-0050-00
FORMULA_NAME JoinFreeModules-PT-0050-01
FORMULA_NAME JoinFreeModules-PT-0050-02
FORMULA_NAME JoinFreeModules-PT-0050-03
FORMULA_NAME JoinFreeModules-PT-0050-04
FORMULA_NAME JoinFreeModules-PT-0050-05
FORMULA_NAME JoinFreeModules-PT-0050-06
FORMULA_NAME JoinFreeModules-PT-0050-07
FORMULA_NAME JoinFreeModules-PT-0050-08
FORMULA_NAME JoinFreeModules-PT-0050-09
FORMULA_NAME JoinFreeModules-PT-0050-10
FORMULA_NAME JoinFreeModules-PT-0050-11
FORMULA_NAME JoinFreeModules-PT-0050-12
FORMULA_NAME JoinFreeModules-PT-0050-13
FORMULA_NAME JoinFreeModules-PT-0050-14
FORMULA_NAME JoinFreeModules-PT-0050-15

=== Now, execution of the tool begins

BK_START 1589722498318

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ JoinFreeModules-PT-0050 @ 3570 seconds

FORMULA JoinFreeModules-PT-0050-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0050-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0050-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0050-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0050-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0050-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0050-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0050-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0050-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0050-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0050-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0050-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0050-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0050-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0050-08 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0050-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2568
rslt: Output for LTLCardinality @ JoinFreeModules-PT-0050

{
"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": "Sun May 17 13:34:58 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": "TRUE",
"processed_size": 4,
"rewrites": 101
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"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": 101
},
"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": "TRUE",
"processed_size": 4,
"rewrites": 101
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (F (((p31 + 1 <= p194) AND (p174 <= p200)))))",
"processed_size": 50,
"rewrites": 101
},
"result":
{
"edges": 150,
"markings": 150,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"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": 3,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 317
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (F (G (((p116 <= p149)))))",
"processed_size": 28,
"rewrites": 101
},
"result":
{
"edges": 152,
"markings": 151,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 349
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(2 <= p208)",
"processed_size": 11,
"rewrites": 103
},
"result":
{
"edges": 150,
"markings": 150,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 426
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (((X (G ((p91 <= p96))) U (p76 <= p93)) OR (G ((p96 + 1 <= p91)) AND F ((p76 <= p93)))))",
"processed_size": 90,
"rewrites": 101
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 11
},
"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": 487
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 487
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"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": "((p118 <= 1) AND (p205 + 1 <= p16))",
"processed_size": 35,
"rewrites": 101
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 568
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(3 <= p42)",
"processed_size": 10,
"rewrites": 101
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 682
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A ((F (G ((p223 <= p238))) OR X (F ((p70 <= 2)))))",
"processed_size": 50,
"rewrites": 101
},
"result":
{
"edges": 101,
"markings": 102,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 853
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (F ((((p64 <= 1) R X (F ((p49 + 1 <= p200)))) AND X (G ((1 <= p160)))))))",
"processed_size": 78,
"rewrites": 101
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 12,
"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": 1137
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (((p13 <= p77) OR X (((1 <= p144) OR (F ((p49 <= p139)) U (1 <= p150))))))",
"processed_size": 76,
"rewrites": 101
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 3073
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A ((((p127 <= p60) U (p128 <= p131)) OR (((p127 <= p60) OR ((p50 <= 2) AND (3 <= p127))) AND G ((3 <= p50)))))",
"processed_size": 111,
"rewrites": 101
},
"result":
{
"edges": 150,
"markings": 150,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 24608,
"runtime": 978.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "TRUE : A(((X(G(**)) U **) OR (G(**) AND F(**)))) : A(G(F(((* R X(F(*))) AND X(G(**)))))) : (A(G((* R X(*)))) AND A(G(F(*)))) : A(F(G((F(**) AND ((** AND X(((** OR X(**)) U **))) OR **))))) : A(F(G(**))) : (A(F(G(**))) AND A(G((X(G(**)) OR G(**))))) : (A(F(*)) AND (A(X(X(**))) AND A((X(*) R *)))) : A(X(G((* OR (X(*) R *))))) : FALSE : (** AND A((** U X((** U **))))) : (** AND (A(X(F(**))) AND A(X(X(**))))) : A((F(G(**)) OR X(F(*)))) : TRUE : A(((** U **) OR (** AND G(**)))) : A((** OR X((** OR (F(**) U **)))))"
},
"net":
{
"arcs": 1152,
"conflict_clusters": 201,
"places": 251,
"places_significant": 200,
"singleton_clusters": 0,
"transitions": 401
},
"result":
{
"preliminary_value": "yes yes no no unknown unknown no no unknown no no no yes yes no no ",
"value": "yes yes no no unknown unknown no no unknown no no no 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: 652/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 8032
lola: finding significant places
lola: 251 places, 401 transitions, 200 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: A (((p42 + 1 <= p173) OR G ((0 <= p122)))) : A ((G ((p96 + 1 <= p91)) U (G (X (G ((p91 <= p96)))) U (p76 <= p93)))) : A (G (X (F ((NOT(((2 <= p64) U G (X ((p200 <= p49))))) AND G (X ((1 <= p160)))))))) : A (NOT(((3 <= p65) U F ((((p194 <= p31) U X ((2 <= p176))) OR G (((p194 <= p31) OR (p200 + 1 <= p174)))))))) : A (X (F (G ((((3 <= p49) AND X ((((1 <= p47) OR X ((2 <= p166))) U (p57 <= p42)))) U (1 <= p47)))))) : A (F ((G (X ((((p231 <= p207) OR (p21 <= p177)) AND NOT(F ((3 <= p93)))))) U F (X (G ((p154 <= p13))))))) : A (G ((G (X ((p166 <= 1))) U G (((p116 <= p149)))))) : A (NOT(((G ((2 <= p208)) OR X (NOT(X ((2 <= p208))))) OR (X ((p217 + 1 <= p112)) U (p121 <= 2))))) : A (NOT(F (X (((3 <= p200) AND (X ((p118 <= p163)) U ((p61 + 1 <= 0) U (p163 + 1 <= p118)))))))) : A (G ((p208 + 1 <= 0))) : A ((((p118 <= 1) AND (p205 + 1 <= p16)) AND (((2 <= p118) OR (p118 <= 1)) U X (((p80 + 1 <= p23) U (p23 <= p80)))))) : A ((((3 <= p42) AND F (X (F ((3 <= p42))))) AND X (X ((2 <= p30))))) : A ((F (G ((p223 <= p238))) OR X (NOT(G ((3 <= p70)))))) : A (F (NOT(G (X (NOT(F (G (F ((0 <= p225)))))))))) : A ((((p127 <= p60) U (p128 <= p131)) OR (((p127 <= p60) OR ((p50 <= 2) AND (3 <= p127))) AND G ((3 <= p50))))) : A ((((p13 <= p77) OR X ((1 <= p144))) OR (NOT(G (NOT(X ((p49 <= p139))))) U X ((1 <= p150)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:154
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 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: 101 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 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: 101 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 101 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 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((p31 + 1 <= p194) R X ((p176 <= 1))))) AND A (G (F (((p31 + 1 <= p194) AND (p174 <= p200))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (((p31 + 1 <= p194) AND (p174 <= p200)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((p31 + 1 <= p194) AND (p174 <= p200)))))
lola: processed formula length: 50
lola: 101 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: 150 markings, 150 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((F ((1 <= p47)) AND (((3 <= p49) AND X ((((1 <= p47) OR X ((2 <= p166))) U (p57 <= p42)))) OR (1 <= p47))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F ((1 <= p47)) AND (((3 <= p49) AND X ((((1 <= p47) OR X ((2 <= p166))) U (p57 <= p42)))) OR (1 <= p47))))))
lola: processed formula length: 118
lola: 101 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1893164 markings, 2531333 edges, 378633 markings/sec, 0 secs
lola: 3778244 markings, 5052285 edges, 377016 markings/sec, 5 secs
lola: 5658612 markings, 7566773 edges, 376074 markings/sec, 10 secs
lola: 7543996 markings, 10088737 edges, 377077 markings/sec, 15 secs
lola: 9391251 markings, 12559971 edges, 369451 markings/sec, 20 secs
lola: 11241632 markings, 15034868 edges, 370076 markings/sec, 25 secs
lola: 13095855 markings, 17514517 edges, 370845 markings/sec, 30 secs
lola: 14954751 markings, 20000918 edges, 371779 markings/sec, 35 secs
lola: 16811326 markings, 22484557 edges, 371315 markings/sec, 40 secs
lola: 18637098 markings, 24925979 edges, 365154 markings/sec, 45 secs
lola: 20487161 markings, 27400555 edges, 370013 markings/sec, 50 secs
lola: 22312736 markings, 29843106 edges, 365115 markings/sec, 55 secs
lola: 24148646 markings, 32298400 edges, 367182 markings/sec, 60 secs
lola: 25982591 markings, 34750862 edges, 366789 markings/sec, 65 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 317 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (G (((p116 <= p149))))) AND A (G ((X (G ((p166 <= 1))) OR G (((p116 <= p149)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 317 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (((p116 <= p149)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (((p116 <= p149)))))
lola: processed formula length: 28
lola: 101 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: 151 markings, 152 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((p208 <= 1))) AND (A (X (X ((2 <= p208)))) AND A ((X ((p112 <= p217)) R (3 <= p121)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p208 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (2 <= p208)
lola: processed formula length: 11
lola: 103 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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 150 markings, 150 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 387 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G (((p200 <= 2) OR (X ((p163 + 1 <= p118)) R (p118 <= p163))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((p200 <= 2) OR (X ((p163 + 1 <= p118)) R (p118 <= p163))))))
lola: processed formula length: 70
lola: 101 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: 1782752 markings, 2383674 edges, 356550 markings/sec, 0 secs
lola: 3623353 markings, 4845500 edges, 368120 markings/sec, 5 secs
lola: 5503254 markings, 7358960 edges, 375980 markings/sec, 10 secs
lola: 7398518 markings, 9894244 edges, 379053 markings/sec, 15 secs
lola: 9283207 markings, 12415587 edges, 376938 markings/sec, 20 secs
lola: 11161702 markings, 14928135 edges, 375699 markings/sec, 25 secs
lola: 13042601 markings, 17443020 edges, 376180 markings/sec, 30 secs
lola: 14919569 markings, 19953767 edges, 375394 markings/sec, 35 secs
lola: 16794738 markings, 22462252 edges, 375034 markings/sec, 40 secs
lola: 18646349 markings, 24938856 edges, 370322 markings/sec, 45 secs
lola: 20521520 markings, 27446528 edges, 375034 markings/sec, 50 secs
lola: 22374699 markings, 29925662 edges, 370636 markings/sec, 55 secs
lola: 24235084 markings, 32413718 edges, 372077 markings/sec, 60 secs
lola: 26098303 markings, 34905475 edges, 372644 markings/sec, 65 secs
lola: 27366144 markings, 36601789 edges, 253568 markings/sec, 70 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 426 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((X (G ((p91 <= p96))) U (p76 <= p93)) OR (G ((p96 + 1 <= p91)) AND F ((p76 <= p93)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((X (G ((p91 <= p96))) U (p76 <= p93)) OR (G ((p96 + 1 <= p91)) AND F ((p76 <= p93)))))
lola: processed formula length: 90
lola: 101 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 11 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 487 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p118 <= 1) AND (p205 + 1 <= p16)) AND A ((((2 <= p118) OR (p118 <= 1)) U X (((p80 + 1 <= p23) U (p23 <= p80))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 487 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p118 <= 1) AND (p205 + 1 <= p16))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p118 <= 1) AND (p205 + 1 <= p16))
lola: processed formula length: 35
lola: 101 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 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 10 will run for 568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((3 <= p42) AND (A (X (F ((3 <= p42)))) AND A (X (X ((2 <= p30))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p42)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p42)
lola: processed formula length: 10
lola: 101 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 11 will run for 682 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F (G ((p223 <= p238))) OR X (F ((p70 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (G ((p223 <= p238))) OR X (F ((p70 <= 2)))))
lola: processed formula length: 50
lola: 101 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: 102 markings, 101 edges
lola: ========================================
lola: subprocess 12 will run for 853 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((((p64 <= 1) R X (F ((p49 + 1 <= p200)))) AND X (G ((1 <= p160)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((((p64 <= 1) R X (F ((p49 + 1 <= p200)))) AND X (G ((1 <= p160)))))))
lola: processed formula length: 78
lola: 101 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 13 will run for 1137 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p13 <= p77) OR X (((1 <= p144) OR (F ((p49 <= p139)) U (1 <= p150))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p13 <= p77) OR X (((1 <= p144) OR (F ((p49 <= p139)) U (1 <= p150))))))
lola: processed formula length: 76
lola: 101 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 14 will run for 1706 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((p154 <= p13))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p154 <= p13))))
lola: processed formula length: 25
lola: 101 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: 1572666 markings, 2717754 edges, 314533 markings/sec, 0 secs
lola: 3115115 markings, 5383548 edges, 308490 markings/sec, 5 secs
lola: 4637518 markings, 8014759 edges, 304481 markings/sec, 10 secs
lola: 6160839 markings, 10647444 edges, 304664 markings/sec, 15 secs
lola: 7671536 markings, 13258406 edges, 302139 markings/sec, 20 secs
lola: 9209420 markings, 15916220 edges, 307577 markings/sec, 25 secs
lola: 10728569 markings, 18541734 edges, 303830 markings/sec, 30 secs
lola: 12221830 markings, 21122568 edges, 298652 markings/sec, 35 secs
lola: 13701153 markings, 23679281 edges, 295865 markings/sec, 40 secs
lola: 15184899 markings, 26243583 edges, 296749 markings/sec, 45 secs
lola: 16689120 markings, 28843273 edges, 300844 markings/sec, 50 secs
lola: 18195814 markings, 31447283 edges, 301339 markings/sec, 55 secs
lola: 19662750 markings, 33982559 edges, 293387 markings/sec, 60 secs
lola: 21126800 markings, 36512882 edges, 292810 markings/sec, 65 secs
lola: 22646235 markings, 39138921 edges, 303887 markings/sec, 70 secs
lola: 24161810 markings, 41758251 edges, 303115 markings/sec, 75 secs
lola: 25689442 markings, 44398481 edges, 305526 markings/sec, 80 secs
lola: 27187936 markings, 46988317 edges, 299699 markings/sec, 85 secs
lola: 28657409 markings, 49527933 edges, 293895 markings/sec, 90 secs
lola: 30171098 markings, 52144067 edges, 302738 markings/sec, 95 secs
lola: 31669033 markings, 54732893 edges, 299587 markings/sec, 100 secs
lola: 33154202 markings, 57299736 edges, 297034 markings/sec, 105 secs
lola: 34627500 markings, 59845999 edges, 294660 markings/sec, 110 secs
lola: 36073372 markings, 62344830 edges, 289174 markings/sec, 115 secs
lola: 37569976 markings, 64931386 edges, 299321 markings/sec, 120 secs
lola: 39028512 markings, 67452179 edges, 291707 markings/sec, 125 secs
lola: 40480916 markings, 69962289 edges, 290481 markings/sec, 130 secs
lola: 41910260 markings, 72432619 edges, 285869 markings/sec, 135 secs
lola: 43306843 markings, 74846377 edges, 279317 markings/sec, 140 secs
lola: 44843099 markings, 77501423 edges, 307251 markings/sec, 145 secs
lola: 46358677 markings, 80120738 edges, 303116 markings/sec, 150 secs
lola: 47853840 markings, 82704841 edges, 299033 markings/sec, 155 secs
lola: 49339141 markings, 85271848 edges, 297060 markings/sec, 160 secs
lola: 50807814 markings, 87810196 edges, 293735 markings/sec, 165 secs
lola: 52306206 markings, 90399884 edges, 299678 markings/sec, 170 secs
lola: 53784947 markings, 92955431 edges, 295748 markings/sec, 175 secs
lola: 55247531 markings, 95483200 edges, 292517 markings/sec, 180 secs
lola: 56702422 markings, 97997757 edges, 290978 markings/sec, 185 secs
lola: 58136505 markings, 100476191 edges, 286817 markings/sec, 190 secs
lola: 59601199 markings, 103007693 edges, 292939 markings/sec, 195 secs
lola: 61054933 markings, 105520087 edges, 290747 markings/sec, 200 secs
lola: 62480441 markings, 107983723 edges, 285102 markings/sec, 205 secs
lola: 63910986 markings, 110456117 edges, 286109 markings/sec, 210 secs
lola: 65355086 markings, 112952018 edges, 288820 markings/sec, 215 secs
lola: 66894270 markings, 115612158 edges, 307837 markings/sec, 220 secs
lola: 68419699 markings, 118248515 edges, 305086 markings/sec, 225 secs
lola: 69918270 markings, 120838539 edges, 299714 markings/sec, 230 secs
lola: 71402640 markings, 123403844 edges, 296874 markings/sec, 235 secs
lola: 72896609 markings, 125985862 edges, 298794 markings/sec, 240 secs
lola: 74408061 markings, 128598147 edges, 302290 markings/sec, 245 secs
lola: 75915840 markings, 131204038 edges, 301556 markings/sec, 250 secs
lola: 77390858 markings, 133753170 edges, 295004 markings/sec, 255 secs
lola: 78858691 markings, 136290069 edges, 293567 markings/sec, 260 secs
lola: 80343146 markings, 138855580 edges, 296891 markings/sec, 265 secs
lola: 81807241 markings, 141386047 edges, 292819 markings/sec, 270 secs
lola: 83283202 markings, 143936933 edges, 295192 markings/sec, 275 secs
lola: 84731208 markings, 146439424 edges, 289601 markings/sec, 280 secs
lola: 86182061 markings, 148946991 edges, 290171 markings/sec, 285 secs
lola: 87708474 markings, 151585006 edges, 305283 markings/sec, 290 secs
lola: 89238562 markings, 154229480 edges, 306018 markings/sec, 295 secs
lola: 90765852 markings, 156868995 edges, 305458 markings/sec, 300 secs
lola: 92266349 markings, 159462391 edges, 300099 markings/sec, 305 secs
lola: 93745875 markings, 162019371 edges, 295905 markings/sec, 310 secs
lola: 95284120 markings, 164677923 edges, 307649 markings/sec, 315 secs
lola: 96791620 markings, 167283254 edges, 301500 markings/sec, 320 secs
lola: 98282092 markings, 169859228 edges, 298094 markings/sec, 325 secs
lola: 99781885 markings, 172451352 edges, 299959 markings/sec, 330 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 3073 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p127 <= p60) U (p128 <= p131)) OR (((p127 <= p60) OR ((p50 <= 2) AND (3 <= p127))) AND G ((3 <= p50)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((p127 <= p60) U (p128 <= p131)) OR (((p127 <= p60) OR ((p50 <= 2) AND (3 <= p127))) AND G ((3 <= p50)))))
lola: processed formula length: 111
lola: 101 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: 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: 150 markings, 150 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (G ((F ((1 <= p47)) AND (((3 <= p49) AND X ((((1 <= p47) OR X ((2 <= p166))) U (p57 <= p42)))) OR (1 <= p47))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F ((1 <= p47)) AND (((3 <= p49) AND X ((((1 <= p47) OR X ((2 <= p166))) U (p57 <= p42)))) OR (1 <= p47))))))
lola: processed formula length: 118
lola: 101 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1998362 markings, 2671586 edges, 399672 markings/sec, 0 secs
lola: 4000534 markings, 5349769 edges, 400434 markings/sec, 5 secs
lola: 6015157 markings, 8044320 edges, 402925 markings/sec, 10 secs
lola: 7968766 markings, 10657580 edges, 390722 markings/sec, 15 secs
lola: 9864689 markings, 13192729 edges, 379185 markings/sec, 20 secs
lola: 11756352 markings, 15722919 edges, 378333 markings/sec, 25 secs
lola: 13607345 markings, 18199235 edges, 370199 markings/sec, 30 secs
lola: 15456681 markings, 20672846 edges, 369867 markings/sec, 35 secs
lola: 17289857 markings, 23124014 edges, 366635 markings/sec, 40 secs
lola: 19118395 markings, 25570250 edges, 365708 markings/sec, 45 secs
lola: 20951629 markings, 28022110 edges, 366647 markings/sec, 50 secs
lola: 22773301 markings, 30458255 edges, 364334 markings/sec, 55 secs
lola: 24594892 markings, 32894719 edges, 364318 markings/sec, 60 secs
lola: 26433741 markings, 35354635 edges, 367770 markings/sec, 65 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (X (G (((p200 <= 2) OR (X ((p163 + 1 <= p118)) R (p118 <= p163))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((p200 <= 2) OR (X ((p163 + 1 <= p118)) R (p118 <= p163))))))
lola: processed formula length: 70
lola: 101 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: 1867289 markings, 2496490 edges, 373458 markings/sec, 0 secs
lola: 3738960 markings, 4999778 edges, 374334 markings/sec, 5 secs
lola: 5596946 markings, 7484448 edges, 371597 markings/sec, 10 secs
lola: 7501891 markings, 10032621 edges, 380989 markings/sec, 15 secs
lola: 9405871 markings, 12579782 edges, 380796 markings/sec, 20 secs
lola: 11308687 markings, 15124508 edges, 380563 markings/sec, 25 secs
lola: 13216815 markings, 17676202 edges, 381626 markings/sec, 30 secs
lola: 15135301 markings, 20242439 edges, 383697 markings/sec, 35 secs
lola: 17050612 markings, 22804217 edges, 383062 markings/sec, 40 secs
lola: 18953405 markings, 25349538 edges, 380559 markings/sec, 45 secs
lola: 20860984 markings, 27901096 edges, 381516 markings/sec, 50 secs
lola: 22758045 markings, 30437851 edges, 379412 markings/sec, 55 secs
lola: 24654682 markings, 32974735 edges, 379327 markings/sec, 60 secs
lola: 26560208 markings, 35524121 edges, 381105 markings/sec, 65 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (F (G ((p154 <= p13))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p154 <= p13))))
lola: processed formula length: 25
lola: 101 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: 1564112 markings, 2703077 edges, 312822 markings/sec, 0 secs
lola: 3141106 markings, 5428558 edges, 315399 markings/sec, 5 secs
lola: 4691519 markings, 8108061 edges, 310083 markings/sec, 10 secs
lola: 6250033 markings, 10801618 edges, 311703 markings/sec, 15 secs
lola: 7805387 markings, 13489751 edges, 311071 markings/sec, 20 secs
lola: 9368241 markings, 16190735 edges, 312571 markings/sec, 25 secs
lola: 10924692 markings, 18880737 edges, 311290 markings/sec, 30 secs
lola: 12446447 markings, 21510798 edges, 304351 markings/sec, 35 secs
lola: 13923692 markings, 24063949 edges, 295449 markings/sec, 40 secs
lola: 15456977 markings, 26713802 edges, 306657 markings/sec, 45 secs
lola: 16988820 markings, 29361221 edges, 306369 markings/sec, 50 secs
lola: 18520834 markings, 32009126 edges, 306403 markings/sec, 55 secs
lola: 20024353 markings, 34607602 edges, 300704 markings/sec, 60 secs
lola: 21509983 markings, 37175105 edges, 297126 markings/sec, 65 secs
lola: 23085914 markings, 39898852 edges, 315186 markings/sec, 70 secs
lola: 24641955 markings, 42588046 edges, 311208 markings/sec, 75 secs
lola: 26191186 markings, 45265563 edges, 309846 markings/sec, 80 secs
lola: 27723824 markings, 47914473 edges, 306528 markings/sec, 85 secs
lola: 29217026 markings, 50495099 edges, 298640 markings/sec, 90 secs
lola: 30750304 markings, 53145108 edges, 306656 markings/sec, 95 secs
lola: 32278073 markings, 55785420 edges, 305554 markings/sec, 100 secs
lola: 33768466 markings, 58361270 edges, 298079 markings/sec, 105 secs
lola: 35270618 markings, 60957407 edges, 300430 markings/sec, 110 secs
lola: 36773572 markings, 63554953 edges, 300591 markings/sec, 115 secs
lola: 38271990 markings, 66144644 edges, 299684 markings/sec, 120 secs
lola: 39769423 markings, 68732719 edges, 299487 markings/sec, 125 secs
lola: 41223023 markings, 71244850 edges, 290720 markings/sec, 130 secs
lola: 42659700 markings, 73727886 edges, 287335 markings/sec, 135 secs
lola: 44136202 markings, 76279698 edges, 295300 markings/sec, 140 secs
lola: 45650963 markings, 78897645 edges, 302952 markings/sec, 145 secs
lola: 47182873 markings, 81545172 edges, 306382 markings/sec, 150 secs
lola: 48687651 markings, 84145871 edges, 300956 markings/sec, 155 secs
lola: 50170896 markings, 86709370 edges, 296649 markings/sec, 160 secs
lola: 51689243 markings, 89333572 edges, 303669 markings/sec, 165 secs
lola: 53183441 markings, 91915923 edges, 298840 markings/sec, 170 secs
lola: 54684072 markings, 94509402 edges, 300126 markings/sec, 175 secs
lola: 56159302 markings, 97059025 edges, 295046 markings/sec, 180 secs
lola: 57605056 markings, 99557738 edges, 289151 markings/sec, 185 secs
lola: 59100189 markings, 102141703 edges, 299027 markings/sec, 190 secs
lola: 60571864 markings, 104685256 edges, 294335 markings/sec, 195 secs
lola: 62010840 markings, 107172209 edges, 287795 markings/sec, 200 secs
lola: 63451456 markings, 109661988 edges, 288123 markings/sec, 205 secs
lola: 64872090 markings, 112117240 edges, 284127 markings/sec, 210 secs
lola: 66443459 markings, 114832984 edges, 314274 markings/sec, 215 secs
lola: 67984604 markings, 117496537 edges, 308229 markings/sec, 220 secs
lola: 69487054 markings, 120093150 edges, 300490 markings/sec, 225 secs
lola: 70965221 markings, 122647878 edges, 295633 markings/sec, 230 secs
lola: 72440661 markings, 125197852 edges, 295088 markings/sec, 235 secs
lola: 73984743 markings, 127866495 edges, 308816 markings/sec, 240 secs
lola: 75510526 markings, 130503486 edges, 305157 markings/sec, 245 secs
lola: 77005502 markings, 133087266 edges, 298995 markings/sec, 250 secs
lola: 78505697 markings, 135680043 edges, 300039 markings/sec, 255 secs
lola: 80016194 markings, 138290580 edges, 302099 markings/sec, 260 secs
lola: 81512711 markings, 140877024 edges, 299303 markings/sec, 265 secs
lola: 83009106 markings, 143463180 edges, 299279 markings/sec, 270 secs
lola: 84474487 markings, 145995807 edges, 293076 markings/sec, 275 secs
lola: 85924940 markings, 148502523 edges, 290091 markings/sec, 280 secs
lola: 87415568 markings, 151078805 edges, 298126 markings/sec, 285 secs
lola: 88902526 markings, 153648735 edges, 297392 markings/sec, 290 secs
lola: 90408697 markings, 156251791 edges, 301234 markings/sec, 295 secs
lola: 91896895 markings, 158823852 edges, 297640 markings/sec, 300 secs
lola: 93386724 markings, 161398678 edges, 297966 markings/sec, 305 secs
lola: 94941401 markings, 164085543 edges, 310935 markings/sec, 310 secs
lola: 96398884 markings, 166604523 edges, 291497 markings/sec, 315 secs
lola: 97860436 markings, 169130456 edges, 292310 markings/sec, 320 secs
lola: 99302420 markings, 171622646 edges, 288397 markings/sec, 325 secs
lola: 100712945 markings, 174061357 edges, 282105 markings/sec, 330 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes yes no no unknown unknown no no unknown no no no yes yes no no
lola:
preliminary result: yes yes no no unknown unknown no no unknown no no no yes yes no no
lola: memory consumption: 24608 KB
lola: time consumption: 978 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1589723500210

--------------------
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="JoinFreeModules-PT-0050"
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 JoinFreeModules-PT-0050, 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 r105-oct2-158940199700107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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