fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r322-tall-162132128000178
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for TwoPhaseLocking-PT-nC05000vD

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16256.960 3600000.00 895799.00 52081.50 TTTFFFFTFFFTTFF? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r322-tall-162132128000178.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is TwoPhaseLocking-PT-nC05000vD, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r322-tall-162132128000178
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 320K
-rw-r--r-- 1 mcc users 11K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 12 08:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 12 08:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 12 08:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 12 08:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.8K May 12 04:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 12 04:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 11 18:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 11 18:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 12 04:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 12 04:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 10 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 4.6K May 12 08:13 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 TwoPhaseLocking-PT-nC05000vD-00
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-01
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-02
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-03
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-04
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-05
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-06
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-07
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-08
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-09
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-10
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-11
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-12
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-13
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-14
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-15

=== Now, execution of the tool begins

BK_START 1621449370610

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 18:36:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-19 18:36:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 18:36:12] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2021-05-19 18:36:12] [INFO ] Transformed 8 places.
[2021-05-19 18:36:12] [INFO ] Transformed 6 transitions.
[2021-05-19 18:36:12] [INFO ] Parsed PT model containing 8 places and 6 transitions in 56 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100044 steps, including 4 resets, run finished after 45 ms. (steps per millisecond=2223 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1]
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 18:36:12] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-19 18:36:12] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2021-05-19 18:36:12] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-19 18:36:12] [INFO ] Flatten gal took : 19 ms
FORMULA TwoPhaseLocking-PT-nC05000vD-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC05000vD-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC05000vD-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC05000vD-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC05000vD-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 18:36:12] [INFO ] Flatten gal took : 2 ms
[2021-05-19 18:36:12] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-19 18:36:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ TwoPhaseLocking-PT-nC05000vD @ 3570 seconds

FORMULA TwoPhaseLocking-PT-nC05000vD-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC05000vD-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC05000vD-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC05000vD-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC05000vD-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC05000vD-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC05000vD-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC05000vD-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC05000vD-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC05000vD-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC05000vD-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2601
rslt: Output for LTLFireability @ TwoPhaseLocking-PT-nC05000vD

{
"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": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed May 19 18:36:13 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"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": "X ((F ((p2 <= 0)) AND (F ((1 <= p6)) U ((1 <= p3) AND (1 <= p5)))))",
"processed_size": 67,
"rewrites": 23
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "X (G ((1 <= p2)))",
"processed_size": 17,
"rewrites": 23
},
"result":
{
"edges": 10003,
"markings": 10003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 2,
"X": 2,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((((1 <= p0) AND (1 <= p1)) OR ((1 <= p3) AND (1 <= p5))) U (G (((((p3 <= 0) OR (p5 <= 0)) U X (((1 <= p0) AND (1 <= p1)))) OR X (((1 <= p3) AND (1 <= p5))))) AND ((1 <= p3) AND (1 <= p5))))",
"processed_size": 192,
"rewrites": 23
},
"result":
{
"edges": 25001,
"markings": 25001,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 16
},
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (G ((p6 <= 0)))",
"processed_size": 17,
"rewrites": 23
},
"result":
{
"edges": 10003,
"markings": 10003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 3,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X ((X (((1 <= p6) U ((1 <= p0) AND (1 <= p1)))) OR F (((1 <= p0) AND (1 <= p1))))))",
"processed_size": 86,
"rewrites": 23
},
"result":
{
"edges": 24,
"markings": 20,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((F ((1 <= p2)) AND ((1 <= p2) OR X ((1 <= p2))))))",
"processed_size": 56,
"rewrites": 23
},
"result":
{
"edges": 10005,
"markings": 10004,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"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": "((p0 <= 0) OR (p1 <= 0))",
"processed_size": 25,
"rewrites": 25
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"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": "(1 <= p2)",
"processed_size": 9,
"rewrites": 23
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F ((X ((1 <= p2)) AND (1 <= p2)))",
"processed_size": 33,
"rewrites": 23
},
"result":
{
"edges": 10004,
"markings": 10004,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"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": "F (G ((1 <= p7)))",
"processed_size": 17,
"rewrites": 23
},
"result":
{
"edges": 29994,
"markings": 24996,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3068
},
"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": "(1 <= p7)",
"processed_size": 9,
"rewrites": 23
},
"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": null
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

{
"child":
[

{
"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": "(1 <= p7)",
"processed_size": 9,
"rewrites": 23
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"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": "F (G ((p7 <= 0)))",
"processed_size": 17,
"rewrites": 23
},
"result":
{
"edges": 10004,
"markings": 10003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3564,
"runtime": 969.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((F(**) AND (F(**) U **))) : X(G(**)) : (** U (G(((** U X(**)) OR X(**))) AND (** AND **))) : X(G(*)) : X(X((X((** U **)) OR F(**)))) : F(G((F(**) AND (** OR X(**))))) : (F(G(**)) OR **) : (X(G(**)) OR F(**)) : F(G(**)) : ((X(**) AND **) OR (G((X(**) OR **)) AND F((X(**) AND **)))) : F(G((F(G(**)) AND F((G(**) OR **)))))"
},
"net":
{
"arcs": 18,
"conflict_clusters": 5,
"places": 8,
"places_significant": 5,
"singleton_clusters": 0,
"transitions": 6
},
"result":
{
"preliminary_value": "yes no no no yes no no yes no no unknown ",
"value": "yes no no no yes no no yes no no unknown "
},
"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: 14/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 256
lola: finding significant places
lola: 8 places, 6 transitions, 5 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 LTLFireability.xml
lola: (X (((1 <= p6) U F ((p2 <= 0)))) AND (X (F ((1 <= p6))) U X (((1 <= p3) AND (1 <= p5))))) : X (G ((1 <= p2))) : ((((1 <= p0) AND (1 <= p1)) OR ((1 <= p3) AND (1 <= p5))) U ((G (((((p3 <= 0) OR (p5 <= 0)) U X (((1 <= p0) AND (1 <= p1)))) OR X (((1 <= p3) AND (1 <= p5))))) AND (1 <= p3)) AND (1 <= p5))) : G (NOT(F (((F ((p2 <= 0)) AND ((X (((1 <= p0) AND (1 <= p1))) OR (p3 <= 0)) OR (p4 <= 0))) U X ((1 <= p6)))))) : X (X ((X (((1 <= p6) U ((1 <= p0) AND (1 <= p1)))) OR F (((1 <= p0) AND (1 <= p1)))))) : F (G (((1 <= p2) U X ((1 <= p2))))) : (((p7 <= 0) U G (F (G ((p7 <= 0))))) OR (1 <= p7)) : (G (X (G (((1 <= p3) AND (1 <= p4))))) OR F (((1 <= p0) AND (1 <= p1)))) : F (G ((1 <= p7))) : (G ((X ((1 <= p2)) OR (1 <= p2))) U (X ((1 <= p2)) AND (1 <= p2))) : G (F (G ((F (G (((1 <= p3) AND (1 <= p5)))) AND F ((G ((1 <= p2)) OR (1 <= p2)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:374
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((p2 <= 0)) AND (F ((1 <= p6)) U ((1 <= p3) AND (1 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((p2 <= 0)) AND (F ((1 <= p6)) U ((1 <= p3) AND (1 <= p5)))))
lola: processed formula length: 67
lola: 23 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((1 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((1 <= p2)))
lola: processed formula length: 17
lola: 23 rewrites
lola: closed formula file LTLFireability.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: 10003 markings, 10003 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p0) AND (1 <= p1)) OR ((1 <= p3) AND (1 <= p5))) U (G (((((p3 <= 0) OR (p5 <= 0)) U X (((1 <= p0) AND (1 <= p1)))) OR X (((1 <= p3) AND (1 <= p5))))) AND ((1 <= p3) AND (1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((1 <= p0) AND (1 <= p1)) OR ((1 <= p3) AND (1 <= p5))) U (G (((((p3 <= 0) OR (p5 <= 0)) U X (((1 <= p0) AND (1 <= p1)))) OR X (((1 <= p3) AND (1 <= p5))))) AND ((1 <= p3) AND (1 <= p5))))
lola: processed formula length: 192
lola: 23 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 16 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: 25001 markings, 25001 edges
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p6 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p6 <= 0)))
lola: processed formula length: 17
lola: 23 rewrites
lola: closed formula file LTLFireability.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: 10003 markings, 10003 edges
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((X (((1 <= p6) U ((1 <= p0) AND (1 <= p1)))) OR F (((1 <= p0) AND (1 <= p1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((X (((1 <= p6) U ((1 <= p0) AND (1 <= p1)))) OR F (((1 <= p0) AND (1 <= p1))))))
lola: processed formula length: 86
lola: 23 rewrites
lola: closed formula file LTLFireability.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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 20 markings, 24 edges
lola: ========================================
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((1 <= p2)) AND ((1 <= p2) OR X ((1 <= p2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((1 <= p2)) AND ((1 <= p2) OR X ((1 <= p2))))))
lola: processed formula length: 56
lola: 23 rewrites
lola: closed formula file LTLFireability.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: 10004 markings, 10005 edges
lola: ========================================
lola: subprocess 6 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((1 <= p3) AND (1 <= p4)))) OR F (((1 <= p0) AND (1 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p0) AND (1 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p0 <= 0) OR (p1 <= 0))
lola: processed formula length: 25
lola: 25 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X ((1 <= p2)) AND (1 <= p2)) OR (G ((X ((1 <= p2)) OR (1 <= p2))) AND F ((X ((1 <= p2)) AND (1 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p2)
lola: processed formula length: 9
lola: 23 rewrites
lola: closed formula file LTLFireability.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: subprocess 8 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X ((1 <= p2)) AND (1 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((1 <= p2)) AND (1 <= p2)))
lola: processed formula length: 33
lola: 23 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10004 markings, 10004 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((1 <= p7)))
lola: processed formula length: 17
lola: 23 rewrites
lola: closed formula file LTLFireability.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: 24996 markings, 29994 edges
lola: ========================================
lola: subprocess 9 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (G (((1 <= p3) AND (1 <= p5)))) AND F ((G ((1 <= p2)) OR (1 <= p2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (G (((1 <= p3) AND (1 <= p5)))) AND F ((G ((1 <= p2)) OR (1 <= p2))))))
lola: processed formula length: 80
lola: 23 rewrites
lola: closed formula file LTLFireability.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: 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: 2763682 markings, 6680128 edges, 552736 markings/sec, 0 secs
lola: 5123492 markings, 12405018 edges, 471962 markings/sec, 5 secs
lola: 7373132 markings, 17864913 edges, 449928 markings/sec, 10 secs
lola: 9558877 markings, 23162559 edges, 437149 markings/sec, 15 secs
lola: 11698136 markings, 28353099 edges, 427852 markings/sec, 20 secs
lola: 13797382 markings, 33451512 edges, 419849 markings/sec, 25 secs
lola: 15872336 markings, 38483310 edges, 414991 markings/sec, 30 secs
lola: 17921172 markings, 43451288 edges, 409767 markings/sec, 35 secs
lola: 19944744 markings, 48362212 edges, 404714 markings/sec, 40 secs
lola: 21937444 markings, 53204838 edges, 398540 markings/sec, 45 secs
lola: 23929258 markings, 58035577 edges, 398363 markings/sec, 50 secs
lola: 26009977 markings, 63076311 edges, 416144 markings/sec, 55 secs
lola: 27966561 markings, 67822358 edges, 391317 markings/sec, 60 secs
lola: 29915246 markings, 72569232 edges, 389737 markings/sec, 65 secs
lola: 31866792 markings, 77287490 edges, 390309 markings/sec, 70 secs
lola: 33777038 markings, 81926430 edges, 382049 markings/sec, 75 secs
lola: 35662692 markings, 86508708 edges, 377131 markings/sec, 80 secs
lola: 37561867 markings, 91109080 edges, 379835 markings/sec, 85 secs
lola: 39439685 markings, 95664418 edges, 375564 markings/sec, 90 secs
lola: 41192862 markings, 99923297 edges, 350635 markings/sec, 95 secs
lola: 43036458 markings, 104414941 edges, 368719 markings/sec, 100 secs
lola: 44921656 markings, 108980233 edges, 377040 markings/sec, 105 secs
lola: 46789937 markings, 113502119 edges, 373656 markings/sec, 110 secs
lola: 48642158 markings, 118014894 edges, 370444 markings/sec, 115 secs
lola: 50505636 markings, 122521908 edges, 372696 markings/sec, 120 secs
lola: 52362467 markings, 127027372 edges, 371366 markings/sec, 125 secs
lola: 54202605 markings, 131496907 edges, 368028 markings/sec, 130 secs
lola: 56055486 markings, 135996803 edges, 370576 markings/sec, 135 secs
lola: 57898479 markings, 140467339 edges, 368599 markings/sec, 140 secs
lola: 59718823 markings, 144880620 edges, 364069 markings/sec, 145 secs
lola: 61541046 markings, 149310584 edges, 364445 markings/sec, 150 secs
lola: 63335705 markings, 153672377 edges, 358932 markings/sec, 155 secs
lola: 65146076 markings, 158052475 edges, 362074 markings/sec, 160 secs
lola: 66929485 markings, 162397623 edges, 356682 markings/sec, 165 secs
lola: 68732959 markings, 166761759 edges, 360695 markings/sec, 170 secs
lola: 70486002 markings, 171014712 edges, 350609 markings/sec, 175 secs
lola: 72231229 markings, 175261135 edges, 349045 markings/sec, 180 secs
lola: 73980646 markings, 179520222 edges, 349883 markings/sec, 185 secs
lola: 75800932 markings, 183923811 edges, 364057 markings/sec, 190 secs
lola: 77544120 markings, 188150123 edges, 348638 markings/sec, 195 secs
lola: 79313830 markings, 192442118 edges, 353942 markings/sec, 200 secs
lola: 81073924 markings, 196714611 edges, 352019 markings/sec, 205 secs
lola: 82821827 markings, 200960776 edges, 349581 markings/sec, 210 secs
lola: 84579681 markings, 205237786 edges, 351571 markings/sec, 215 secs
lola: 86334443 markings, 209515112 edges, 350952 markings/sec, 220 secs
lola: 88107389 markings, 213804096 edges, 354589 markings/sec, 225 secs
lola: 89864578 markings, 218055030 edges, 351438 markings/sec, 230 secs
lola: 91605191 markings, 222273818 edges, 348123 markings/sec, 235 secs
lola: 93320813 markings, 226477035 edges, 343124 markings/sec, 240 secs
lola: 95066064 markings, 230684246 edges, 349050 markings/sec, 245 secs
lola: 96796489 markings, 234875910 edges, 346085 markings/sec, 250 secs
lola: 98512704 markings, 239065469 edges, 343243 markings/sec, 255 secs
lola: 100266037 markings, 243295252 edges, 350667 markings/sec, 260 secs
lola: 101972954 markings, 247473140 edges, 341383 markings/sec, 265 secs
lola: 103704948 markings, 251642424 edges, 346399 markings/sec, 270 secs
lola: 105416470 markings, 255825842 edges, 342304 markings/sec, 275 secs
lola: 107168863 markings, 260051207 edges, 350479 markings/sec, 280 secs
lola: 108877288 markings, 264213125 edges, 341685 markings/sec, 285 secs
lola: 110586375 markings, 268369374 edges, 341817 markings/sec, 290 secs
lola: 112319562 markings, 272553233 edges, 346637 markings/sec, 295 secs
lola: 114017139 markings, 276692261 edges, 339515 markings/sec, 300 secs
lola: 115712649 markings, 280827916 edges, 339102 markings/sec, 305 secs
lola: 117441296 markings, 284986113 edges, 345729 markings/sec, 310 secs
lola: 119131952 markings, 289092392 edges, 338131 markings/sec, 315 secs
lola: 120800548 markings, 293154790 edges, 333719 markings/sec, 320 secs
lola: 122481088 markings, 297251408 edges, 336108 markings/sec, 325 secs
lola: 124172437 markings, 301359608 edges, 338270 markings/sec, 330 secs
lola: 125651954 markings, 304953949 edges, 295903 markings/sec, 335 secs
lola: 126889752 markings, 307921645 edges, 247560 markings/sec, 340 secs
lola: 128404010 markings, 311595319 edges, 302852 markings/sec, 345 secs
lola: 130039493 markings, 315565239 edges, 327097 markings/sec, 350 secs
lola: 130963052 markings, 317810250 edges, 184712 markings/sec, 355 secs
lola: 132136733 markings, 320701727 edges, 234736 markings/sec, 360 secs
lola: 132974868 markings, 322739289 edges, 167627 markings/sec, 365 secs
lola: 134168837 markings, 325588994 edges, 238794 markings/sec, 370 secs
lola: 135516357 markings, 328894387 edges, 269504 markings/sec, 375 secs
lola: 136792955 markings, 331964999 edges, 255320 markings/sec, 380 secs
lola: 137792018 markings, 334406433 edges, 199813 markings/sec, 385 secs
lola: 139005987 markings, 337338934 edges, 242794 markings/sec, 390 secs
lola: 140351049 markings, 340620979 edges, 269012 markings/sec, 395 secs
lola: 141322949 markings, 342997720 edges, 194380 markings/sec, 400 secs
lola: 142366588 markings, 345505511 edges, 208728 markings/sec, 405 secs
lola: 143763550 markings, 348901339 edges, 279392 markings/sec, 410 secs
lola: 145198112 markings, 352361941 edges, 286912 markings/sec, 415 secs
lola: 146492492 markings, 355541874 edges, 258876 markings/sec, 420 secs
lola: 147800131 markings, 358678272 edges, 261528 markings/sec, 425 secs
lola: 149046917 markings, 361729401 edges, 249357 markings/sec, 430 secs
lola: 150569871 markings, 365403097 edges, 304591 markings/sec, 435 secs
lola: 152155099 markings, 369253454 edges, 317046 markings/sec, 440 secs
lola: 153191219 markings, 371764661 edges, 207224 markings/sec, 445 secs
lola: 154544631 markings, 375091719 edges, 270682 markings/sec, 450 secs
lola: 154911999 markings, 375943557 edges, 73474 markings/sec, 455 secs
lola: 156461463 markings, 379759300 edges, 309893 markings/sec, 460 secs
lola: 157258364 markings, 381674567 edges, 159380 markings/sec, 465 secs
lola: 157293943 markings, 381766381 edges, 7116 markings/sec, 470 secs
lola: 157296389 markings, 381772689 edges, 489 markings/sec, 475 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 3068 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((p7 <= 0))) OR (1 <= p7))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 3068 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p7)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p7)
lola: processed formula length: 9
lola: 23 rewrites
lola: closed formula file LTLFireability.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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((F (G (((1 <= p3) AND (1 <= p5)))) AND F ((G ((1 <= p2)) OR (1 <= p2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (G (((1 <= p3) AND (1 <= p5)))) AND F ((G ((1 <= p2)) OR (1 <= p2))))))
lola: processed formula length: 80
lola: 23 rewrites
lola: closed formula file LTLFireability.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: 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: 2766877 markings, 6687970 edges, 553375 markings/sec, 0 secs
lola: 5133848 markings, 12431937 edges, 473394 markings/sec, 5 secs
lola: 7381682 markings, 17884966 edges, 449567 markings/sec, 10 secs
lola: 9563838 markings, 23174835 edges, 436431 markings/sec, 15 secs
lola: 11715474 markings, 28397317 edges, 430327 markings/sec, 20 secs
lola: 13845424 markings, 33560821 edges, 425990 markings/sec, 25 secs
lola: 15924040 markings, 38608227 edges, 415723 markings/sec, 30 secs
lola: 17967358 markings, 43569484 edges, 408664 markings/sec, 35 secs
lola: 20004101 markings, 48514422 edges, 407349 markings/sec, 40 secs
lola: 22011194 markings, 53371599 edges, 401419 markings/sec, 45 secs
lola: 24002400 markings, 58208871 edges, 398241 markings/sec, 50 secs
lola: 25989652 markings, 63025449 edges, 397450 markings/sec, 55 secs
lola: 27969380 markings, 67829322 edges, 395946 markings/sec, 60 secs
lola: 29905872 markings, 72545631 edges, 387298 markings/sec, 65 secs
lola: 31848009 markings, 77243890 edges, 388427 markings/sec, 70 secs
lola: 33771662 markings, 81914559 edges, 384731 markings/sec, 75 secs
lola: 35690976 markings, 86580931 edges, 383863 markings/sec, 80 secs
lola: 37619473 markings, 91246614 edges, 385699 markings/sec, 85 secs
lola: 39523098 markings, 95872944 edges, 380725 markings/sec, 90 secs
lola: 41425810 markings, 100495921 edges, 380542 markings/sec, 95 secs
lola: 43321704 markings, 105094791 edges, 379179 markings/sec, 100 secs
lola: 45212871 markings, 109676767 edges, 378233 markings/sec, 105 secs
lola: 47079129 markings, 114213379 edges, 373252 markings/sec, 110 secs
lola: 48947760 markings, 118742873 edges, 373726 markings/sec, 115 secs
lola: 50799850 markings, 123256484 edges, 370418 markings/sec, 120 secs
lola: 52662162 markings, 127759423 edges, 372462 markings/sec, 125 secs
lola: 54514640 markings, 132250394 edges, 370496 markings/sec, 130 secs
lola: 56377890 markings, 136771790 edges, 372650 markings/sec, 135 secs
lola: 58231857 markings, 141271788 edges, 370793 markings/sec, 140 secs
lola: 60080273 markings, 145764449 edges, 369683 markings/sec, 145 secs
lola: 61902969 markings, 150203987 edges, 364539 markings/sec, 150 secs
lola: 63744890 markings, 154655607 edges, 368384 markings/sec, 155 secs
lola: 65582403 markings, 159117270 edges, 367503 markings/sec, 160 secs
lola: 67407762 markings, 163552836 edges, 365072 markings/sec, 165 secs
lola: 69252973 markings, 168024663 edges, 369042 markings/sec, 170 secs
lola: 71100835 markings, 172513197 edges, 369572 markings/sec, 175 secs
lola: 72906090 markings, 176917403 edges, 361051 markings/sec, 180 secs
lola: 74735417 markings, 181329764 edges, 365865 markings/sec, 185 secs
lola: 76543585 markings, 185715794 edges, 361634 markings/sec, 190 secs
lola: 78348925 markings, 190102909 edges, 361068 markings/sec, 195 secs
lola: 80146679 markings, 194470853 edges, 359551 markings/sec, 200 secs
lola: 81890701 markings, 198701155 edges, 348804 markings/sec, 205 secs
lola: 83654026 markings, 202978066 edges, 352665 markings/sec, 210 secs
lola: 85422765 markings, 207267902 edges, 353748 markings/sec, 215 secs
lola: 87181217 markings, 211535429 edges, 351690 markings/sec, 220 secs
lola: 88957736 markings, 215855734 edges, 355304 markings/sec, 225 secs
lola: 90708950 markings, 220131569 edges, 350243 markings/sec, 230 secs
lola: 92496296 markings, 224450695 edges, 357469 markings/sec, 235 secs
lola: 94287046 markings, 228784170 edges, 358150 markings/sec, 240 secs
lola: 96062229 markings, 233100842 edges, 355037 markings/sec, 245 secs
lola: 97822743 markings, 237387406 edges, 352103 markings/sec, 250 secs
lola: 99606070 markings, 241693917 edges, 356665 markings/sec, 255 secs
lola: 101316333 markings, 245883514 edges, 342053 markings/sec, 260 secs
lola: 103089187 markings, 250151043 edges, 354571 markings/sec, 265 secs
lola: 104813497 markings, 254374068 edges, 344862 markings/sec, 270 secs
lola: 106531497 markings, 258503487 edges, 343600 markings/sec, 275 secs
lola: 108199117 markings, 262571786 edges, 333524 markings/sec, 280 secs
lola: 109907959 markings, 266712390 edges, 341768 markings/sec, 285 secs
lola: 111611667 markings, 270836693 edges, 340742 markings/sec, 290 secs
lola: 113312597 markings, 274986144 edges, 340186 markings/sec, 295 secs
lola: 114967664 markings, 279018069 edges, 331013 markings/sec, 300 secs
lola: 116654751 markings, 283078809 edges, 337417 markings/sec, 305 secs
lola: 118310642 markings, 287095937 edges, 331178 markings/sec, 310 secs
lola: 119975088 markings, 291144756 edges, 332889 markings/sec, 315 secs
lola: 121608458 markings, 295119595 edges, 326674 markings/sec, 320 secs
lola: 123239279 markings, 299088213 edges, 326164 markings/sec, 325 secs
lola: 124887006 markings, 303100328 edges, 329545 markings/sec, 330 secs
lola: 126340546 markings, 306610235 edges, 290708 markings/sec, 335 secs
lola: 127249327 markings, 308831927 edges, 181756 markings/sec, 340 secs
lola: 128561726 markings, 311983821 edges, 262480 markings/sec, 345 secs
lola: 129967877 markings, 315393419 edges, 281230 markings/sec, 350 secs
lola: 131318891 markings, 318716387 edges, 270203 markings/sec, 355 secs
lola: 132811642 markings, 322318203 edges, 298550 markings/sec, 360 secs
lola: 134192141 markings, 325646430 edges, 276100 markings/sec, 365 secs
lola: 135697660 markings, 329303092 edges, 301104 markings/sec, 370 secs
lola: 137123424 markings, 332809340 edges, 285153 markings/sec, 375 secs
lola: 138616808 markings, 336406250 edges, 298677 markings/sec, 380 secs
lola: 140135218 markings, 340075488 edges, 303682 markings/sec, 385 secs
lola: 141492465 markings, 343386244 edges, 271449 markings/sec, 390 secs
lola: 142654352 markings, 346187886 edges, 232377 markings/sec, 395 secs
lola: 143961033 markings, 349411174 edges, 261336 markings/sec, 400 secs
lola: 144776395 markings, 351381465 edges, 163072 markings/sec, 405 secs
lola: 145961913 markings, 354218174 edges, 237104 markings/sec, 410 secs
lola: 146961788 markings, 356642958 edges, 199975 markings/sec, 415 secs
lola: 148268784 markings, 359857078 edges, 261399 markings/sec, 420 secs
lola: 149322709 markings, 362400893 edges, 210785 markings/sec, 425 secs
lola: 150873109 markings, 366168886 edges, 310080 markings/sec, 430 secs
lola: 152426603 markings, 369914291 edges, 310699 markings/sec, 435 secs
lola: 153588604 markings, 372763800 edges, 232400 markings/sec, 440 secs
lola: 155177107 markings, 376592908 edges, 317701 markings/sec, 445 secs
lola: 156706199 markings, 380300634 edges, 305818 markings/sec, 450 secs
lola: 157031672 markings, 381097145 edges, 65095 markings/sec, 455 secs
lola: 157219360 markings, 381574350 edges, 37538 markings/sec, 460 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (F (G ((p7 <= 0))) OR (1 <= p7))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (1 <= p7)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p7)
lola: processed formula length: 9
lola: 23 rewrites
lola: closed formula file LTLFireability.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: ========================================
lola: ...considering subproblem: F (G ((p7 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p7 <= 0)))
lola: processed formula length: 17
lola: 23 rewrites
lola: closed formula file LTLFireability.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: 10003 markings, 10004 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no yes no no yes no no unknown
lola:
preliminary result: yes no no no yes no no yes no no unknown
lola: memory consumption: 3564 KB
lola: time consumption: 969 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished

--------------------
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="TwoPhaseLocking-PT-nC05000vD"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is TwoPhaseLocking-PT-nC05000vD, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r322-tall-162132128000178"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/TwoPhaseLocking-PT-nC05000vD.tgz
mv TwoPhaseLocking-PT-nC05000vD execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;