Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r037-tajo-162038177000162.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 BusinessProcesses-PT-01, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-162038177000162
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 152K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 96K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 47K May 5 16:51 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 BusinessProcesses-PT-01-00
FORMULA_NAME BusinessProcesses-PT-01-01
FORMULA_NAME BusinessProcesses-PT-01-02
FORMULA_NAME BusinessProcesses-PT-01-03
FORMULA_NAME BusinessProcesses-PT-01-04
FORMULA_NAME BusinessProcesses-PT-01-05
FORMULA_NAME BusinessProcesses-PT-01-06
FORMULA_NAME BusinessProcesses-PT-01-07
FORMULA_NAME BusinessProcesses-PT-01-08
FORMULA_NAME BusinessProcesses-PT-01-09
FORMULA_NAME BusinessProcesses-PT-01-10
FORMULA_NAME BusinessProcesses-PT-01-11
FORMULA_NAME BusinessProcesses-PT-01-12
FORMULA_NAME BusinessProcesses-PT-01-13
FORMULA_NAME BusinessProcesses-PT-01-14
FORMULA_NAME BusinessProcesses-PT-01-15

=== Now, execution of the tool begins

BK_START 1620935906896

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 19:58:29] [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-13 19:58:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 19:58:29] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2021-05-13 19:58:29] [INFO ] Transformed 200 places.
[2021-05-13 19:58:29] [INFO ] Transformed 178 transitions.
[2021-05-13 19:58:29] [INFO ] Found NUPN structural information;
[2021-05-13 19:58:29] [INFO ] Parsed PT model containing 200 places and 178 transitions in 104 ms.
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1136 resets, run finished after 192 ms. (steps per millisecond=520 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 177 rows 199 cols
[2021-05-13 19:58:30] [INFO ] Computed 30 place invariants in 12 ms
[2021-05-13 19:58:30] [INFO ] [Real]Absence check using 20 positive place invariants in 36 ms returned sat
[2021-05-13 19:58:30] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 5 ms returned sat
[2021-05-13 19:58:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 19:58:30] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2021-05-13 19:58:30] [INFO ] Deduced a trap composed of 8 places in 66 ms
[2021-05-13 19:58:30] [INFO ] Deduced a trap composed of 30 places in 48 ms
[2021-05-13 19:58:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 152 ms
[2021-05-13 19:58:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 19:58:30] [INFO ] [Nat]Absence check using 20 positive place invariants in 19 ms returned sat
[2021-05-13 19:58:30] [INFO ] [Nat]Absence check using 20 positive and 10 generalized place invariants in 3 ms returned sat
[2021-05-13 19:58:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 19:58:30] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2021-05-13 19:58:30] [INFO ] Deduced a trap composed of 8 places in 43 ms
[2021-05-13 19:58:30] [INFO ] Deduced a trap composed of 30 places in 33 ms
[2021-05-13 19:58:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 103 ms
[2021-05-13 19:58:30] [INFO ] Computed and/alt/rep : 176/482/176 causal constraints in 16 ms.
[2021-05-13 19:58:31] [INFO ] Added : 102 causal constraints over 22 iterations in 250 ms. Result :sat
[2021-05-13 19:58:31] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2021-05-13 19:58:31] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 2 ms returned sat
[2021-05-13 19:58:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 19:58:31] [INFO ] [Real]Absence check using state equation in 85 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2021-05-13 19:58:31] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-13 19:58:31] [INFO ] Flatten gal took : 37 ms
FORMULA BusinessProcesses-PT-01-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 19:58:31] [INFO ] Applying decomposition
[2021-05-13 19:58:31] [INFO ] Flatten gal took : 13 ms
[2021-05-13 19:58:31] [INFO ] Decomposing Gal with order
[2021-05-13 19:58:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 19:58:31] [INFO ] Removed a total of 14 redundant transitions.
[2021-05-13 19:58:31] [INFO ] Flatten gal took : 36 ms
[2021-05-13 19:58:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 10 ms.
[2021-05-13 19:58:31] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-13 19:58:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ BusinessProcesses-PT-01 @ 3570 seconds

FORMULA BusinessProcesses-PT-01-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-01-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-01-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-01-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-01-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-01-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-01-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-01-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-01-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-01-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-01-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-01-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2889
rslt: Output for LTLFireability @ BusinessProcesses-PT-01

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu May 13 19:58:31 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"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": "G (((1 <= p177)))",
"processed_size": 17,
"rewrites": 85
},
"result":
{
"edges": 84,
"markings": 84,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"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 (X (F (((1 <= p104)))))",
"processed_size": 25,
"rewrites": 85
},
"result":
{
"edges": 164,
"markings": 164,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 2,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((G (F (((p106 <= 0)))) AND X (((1 <= p105)))) U X (((1 <= p168))))",
"processed_size": 67,
"rewrites": 85
},
"result":
{
"edges": 119,
"markings": 119,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 5,
"aconj": 5,
"adisj": 0,
"aneg": 4,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (X (G ((F ((((p192 <= 0)) R ((p23 <= 0)))) AND (((1 <= p23)) OR X (X ((((p192 <= 0)) R ((p23 <= 0)))))))))))",
"processed_size": 113,
"rewrites": 85
},
"result":
{
"edges": 121,
"markings": 121,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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": 396
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"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": 2,
"visible_transitions": 0
},
"processed": "X (G ((G (((p144 <= 0))) AND ((p11 <= 0)))))",
"processed_size": 44,
"rewrites": 85
},
"result":
{
"edges": 121,
"markings": 121,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X (F (((((1 <= p168)) U G (((p11 <= 0)))) OR ((1 <= p129))))))",
"processed_size": 65,
"rewrites": 85
},
"result":
{
"edges": 501,
"markings": 346,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 1,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((X (F ((X (((p181 <= 0))) AND ((p181 <= 0))))) AND ((p181 <= 0))))",
"processed_size": 69,
"rewrites": 85
},
"result":
{
"edges": 474,
"markings": 466,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 2,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((1 <= p136)) U X (F ((X (((1 <= p195))) OR ((p136 <= 0))))))",
"processed_size": 62,
"rewrites": 85
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"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": "(((p160 <= 0)) AND ((p171 <= 0)))",
"processed_size": 33,
"rewrites": 87
},
"result":
{
"edges": 84,
"markings": 84,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p59))))",
"processed_size": 20,
"rewrites": 85
},
"result":
{
"edges": 93,
"markings": 92,
"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": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G (((p9 <= 0) OR (p34 <= 0) OR (p107 <= 0) OR (p192 <= 0))))",
"processed_size": 66,
"rewrites": 85
},
"result":
{
"edges": 362123585,
"markings": 42604421,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1448
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 2,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((G ((((p111 <= 0)) OR ((G (((1 <= p144))) AND F (((p111 <= 0)))) OR G (((p58 <= 0)))))) AND ((1 <= p28))))",
"processed_size": 109,
"rewrites": 85
},
"result":
{
"edges": 5004702,
"markings": 462626,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 28
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2889
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 3,
"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": "G (F (((((p88 <= 0)) R (((p110 <= 0)) AND ((p24 <= 0)))) AND ((p185 <= 0)))))",
"processed_size": 77,
"rewrites": 85
},
"result":
{
"edges": 86,
"markings": 86,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 32720,
"runtime": 681.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(X(F(**))) OR G(**)) : G(F(((* R *) AND *))) : ((G(F(**)) AND X(**)) U X(**)) : X(X(X(G((F((* R *)) AND (** OR X(X((* R *))))))))) : F((G((** OR ((G(**) AND F(**)) OR G(*)))) AND **)) : (X(G((G(*) AND *))) AND (X(G((G(*) AND *))) OR G(F(**)))) : X(X(F(((** U G(*)) OR **)))) : G((X(F((X(*) AND *))) AND **)) : (** U X(F((X(**) OR **)))) : F(G(*)) : F(**) : F(G(**))"
},
"net":
{
"arcs": 485,
"conflict_clusters": 155,
"places": 199,
"places_significant": 169,
"singleton_clusters": 0,
"transitions": 177
},
"result":
{
"preliminary_value": "no no no no no no no no yes no no no ",
"value": "no no no no no no no no yes no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 376/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 199
lola: finding significant places
lola: 199 places, 177 transitions, 169 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: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p177 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p185 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p168 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p192 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p144 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p144 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p168 <= 1)
lola: LP says that atomic proposition is always true: (p168 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p129 <= 1)
lola: LP says that atomic proposition is always true: (p181 <= 1)
lola: LP says that atomic proposition is always true: (p181 <= 1)
lola: LP says that atomic proposition is always true: (p181 <= 1)
lola: LP says that atomic proposition is always true: (p136 <= 1)
lola: LP says that atomic proposition is always true: (p195 <= 1)
lola: LP says that atomic proposition is always true: (p136 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p192 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p160 <= 1)
lola: LP says that atomic proposition is always true: (p171 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: (X (X (F (((1 <= p104))))) OR G (((1 <= p177)))) : NOT(F (G (((((1 <= p88)) U (((1 <= p110)) OR ((1 <= p24)))) OR ((1 <= p185)))))) : ((F ((G (X (((1 <= p105)))) U G (F (((p106 <= 0)))))) AND X (((1 <= p105)))) U X (((1 <= p168)))) : X (X (G (X ((((1 <= p23)) U NOT(X (X ((((1 <= p192)) U ((1 <= p23))))))))))) : F ((G (((G (((1 <= p144))) U ((p111 <= 0))) OR NOT(F (((1 <= p58)))))) AND ((1 <= p28)))) : NOT((F (NOT(F (((1 <= p11))))) U F ((F (X ((((1 <= p4)) U ((1 <= p144))))) OR X (((1 <= p11))))))) : F ((NOT(X (((1 <= p168)))) U X ((X ((((1 <= p168)) U NOT(F (((1 <= p11)))))) OR X (((1 <= p129))))))) : G ((NOT(G (X ((X (((1 <= p181))) OR ((1 <= p181)))))) AND ((p181 <= 0)))) : (((1 <= p136)) U X (F ((X (((1 <= p195))) OR ((p136 <= 0)))))) : NOT(F (G ((X (F (((1 <= p9)))) U F (((1 <= p9) AND (1 <= p34) AND (1 <= p107) AND (1 <= p192))))))) : (G (X (X (G (((1 <= p5)))))) U F ((((p2 <= 0)) U F ((((1 <= p160)) OR ((1 <= p171))))))) : X (F (G (X (((1 <= p59))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (F (((1 <= p104))))) OR G (((1 <= p177))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p177)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p177)))
lola: processed formula length: 17
lola: 85 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: 84 markings, 84 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F (((1 <= p104)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F (((1 <= p104)))))
lola: processed formula length: 25
lola: 85 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: 164 markings, 164 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G (F (((p106 <= 0)))) AND X (((1 <= p105)))) U X (((1 <= p168))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((G (F (((p106 <= 0)))) AND X (((1 <= p105)))) U X (((1 <= p168))))
lola: processed formula length: 67
lola: 85 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 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: 119 markings, 119 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (G ((F ((((p192 <= 0)) R ((p23 <= 0)))) AND (((1 <= p23)) OR X (X ((((p192 <= 0)) R ((p23 <= 0)))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (G ((F ((((p192 <= 0)) R ((p23 <= 0)))) AND (((1 <= p23)) OR X (X ((((p192 <= 0)) R ((p23 <= 0)))))))))))
lola: processed formula length: 113
lola: 85 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: 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: 121 markings, 121 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((G (((p144 <= 0))) AND ((p11 <= 0))))) AND (X (G ((G (((p144 <= 0))) AND ((p11 <= 0))))) OR G (F (((1 <= p11))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p11))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((1 <= p11))))
lola: processed formula length: 20
lola: 85 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: 84 markings, 84 edges
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G (((p144 <= 0))) AND ((p11 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G (((p144 <= 0))) AND ((p11 <= 0)))))
lola: processed formula length: 44
lola: 85 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 121 markings, 121 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F (((((1 <= p168)) U G (((p11 <= 0)))) OR ((1 <= p129))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F (((((1 <= p168)) U G (((p11 <= 0)))) OR ((1 <= p129))))))
lola: processed formula length: 65
lola: 85 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 346 markings, 501 edges
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (F ((X (((p181 <= 0))) AND ((p181 <= 0))))) AND ((p181 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (F ((X (((p181 <= 0))) AND ((p181 <= 0))))) AND ((p181 <= 0))))
lola: processed formula length: 69
lola: 85 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 466 markings, 474 edges
lola: ========================================
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p136)) U X (F ((X (((1 <= p195))) OR ((p136 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p136)) U X (F ((X (((1 <= p195))) OR ((p136 <= 0))))))
lola: processed formula length: 62
lola: 85 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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 7 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p160)) OR ((1 <= p171))))
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: (((p160 <= 0)) AND ((p171 <= 0)))
lola: processed formula length: 33
lola: 87 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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 84 markings, 84 edges
lola: ========================================
lola: subprocess 8 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p59))))
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 <= p59))))
lola: processed formula length: 20
lola: 85 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: 92 markings, 93 edges
lola: ========================================
lola: subprocess 9 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p9 <= 0) OR (p34 <= 0) OR (p107 <= 0) OR (p192 <= 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 (((p9 <= 0) OR (p34 <= 0) OR (p107 <= 0) OR (p192 <= 0))))
lola: processed formula length: 66
lola: 85 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: 445088 markings, 2838408 edges, 89018 markings/sec, 0 secs
lola: 889289 markings, 5762413 edges, 88840 markings/sec, 5 secs
lola: 1295406 markings, 8722220 edges, 81223 markings/sec, 10 secs
lola: 1675235 markings, 11703731 edges, 75966 markings/sec, 15 secs
lola: 2082606 markings, 14723969 edges, 81474 markings/sec, 20 secs
lola: 2501896 markings, 17719797 edges, 83858 markings/sec, 25 secs
lola: 2922782 markings, 20766367 edges, 84177 markings/sec, 30 secs
lola: 3321335 markings, 23758215 edges, 79711 markings/sec, 35 secs
lola: 3728843 markings, 26655056 edges, 81502 markings/sec, 40 secs
lola: 4099493 markings, 29645597 edges, 74130 markings/sec, 45 secs
lola: 4498389 markings, 32637122 edges, 79779 markings/sec, 50 secs
lola: 4890408 markings, 35768964 edges, 78404 markings/sec, 55 secs
lola: 5316322 markings, 38946981 edges, 85183 markings/sec, 60 secs
lola: 5687628 markings, 41944583 edges, 74261 markings/sec, 65 secs
lola: 6006061 markings, 44610922 edges, 63687 markings/sec, 70 secs
lola: 6328274 markings, 47202403 edges, 64443 markings/sec, 75 secs
lola: 6688465 markings, 50029892 edges, 72038 markings/sec, 80 secs
lola: 7062253 markings, 53034708 edges, 74758 markings/sec, 85 secs
lola: 7359914 markings, 55476835 edges, 59532 markings/sec, 90 secs
lola: 7677114 markings, 58030079 edges, 63440 markings/sec, 95 secs
lola: 7938661 markings, 60421062 edges, 52309 markings/sec, 100 secs
lola: 8234965 markings, 62996392 edges, 59261 markings/sec, 105 secs
lola: 8609467 markings, 65894911 edges, 74900 markings/sec, 110 secs
lola: 8895628 markings, 68535728 edges, 57232 markings/sec, 115 secs
lola: 9190404 markings, 71017071 edges, 58955 markings/sec, 120 secs
lola: 9549302 markings, 73865468 edges, 71780 markings/sec, 125 secs
lola: 9882657 markings, 76639491 edges, 66671 markings/sec, 130 secs
lola: 10230457 markings, 79311360 edges, 69560 markings/sec, 135 secs
lola: 10544883 markings, 81787236 edges, 62885 markings/sec, 140 secs
lola: 10851354 markings, 84335555 edges, 61294 markings/sec, 145 secs
lola: 11162388 markings, 86917151 edges, 62207 markings/sec, 150 secs
lola: 11469885 markings, 89583462 edges, 61499 markings/sec, 155 secs
lola: 11762557 markings, 91979894 edges, 58534 markings/sec, 160 secs
lola: 12058006 markings, 94452654 edges, 59090 markings/sec, 165 secs
lola: 12324045 markings, 96728013 edges, 53208 markings/sec, 170 secs
lola: 12609391 markings, 99178618 edges, 57069 markings/sec, 175 secs
lola: 12866352 markings, 101468485 edges, 51392 markings/sec, 180 secs
lola: 13074635 markings, 103420058 edges, 41657 markings/sec, 185 secs
lola: 13357708 markings, 105852639 edges, 56615 markings/sec, 190 secs
lola: 13619271 markings, 108183225 edges, 52313 markings/sec, 195 secs
lola: 13821484 markings, 110078155 edges, 40443 markings/sec, 200 secs
lola: 14172904 markings, 112708112 edges, 70284 markings/sec, 205 secs
lola: 14517745 markings, 115480454 edges, 68968 markings/sec, 210 secs
lola: 14855838 markings, 118185729 edges, 67619 markings/sec, 215 secs
lola: 15195491 markings, 120984239 edges, 67931 markings/sec, 220 secs
lola: 15525958 markings, 123964565 edges, 66093 markings/sec, 225 secs
lola: 15834402 markings, 126583126 edges, 61689 markings/sec, 230 secs
lola: 16206291 markings, 129416579 edges, 74378 markings/sec, 235 secs
lola: 16576409 markings, 132424472 edges, 74024 markings/sec, 240 secs
lola: 16900912 markings, 135163625 edges, 64901 markings/sec, 245 secs
lola: 17198699 markings, 137715539 edges, 59557 markings/sec, 250 secs
lola: 17496706 markings, 140310998 edges, 59601 markings/sec, 255 secs
lola: 17845180 markings, 143266552 edges, 69695 markings/sec, 260 secs
lola: 18164964 markings, 146164839 edges, 63957 markings/sec, 265 secs
lola: 18458260 markings, 148687694 edges, 58659 markings/sec, 270 secs
lola: 18753713 markings, 151452532 edges, 59091 markings/sec, 275 secs
lola: 19035872 markings, 154229455 edges, 56432 markings/sec, 280 secs
lola: 19339443 markings, 156928039 edges, 60714 markings/sec, 285 secs
lola: 19681534 markings, 159648586 edges, 68418 markings/sec, 290 secs
lola: 20035179 markings, 162485143 edges, 70729 markings/sec, 295 secs
lola: 20416505 markings, 165418893 edges, 76265 markings/sec, 300 secs
lola: 20776628 markings, 168378400 edges, 72025 markings/sec, 305 secs
lola: 21115112 markings, 171199692 edges, 67697 markings/sec, 310 secs
lola: 21457720 markings, 174119874 edges, 68522 markings/sec, 315 secs
lola: 21783872 markings, 177000439 edges, 65230 markings/sec, 320 secs
lola: 22105114 markings, 179850551 edges, 64248 markings/sec, 325 secs
lola: 22401321 markings, 182335702 edges, 59241 markings/sec, 330 secs
lola: 22674981 markings, 184861696 edges, 54732 markings/sec, 335 secs
lola: 22950135 markings, 187323501 edges, 55031 markings/sec, 340 secs
lola: 23248048 markings, 190086507 edges, 59583 markings/sec, 345 secs
lola: 23543794 markings, 192857356 edges, 59149 markings/sec, 350 secs
lola: 23841655 markings, 195730376 edges, 59572 markings/sec, 355 secs
lola: 24145578 markings, 198557847 edges, 60785 markings/sec, 360 secs
lola: 24479934 markings, 201421772 edges, 66871 markings/sec, 365 secs
lola: 24750994 markings, 203889358 edges, 54212 markings/sec, 370 secs
lola: 25031340 markings, 206394681 edges, 56069 markings/sec, 375 secs
lola: 25319794 markings, 209073339 edges, 57691 markings/sec, 380 secs
lola: 25571347 markings, 211362328 edges, 50311 markings/sec, 385 secs
lola: 25804695 markings, 213625987 edges, 46670 markings/sec, 390 secs
lola: 26043996 markings, 215859920 edges, 47860 markings/sec, 395 secs
lola: 26291842 markings, 218003887 edges, 49569 markings/sec, 400 secs
lola: 26573219 markings, 220461972 edges, 56275 markings/sec, 405 secs
lola: 26831584 markings, 222771792 edges, 51673 markings/sec, 410 secs
lola: 27116907 markings, 225263055 edges, 57065 markings/sec, 415 secs
lola: 27363262 markings, 227601238 edges, 49271 markings/sec, 420 secs
lola: 27660195 markings, 230440900 edges, 59387 markings/sec, 425 secs
lola: 27940929 markings, 233170629 edges, 56147 markings/sec, 430 secs
lola: 28251632 markings, 236009609 edges, 62141 markings/sec, 435 secs
lola: 28568037 markings, 238865104 edges, 63281 markings/sec, 440 secs
lola: 28869064 markings, 241594348 edges, 60205 markings/sec, 445 secs
lola: 29137946 markings, 244297896 edges, 53776 markings/sec, 450 secs
lola: 29430223 markings, 247020768 edges, 58455 markings/sec, 455 secs
lola: 29687633 markings, 249446417 edges, 51482 markings/sec, 460 secs
lola: 30004996 markings, 252117596 edges, 63473 markings/sec, 465 secs
lola: 30275481 markings, 254641560 edges, 54097 markings/sec, 470 secs
lola: 30578117 markings, 257270967 edges, 60527 markings/sec, 475 secs
lola: 30868570 markings, 259969521 edges, 58091 markings/sec, 480 secs
lola: 31123597 markings, 262574835 edges, 51005 markings/sec, 485 secs
lola: 31397052 markings, 265113792 edges, 54691 markings/sec, 490 secs
lola: 31677995 markings, 267685398 edges, 56189 markings/sec, 495 secs
lola: 31949505 markings, 270176695 edges, 54302 markings/sec, 500 secs
lola: 32187547 markings, 272585207 edges, 47608 markings/sec, 505 secs
lola: 32441893 markings, 275047834 edges, 50869 markings/sec, 510 secs
lola: 32709622 markings, 277524757 edges, 53546 markings/sec, 515 secs
lola: 32988633 markings, 280109571 edges, 55802 markings/sec, 520 secs
lola: 33243325 markings, 282738654 edges, 50938 markings/sec, 525 secs
lola: 33541634 markings, 285625361 edges, 59662 markings/sec, 530 secs
lola: 33806384 markings, 288280865 edges, 52950 markings/sec, 535 secs
lola: 34170053 markings, 291049879 edges, 72734 markings/sec, 540 secs
lola: 34499269 markings, 293733886 edges, 65843 markings/sec, 545 secs
lola: 34847291 markings, 296484339 edges, 69604 markings/sec, 550 secs
lola: 35300727 markings, 299715583 edges, 90687 markings/sec, 555 secs
lola: 35684960 markings, 302696406 edges, 76847 markings/sec, 560 secs
lola: 36027371 markings, 305587918 edges, 68482 markings/sec, 565 secs
lola: 36402260 markings, 308481325 edges, 74978 markings/sec, 570 secs
lola: 36715904 markings, 311360523 edges, 62729 markings/sec, 575 secs
lola: 37046957 markings, 314256603 edges, 66211 markings/sec, 580 secs
lola: 37373891 markings, 317067897 edges, 65387 markings/sec, 585 secs
lola: 37689214 markings, 319710645 edges, 63065 markings/sec, 590 secs
lola: 37986843 markings, 322313429 edges, 59526 markings/sec, 595 secs
lola: 38315086 markings, 325131425 edges, 65649 markings/sec, 600 secs
lola: 38715183 markings, 328275662 edges, 80019 markings/sec, 605 secs
lola: 39060937 markings, 331181885 edges, 69151 markings/sec, 610 secs
lola: 39360696 markings, 334086612 edges, 59952 markings/sec, 615 secs
lola: 39684403 markings, 336806493 edges, 64741 markings/sec, 620 secs
lola: 39979681 markings, 339666570 edges, 59056 markings/sec, 625 secs
lola: 40271218 markings, 342511803 edges, 58307 markings/sec, 630 secs
lola: 40532544 markings, 345067895 edges, 52265 markings/sec, 635 secs
lola: 40866430 markings, 347869234 edges, 66777 markings/sec, 640 secs
lola: 41168627 markings, 350511588 edges, 60439 markings/sec, 645 secs
lola: 41459583 markings, 353093205 edges, 58191 markings/sec, 650 secs
lola: 41886212 markings, 356276432 edges, 85326 markings/sec, 655 secs
lola: 42271992 markings, 359331274 edges, 77156 markings/sec, 660 secs
lola: add low 49
lola: add low 50
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: 42604421 markings, 362123585 edges
lola: ========================================
lola: subprocess 10 will run for 1448 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((((p111 <= 0)) OR ((G (((1 <= p144))) AND F (((p111 <= 0)))) OR G (((p58 <= 0)))))) AND ((1 <= p28))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((((p111 <= 0)) OR ((G (((1 <= p144))) AND F (((p111 <= 0)))) OR G (((p58 <= 0)))))) AND ((1 <= p28))))
lola: processed formula length: 109
lola: 85 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 28 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: 342180 markings, 3337420 edges, 68436 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 462626 markings, 5004702 edges
lola: ========================================
lola: subprocess 11 will run for 2889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((((p88 <= 0)) R (((p110 <= 0)) AND ((p24 <= 0)))) AND ((p185 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((((p88 <= 0)) R (((p110 <= 0)) AND ((p24 <= 0)))) AND ((p185 <= 0)))))
lola: processed formula length: 77
lola: 85 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: 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: 86 markings, 86 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no yes no no no
lola:
preliminary result: no no no no no no no no yes no no no
lola: memory consumption: 32720 KB
lola: time consumption: 681 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="BusinessProcesses-PT-01"
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 BusinessProcesses-PT-01, 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 r037-tajo-162038177000162"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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