About the Execution of LoLA for PolyORBLF-COL-S06J04T08
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4652.590 | 582380.00 | 592733.00 | 1150.00 | FTTFFFFFFFFTFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2019-input.r115-smll-155272315700213.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-3957
Executing tool lola
Input is PolyORBLF-COL-S06J04T08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r115-smll-155272315700213
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 4.2K Feb 12 09:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 12 09:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 8 09:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 8 09:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 110 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 348 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.8K Feb 5 00:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 5 00:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.1K Feb 4 22:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Feb 4 12:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 4 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 1 08:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 1 08:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_pt
-rw-r--r-- 1 mcc users 10 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 154K Mar 10 17:31 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 PolyORBLF-COL-S06J04T08-LTLCardinality-00
FORMULA_NAME PolyORBLF-COL-S06J04T08-LTLCardinality-01
FORMULA_NAME PolyORBLF-COL-S06J04T08-LTLCardinality-02
FORMULA_NAME PolyORBLF-COL-S06J04T08-LTLCardinality-03
FORMULA_NAME PolyORBLF-COL-S06J04T08-LTLCardinality-04
FORMULA_NAME PolyORBLF-COL-S06J04T08-LTLCardinality-05
FORMULA_NAME PolyORBLF-COL-S06J04T08-LTLCardinality-06
FORMULA_NAME PolyORBLF-COL-S06J04T08-LTLCardinality-07
FORMULA_NAME PolyORBLF-COL-S06J04T08-LTLCardinality-08
FORMULA_NAME PolyORBLF-COL-S06J04T08-LTLCardinality-09
FORMULA_NAME PolyORBLF-COL-S06J04T08-LTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S06J04T08-LTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S06J04T08-LTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S06J04T08-LTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S06J04T08-LTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S06J04T08-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1552996858749
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ PolyORBLF-COL-S06J04T08 @ 3570 seconds
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2987
rslt: Output for LTLCardinality @ PolyORBLF-COL-S06J04T08
{
"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": "Tue Mar 19 12:00:58 2019
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 208
},
"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": 28
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"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": 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": "(p30 <= p528)",
"processed_size": 13,
"rewrites": 28
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 238
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "A (X ((p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 <= p184)))",
"processed_size": 71,
"rewrites": 28
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 256
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "A (X (((3 <= p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198) U X ((3 <= p583)))))",
"processed_size": 88,
"rewrites": 28
},
"result":
{
"edges": 37,
"markings": 37,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 278
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "A (X (X (F ((1 <= p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))))",
"processed_size": 68,
"rewrites": 28
},
"result":
{
"edges": 37,
"markings": 37,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 303
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "A (G ((p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15)))",
"processed_size": 110,
"rewrites": 30
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 333
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "(p95 + p94 + p93 + p92 + p91 + p90 + p89 + p96 <= 0)",
"processed_size": 52,
"rewrites": 30
},
"result":
{
"edges": 5616228,
"markings": 1955554,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 16
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 333
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "(p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 <= 1)",
"processed_size": 60,
"rewrites": 30
},
"result":
{
"edges": 435,
"markings": 435,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 24
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 375
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 49,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 49,
"visible_transitions": 0
},
"processed": "(p584 + p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p594 + p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612 + p613 + p614 + p615 + p616 + p617 + p618 + p619 + p620 + p621 + p622 + p623 + p624 + p625 + p626 + p627 + p628 + p629 + p630 + p631 + 1 <= p208)",
"processed_size": 347,
"rewrites": 30
},
"result":
{
"edges": 366,
"markings": 366,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 368
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 429
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G (F ((2 <= p663))))",
"processed_size": 23,
"rewrites": 28
},
"result":
{
"edges": 435,
"markings": 435,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"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": 500
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "A (F ((F ((2 <= p698)) OR (G ((1 <= p689 + p690 + p691 + p692 + p693 + p694 + p695 + p696)) AND F ((2 <= p698))))))",
"processed_size": 115,
"rewrites": 28
},
"result":
{
"edges": 435,
"markings": 435,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 10,
"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": 600
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "A (((p320 + p319 + p318 + p317 + p316 + p315 + p314 + p313 <= p528) OR (F ((p320 + p319 + p318 + p317 + p316 + p315 + p314 + p313 <= p528)) AND F (G ((p30 <= p387))))))",
"processed_size": 168,
"rewrites": 28
},
"result":
{
"edges": 435,
"markings": 435,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 11,
"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": 750
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "A (((1 <= p715 + p716 + p717 + p718 + p719 + p720 + p721 + p722) OR (F ((1 <= p715 + p716 + p717 + p718 + p719 + p720 + p721 + p722)) AND F (G ((2 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15))))))",
"processed_size": 199,
"rewrites": 28
},
"result":
{
"edges": 435,
"markings": 435,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 1000
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 25,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 17,
"visible_transitions": 0
},
"processed": "A ((((3 <= p346) U (3 <= p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647)) OR (G (F ((2 <= p95 + p94 + p93 + p92 + p91 + p90 + p89 + p96))) AND F ((3 <= p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647)))))",
"processed_size": 217,
"rewrites": 28
},
"result":
{
"edges": 435,
"markings": 435,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 1500
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 56,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 56,
"visible_transitions": 0
},
"processed": "A (F (G ((p673 + p674 + p675 + p676 + p677 + p678 + p679 + p680 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p97 + p98 + p99))))",
"processed_size": 401,
"rewrites": 28
},
"result":
{
"edges": 11761,
"markings": 9163,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2987
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 168,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 112,
"visible_transitions": 0
},
"processed": "A (((p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 + p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 <= p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29) OR (G ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p97 + p98 + p99 <= p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337)) AND F ((p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 + p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 <= p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))))",
"processed_size": 1182,
"rewrites": 28
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 406596,
"runtime": 583.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(F(G(**))) : A((** OR (G(**) AND F(**)))) : A(X(**)) : A(X((** U X(**)))) : A(G(F(**))) : A(G(**)) : A((** OR (F(**) AND F(G(**))))) : A((** OR (F(**) AND F(G(**))))) : A(F((F(**) OR (G(**) AND F(**))))) : FALSE : A(F(**)) : ** : A(X(X(F(**)))) : A(F(**)) : A(((** U **) OR (G(F(**)) AND F(**)))) : A(F(**))"
},
"net":
{
"arcs": 118428,
"conflict_clusters": 307,
"places": 810,
"places_significant": 752,
"singleton_clusters": 0,
"transitions": 14014
},
"result":
{
"preliminary_value": "no yes yes no no no no no no no no yes no no no no ",
"value": "no yes yes no no no no no no no no yes no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains High-Level net
lola: Places: 810, Transitions: 14014
lola: @ trans T_2280
lola: @ trans T_2285
lola: @ trans T_2577
lola: @ trans T_1115
lola: @ trans T_2541
lola: @ trans T_1713
lola: @ trans T_1730
lola: @ trans DummyOR1
lola: @ trans T_1098
lola: @ trans T_1124
lola: @ trans GoIdle
lola: @ trans EnterCSPW
lola: @ trans NOPDP
lola: @ trans LeaveCSIS
lola: @ trans NotifyEventJobCompleted
lola: @ trans T_1618
lola: @ trans LeaveCSTCS
lola: @ trans T_1126
lola: @ trans T_1100
lola: @ trans WaitCompleted
lola: @ trans T_1729
lola: @ trans T_2311
lola: @ trans LeaveCSPW
lola: @ trans DummyIS
lola: @ trans T_1444
lola: @ trans NoCheck
lola: @ trans T_1711
lola: @ trans GoCheckSource
lola: @ trans T_1721
lola: @ trans NoMonitoring
lola: @ trans T_1147
lola: @ trans T_1171
lola: @ trans NopAbort
lola: @ trans SetSigAbort
lola: @ trans T_2283
lola: @ trans NeedMonitoring
lola: @ trans T_1170
lola: @ trans T_1123
lola: @ trans IsAbort
lola: @ trans DummyOR2
lola: @ trans LeaveIdle
lola: @ trans T_0383
lola: @ trans WillPerformWork
lola: @ trans T_1114
lola: @ trans T_1146
lola: @ trans NOPEP
lola: @ trans T_2296
lola: @ trans EnterCSIS
lola: @ trans T_1145
lola: @ trans EnterCSTCS
lola: @ trans T_2317
lola: @ trans WaitforBlockedTasks
lola: @ trans GoPerformWork
lola: @ trans T_2294
lola: @ trans NotifyEventSourceAdded
lola: @ trans T_1722
lola: @ trans Run
lola: @ trans T_1094
lola: @ trans IsEvt
lola: @ trans T_1148
lola: @ trans T_1096
lola: @ trans T_1125
lola: @ trans T_2578
lola: @ trans T_0376
lola: @ trans T_2315
lola: finished unfolding
lola: finished parsing
lola: closed net file model.pnml
lola: 14824/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 25920
lola: finding significant places
lola: 810 places, 14014 transitions, 752 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: LP says that atomic proposition is always false: (3 <= p32)
lola: LP says that atomic proposition is always false: (3 <= p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256)
lola: A (X (F (G (X ((p673 + p674 + p675 + p676 + p677 + p678 + p679 + p680 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p97 + p98 + p99)))))) : A ((G (G ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p97 + p98 + p99 <= p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337))) U (p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 + p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 <= p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29))) : A (X ((p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 <= p184))) : A (X (((3 <= p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198) U X ((3 <= p583))))) : A (X (G (F ((2 <= p663))))) : A (G (G (((3 <= p32) U (p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15))))) : A ((F (G ((2 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15))) U (1 <= p715 + p716 + p717 + p718 + p719 + p720 + p721 + p722))) : A ((F (G ((p30 <= p387))) U (p320 + p319 + p318 + p317 + p316 + p315 + p314 + p313 <= p528))) : A (F ((G ((1 <= p689 + p690 + p691 + p692 + p693 + p694 + p695 + p696)) U F ((2 <= p698))))) : A (G (G (F (X ((3 <= p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256)))))) : A (F ((1 <= p95 + p94 + p93 + p92 + p91 + p90 + p89 + p96))) : A ((p30 <= p528)) : A (X (F (X (F ((1 <= p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))))) : A (F (((3 <= p632 + p633 + p634 + p635 + p636 + p637 + p638 + p639) U (p208 <= p584 + p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p594 + p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612 + p613 + p614 + p615 + p616 + p617 + p618 + p619 + p620 + p621 + p622 + p623 + p624 + p625 + p626 + p627 + p628 + p629 + p630 + p631)))) : A ((G (F ((2 <= p95 + p94 + p93 + p92 + p91 + p90 + p89 + p96))) U ((3 <= p346) U (3 <= p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647)))) : A (F (F (((p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 <= p772 + p773 + p774 + p775 + p776 + p778 + p779 + p780 + p781 + p782 + p784 + p785 + p786 + p787 + p788 + p790 + p791 + p792 + p793 + p794 + p796 + p797 + p798 + p799 + p800 + p801 + p795 + p789 + p783 + p777) U (2 <= p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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:350
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 208 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: 28 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 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p30 <= p528)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p30 <= p528)
lola: processed formula length: 13
lola: 28 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 2 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 <= p184)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 <= p184)))
lola: processed formula length: 71
lola: 28 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: 7 markings, 6 edges
lola: ========================================
lola: subprocess 3 will run for 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((3 <= p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198) U X ((3 <= p583)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((3 <= p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198) U X ((3 <= p583)))))
lola: processed formula length: 88
lola: 28 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: 37 markings, 37 edges
lola: ========================================
lola: subprocess 4 will run for 278 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((1 <= p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((1 <= p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))))
lola: processed formula length: 68
lola: 28 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: 37 markings, 37 edges
lola: ========================================
lola: subprocess 5 will run for 303 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15)))
lola: processed formula length: 110
lola: 30 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + 1 <= p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 6 will run for 333 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p95 + p94 + p93 + p92 + p91 + p90 + p89 + p96)))
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: (p95 + p94 + p93 + p92 + p91 + p90 + p89 + p96 <= 0)
lola: processed formula length: 52
lola: 30 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: 22458 markings, 48807 edges, 4492 markings/sec, 0 secs
lola: 49563 markings, 109513 edges, 5421 markings/sec, 5 secs
lola: 75265 markings, 168375 edges, 5140 markings/sec, 10 secs
lola: 97826 markings, 224234 edges, 4512 markings/sec, 15 secs
lola: 139223 markings, 334803 edges, 8279 markings/sec, 20 secs
lola: 171419 markings, 426815 edges, 6439 markings/sec, 25 secs
lola: 203349 markings, 515269 edges, 6386 markings/sec, 30 secs
lola: 239671 markings, 614109 edges, 7264 markings/sec, 35 secs
lola: 264587 markings, 689100 edges, 4983 markings/sec, 40 secs
lola: 297199 markings, 777514 edges, 6522 markings/sec, 45 secs
lola: 329465 markings, 865104 edges, 6453 markings/sec, 50 secs
lola: 364539 markings, 961734 edges, 7015 markings/sec, 55 secs
lola: 399784 markings, 1060998 edges, 7049 markings/sec, 60 secs
lola: 427835 markings, 1143492 edges, 5610 markings/sec, 65 secs
lola: 449880 markings, 1224326 edges, 4409 markings/sec, 70 secs
lola: 488490 markings, 1329574 edges, 7722 markings/sec, 75 secs
lola: 519718 markings, 1417241 edges, 6246 markings/sec, 80 secs
lola: 551049 markings, 1505612 edges, 6266 markings/sec, 85 secs
lola: 584745 markings, 1599132 edges, 6739 markings/sec, 90 secs
lola: 613484 markings, 1681132 edges, 5748 markings/sec, 95 secs
lola: 643691 markings, 1765428 edges, 6041 markings/sec, 100 secs
lola: 676597 markings, 1854633 edges, 6581 markings/sec, 105 secs
lola: 704015 markings, 1933282 edges, 5484 markings/sec, 110 secs
lola: 744291 markings, 2042605 edges, 8055 markings/sec, 115 secs
lola: 775805 markings, 2133528 edges, 6303 markings/sec, 120 secs
lola: 799099 markings, 2215034 edges, 4659 markings/sec, 125 secs
lola: 836094 markings, 2317124 edges, 7399 markings/sec, 130 secs
lola: 867377 markings, 2406139 edges, 6257 markings/sec, 135 secs
lola: 894658 markings, 2485058 edges, 5456 markings/sec, 140 secs
lola: 928459 markings, 2576868 edges, 6760 markings/sec, 145 secs
lola: 956569 markings, 2655782 edges, 5622 markings/sec, 150 secs
lola: 984812 markings, 2735877 edges, 5649 markings/sec, 155 secs
lola: 1013403 markings, 2813848 edges, 5718 markings/sec, 160 secs
lola: 1042654 markings, 2893738 edges, 5850 markings/sec, 165 secs
lola: 1073447 markings, 2983205 edges, 6159 markings/sec, 170 secs
lola: 1105949 markings, 3073400 edges, 6500 markings/sec, 175 secs
lola: 1134279 markings, 3154466 edges, 5666 markings/sec, 180 secs
lola: 1155285 markings, 3233333 edges, 4201 markings/sec, 185 secs
lola: 1187402 markings, 3320351 edges, 6423 markings/sec, 190 secs
lola: 1218515 markings, 3405149 edges, 6223 markings/sec, 195 secs
lola: 1247899 markings, 3490504 edges, 5877 markings/sec, 200 secs
lola: 1278830 markings, 3575004 edges, 6186 markings/sec, 205 secs
lola: 1306907 markings, 3653018 edges, 5615 markings/sec, 210 secs
lola: 1334589 markings, 3732601 edges, 5536 markings/sec, 215 secs
lola: 1363580 markings, 3810897 edges, 5798 markings/sec, 220 secs
lola: 1392801 markings, 3890440 edges, 5844 markings/sec, 225 secs
lola: 1422027 markings, 3975224 edges, 5845 markings/sec, 230 secs
lola: 1453899 markings, 4063034 edges, 6374 markings/sec, 235 secs
lola: 1481684 markings, 4139601 edges, 5557 markings/sec, 240 secs
lola: 1502666 markings, 4215688 edges, 4196 markings/sec, 245 secs
lola: 1534132 markings, 4309070 edges, 6293 markings/sec, 250 secs
lola: 1569350 markings, 4405835 edges, 7044 markings/sec, 255 secs
lola: 1598747 markings, 4488963 edges, 5879 markings/sec, 260 secs
lola: 1632329 markings, 4580388 edges, 6716 markings/sec, 265 secs
lola: 1660288 markings, 4658478 edges, 5592 markings/sec, 270 secs
lola: 1690210 markings, 4743539 edges, 5984 markings/sec, 275 secs
lola: 1720218 markings, 4825773 edges, 6002 markings/sec, 280 secs
lola: 1749072 markings, 4905635 edges, 5771 markings/sec, 285 secs
lola: 1782172 markings, 4999776 edges, 6620 markings/sec, 290 secs
lola: 1820252 markings, 5102806 edges, 7616 markings/sec, 295 secs
lola: 1845722 markings, 5183346 edges, 5094 markings/sec, 300 secs
lola: 1868459 markings, 5270802 edges, 4547 markings/sec, 305 secs
lola: 1890757 markings, 5356934 edges, 4460 markings/sec, 310 secs
lola: 1913211 markings, 5443425 edges, 4491 markings/sec, 315 secs
lola: 1934638 markings, 5528097 edges, 4285 markings/sec, 320 secs
lola: 1954560 markings, 5609193 edges, 3984 markings/sec, 325 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 1955554 markings, 5616228 edges
lola: ========================================
lola: subprocess 7 will run for 333 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206)))
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: (p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 <= 1)
lola: processed formula length: 60
lola: 30 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: 435 markings, 435 edges
lola: ========================================
lola: subprocess 8 will run for 375 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p208 <= p584 + p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p594 + p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612 + p613 + p614 + p615 + p616 + p617 + p618 + p619 + p620 + p621 + p622 + p623 + p624 + p625 + p626 + p627 + p628 + p629 + p630 + p631)))
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: (p584 + p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p594 + p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612 + p613 + p614 + p615 + p616 + p617 + p618 + p619 + p620 + p621 + p622 + p623 + p624 + p625 + p626 + p627 + p628 + p629 + p630 + p631 + 1 <= p208)
lola: processed formula length: 347
lola: 30 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: 366 markings, 366 edges
lola: ========================================
lola: subprocess 9 will run for 429 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((2 <= p663))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((2 <= p663))))
lola: processed formula length: 23
lola: 28 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: 435 markings, 435 edges
lola: ========================================
lola: subprocess 10 will run for 500 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((2 <= p698)) OR (G ((1 <= p689 + p690 + p691 + p692 + p693 + p694 + p695 + p696)) AND F ((2 <= p698))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((F ((2 <= p698)) OR (G ((1 <= p689 + p690 + p691 + p692 + p693 + p694 + p695 + p696)) AND F ((2 <= p698))))))
lola: processed formula length: 115
lola: 28 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 435 markings, 435 edges
lola: ========================================
lola: subprocess 11 will run for 600 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p320 + p319 + p318 + p317 + p316 + p315 + p314 + p313 <= p528) OR (F ((p320 + p319 + p318 + p317 + p316 + p315 + p314 + p313 <= p528)) AND F (G ((p30 <= p387))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p320 + p319 + p318 + p317 + p316 + p315 + p314 + p313 <= p528) OR (F ((p320 + p319 + p318 + p317 + p316 + p315 + p314 + p313 <= p528)) AND F (G ((p30 <= p387))))))
lola: processed formula length: 168
lola: 28 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 435 markings, 435 edges
lola: ========================================
lola: subprocess 12 will run for 750 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((1 <= p715 + p716 + p717 + p718 + p719 + p720 + p721 + p722) OR (F ((1 <= p715 + p716 + p717 + p718 + p719 + p720 + p721 + p722)) AND F (G ((2 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((1 <= p715 + p716 + p717 + p718 + p719 + p720 + p721 + p722) OR (F ((1 <= p715 + p716 + p717 + p718 + p719 + p720 + p721 + p722)) AND F (G ((2 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15))))))
lola: processed formula length: 199
lola: 28 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 435 markings, 435 edges
lola: ========================================
lola: subprocess 13 will run for 1000 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((3 <= p346) U (3 <= p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647)) OR (G (F ((2 <= p95 + p94 + p93 + p92 + p91 + p90 + p89 + p96))) AND F ((3 <= p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((3 <= p346) U (3 <= p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647)) OR (G (F ((2 <= p95 + p94 + p93 + p92 + p91 + p90 + p89 + p96))) AND F ((3 <= p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647)))))
lola: processed formula length: 217
lola: 28 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 435 markings, 435 edges
lola: ========================================
lola: subprocess 14 will run for 1500 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((p673 + p674 + p675 + p676 + p677 + p678 + p679 + p680 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p97 + p98 + p99)))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p673 + p674 + p675 + p676 + p677 + p678 + p679 + p680 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p97 + p98 + p99)))... (shortened)
lola: processed formula length: 401
lola: 28 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: 3633 markings, 3697 edges, 727 markings/sec, 0 secs
lola: 7142 markings, 8892 edges, 702 markings/sec, 5 secs
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: 9163 markings, 11761 edges
lola: ========================================
lola: subprocess 15 will run for 2987 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 + p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 <= p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29) OR (G ((p10... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 + p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 <= p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29) OR (G ((p10... (shortened)
lola: processed formula length: 1182
lola: 28 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: RESULT
lola:
SUMMARY: no yes yes no no no no no no no no yes no no no no
lola:
preliminary result: no yes yes no no no no no no no no yes no no no no
lola: ========================================
lola: memory consumption: 406596 KB
lola: time consumption: 583 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished
BK_STOP 1552997441129
--------------------
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="PolyORBLF-COL-S06J04T08"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
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-3957"
echo " Executing tool lola"
echo " Input is PolyORBLF-COL-S06J04T08, 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 r115-smll-155272315700213"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S06J04T08.tgz
mv PolyORBLF-COL-S06J04T08 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "UpperBounds" ] ; 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 '
echo "FORMULA_NAME $x"
done
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 ;