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.r113-smll-162075355700130.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is GPPP-PT-C0100N0000010000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r113-smll-162075355700130
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 102K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 28 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 11:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 11:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 22 19:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 19:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 17 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1 May 5 16:51 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0100N0000010000-00
FORMULA_NAME GPPP-PT-C0100N0000010000-01
FORMULA_NAME GPPP-PT-C0100N0000010000-02
FORMULA_NAME GPPP-PT-C0100N0000010000-03
FORMULA_NAME GPPP-PT-C0100N0000010000-04
FORMULA_NAME GPPP-PT-C0100N0000010000-05
FORMULA_NAME GPPP-PT-C0100N0000010000-06
FORMULA_NAME GPPP-PT-C0100N0000010000-07
FORMULA_NAME GPPP-PT-C0100N0000010000-08
FORMULA_NAME GPPP-PT-C0100N0000010000-09
FORMULA_NAME GPPP-PT-C0100N0000010000-10
FORMULA_NAME GPPP-PT-C0100N0000010000-11
FORMULA_NAME GPPP-PT-C0100N0000010000-12
FORMULA_NAME GPPP-PT-C0100N0000010000-13
FORMULA_NAME GPPP-PT-C0100N0000010000-14
FORMULA_NAME GPPP-PT-C0100N0000010000-15

=== Now, execution of the tool begins

BK_START 1620958469592

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-14 02:14:32] [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-14 02:14:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 02:14:33] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2021-05-14 02:14:33] [INFO ] Transformed 33 places.
[2021-05-14 02:14:33] [INFO ] Transformed 22 transitions.
[2021-05-14 02:14:33] [INFO ] Parsed PT model containing 33 places and 22 transitions in 145 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 30 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100296 steps, including 34 resets, run finished after 139 ms. (steps per millisecond=721 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 22 rows 33 cols
[2021-05-14 02:14:33] [INFO ] Computed 12 place invariants in 7 ms
[2021-05-14 02:14:33] [INFO ] [Real]Absence check using 6 positive place invariants in 21 ms returned sat
[2021-05-14 02:14:33] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned unsat
[2021-05-14 02:14:33] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2021-05-14 02:14:33] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-14 02:14:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 02:14:33] [INFO ] [Real]Absence check using state equation in 35 ms returned unsat
[2021-05-14 02:14:33] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2021-05-14 02:14:33] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2021-05-14 02:14:33] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-14 02:14:33] [INFO ] Flatten gal took : 38 ms
FORMULA GPPP-PT-C0100N0000010000-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000010000-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000010000-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 02:14:33] [INFO ] Flatten gal took : 10 ms
[2021-05-14 02:14:33] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2021-05-14 02:14:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ GPPP-PT-C0100N0000010000 @ 3569 seconds

FORMULA GPPP-PT-C0100N0000010000-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0100N0000010000-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0100N0000010000-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0100N0000010000-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0100N0000010000-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0100N0000010000-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0100N0000010000-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0100N0000010000-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0100N0000010000-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0100N0000010000-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0100N0000010000-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0100N0000010000-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0100N0000010000-09 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2644
rslt: Output for LTLFireability @ GPPP-PT-C0100N0000010000

{
"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=3569",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri May 14 02:14:35 2021
",
"timelimit": 3569
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 262
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"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": 3,
"visible_transitions": 0
},
"processed": "X (((p20 <= 0) OR (X (F ((1 <= p17))) AND G (((p14 <= 0))))))",
"processed_size": 61,
"rewrites": 53
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"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": 284
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (((p7 <= 1) OR (G ((2 <= p7)) AND (((1 <= p14)) AND ((1 <= p26))))))",
"processed_size": 70,
"rewrites": 53
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"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": 310
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 310
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"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": "((p15 <= 0) OR (p27 <= 299))",
"processed_size": 29,
"rewrites": 53
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 340
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 2,
"X": 3,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X ((((X (((1 <= p24) U X (((1 <= p3) AND (1 <= p23))))) OR ((1 <= p8) AND (1 <= p30))) U (1 <= p24)) AND G (((1 <= p5)))))",
"processed_size": 122,
"rewrites": 53
},
"result":
{
"edges": 2810,
"markings": 2810,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 383
},
"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 <= p12)))",
"processed_size": 18,
"rewrites": 53
},
"result":
{
"edges": 2812,
"markings": 2811,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 438
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"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": "G (F (((1 <= p19) AND (1 <= p22))))",
"processed_size": 35,
"rewrites": 53
},
"result":
{
"edges": 20,
"markings": 20,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"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": 511
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F (((1 <= p20) OR ((1 <= p8) AND (200 <= p29)))))",
"processed_size": 53,
"rewrites": 53
},
"result":
{
"edges": 806,
"markings": 806,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"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": 613
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((G (((p14 <= 0))) OR (p7 <= 1))))",
"processed_size": 39,
"rewrites": 53
},
"result":
{
"edges": 47126,
"markings": 14386,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 8,
"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": 767
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 3,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F (((((p19 <= 0) OR (p22 <= 0)) R ((1 <= p19) AND (1 <= p22))) OR (F (((1 <= p14))) OR ((1 <= p14))))))",
"processed_size": 107,
"rewrites": 53
},
"result":
{
"edges": 4071,
"markings": 3662,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1022
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G ((((1 <= p9) AND (1 <= p10)) OR ((G ((2 <= p7)) AND F (((1 <= p9) AND (1 <= p10)))) OR F (((1 <= p17) OR (2 <= p7)))))))",
"processed_size": 126,
"rewrites": 53
},
"result":
{
"edges": 2972,
"markings": 2935,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"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": 1534
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"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": 5,
"visible_transitions": 0
},
"processed": "F ((F (((1 <= p15) AND (300 <= p27))) AND (F (((1 <= p5))) OR ((1 <= p8) AND (1 <= p30)))))",
"processed_size": 91,
"rewrites": 53
},
"result":
{
"edges": 412,
"markings": 412,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 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": 1,
"adisj": 0,
"aneg": 0,
"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": "((1 <= p15) AND (1 <= p28))",
"processed_size": 27,
"rewrites": 53
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"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": "F (G (((p15 <= 0) OR (p28 <= 0))))",
"processed_size": 35,
"rewrites": 53
},
"result":
{
"edges": 422,
"markings": 421,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3372,
"runtime": 924.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F(**)) : (** OR (F(**) AND F(G(**)))) : X((** OR (X(F(*)) AND G(*)))) : G(F(**)) : X((* OR (G(**) AND (** AND **)))) : F(G((G(*) OR *))) : (X(*) AND (F(**) AND **)) : X(X(X(F(**)))) : F((F(**) AND (F(**) OR **))) : X((((X((** U X(**))) OR **) U **) AND G(**))) : F(G(**)) : F(G((** OR ((G(**) AND F(**)) OR F(**))))) : G(F(((* R *) OR (F(**) OR *))))"
},
"net":
{
"arcs": 83,
"conflict_clusters": 14,
"places": 33,
"places_significant": 21,
"singleton_clusters": 0,
"transitions": 22
},
"result":
{
"preliminary_value": "no no yes no yes no no unknown no no no no no ",
"value": "no no yes no yes no no unknown no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3569 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: 55/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1056
lola: finding significant places
lola: 33 places, 22 transitions, 21 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: (2 <= p4)
lola: LP says that atomic proposition is always true: (2 <= p4)
lola: LP says that atomic proposition is always true: (1 <= p1)
lola: LP says that atomic proposition is always true: (1 <= p1)
lola: LP says that atomic proposition is always true: (1 <= p1)
lola: LP says that atomic proposition is always true: (1 <= p1)
lola: LP says that atomic proposition is always true: (1 <= p6)
lola: LP says that atomic proposition is always true: (1 <= p6)
lola: LP says that atomic proposition is always true: (1 <= p1)
lola: LP says that atomic proposition is always true: (1 <= p1)
lola: F (G (X (G (F (((1 <= p20) OR ((1 <= p8) AND (200 <= p29)))))))) : (F (G (X (((p15 <= 0) OR (p28 <= 0))))) U ((1 <= p15) AND (1 <= p28))) : X (((p20 <= 0) OR (NOT(X (G ((p17 <= 0)))) AND NOT(F (((1 <= p14))))))) : G (F (X (X (((1 <= p19) AND (1 <= p22)))))) : (NOT(X ((2 <= p7))) OR ((G (X ((2 <= p7))) AND X (((1 <= p14)))) AND X (((1 <= p26))))) : F (X (NOT(F ((F (((1 <= p14))) AND (2 <= p7)))))) : ((NOT(X ((1 <= p12))) AND F (((1 <= p11) AND (1 <= p12) AND (700 <= p31)))) AND ((p15 <= 0) OR (p27 <= 299))) : X (X (F (X (((1 <= p0) AND (1 <= p2) AND (1 <= p12) AND (1 <= p32)))))) : ((0 <= 0) U (F (((1 <= p15) AND (300 <= p27))) AND (F (((1 <= p5))) OR ((1 <= p8) AND (1 <= p30))))) : X ((((X (((1 <= p24) U X (((1 <= p3) AND (1 <= p23))))) OR ((1 <= p8) AND (1 <= p30))) U (1 <= p24)) AND G (((1 <= p5))))) : F (G ((1 <= p12))) : F (G (((G ((2 <= p7)) U ((1 <= p9) AND (1 <= p10))) OR F ((((1 <= p9) AND (1 <= p10)) U ((1 <= p17) OR (2 <= p7))))))) : G (NOT(G ((((((1 <= p19) AND (1 <= p22)) U ((p19 <= 0) OR (p22 <= 0))) AND NOT(F (((1 <= p14))))) AND ((p14 <= 0))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:371
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:428
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 262 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p20 <= 0) OR (X (F ((1 <= p17))) AND G (((p14 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p20 <= 0) OR (X (F ((1 <= p17))) AND G (((p14 <= 0))))))
lola: processed formula length: 61
lola: 53 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 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 284 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p7 <= 1) OR (G ((2 <= p7)) AND (((1 <= p14)) AND ((1 <= p26))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p7 <= 1) OR (G ((2 <= p7)) AND (((1 <= p14)) AND ((1 <= p26))))))
lola: processed formula length: 70
lola: 53 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 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: 4 markings, 3 edges
lola: ========================================
lola: subprocess 2 will run for 310 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((p12 <= 0)) AND (F (((1 <= p11) AND (1 <= p12) AND (700 <= p31))) AND ((p15 <= 0) OR (p27 <= 299))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 310 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p15 <= 0) OR (p27 <= 299))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p15 <= 0) OR (p27 <= 299))
lola: processed formula length: 29
lola: 53 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 341 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p11) AND (1 <= p12) AND (700 <= p31)))
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: ((p11 <= 0) OR (p12 <= 0) OR (p31 <= 699))
lola: processed formula length: 44
lola: 55 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: 2798 markings, 2798 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 341 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (F (((1 <= p0) AND (1 <= p2) AND (1 <= p12) AND (1 <= p32))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (F (((1 <= p0) AND (1 <= p2) AND (1 <= p12) AND (1 <= p32))))))
lola: processed formula length: 71
lola: 53 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: 2200848 markings, 3842081 edges, 440170 markings/sec, 0 secs
lola: 4265471 markings, 7740230 edges, 412925 markings/sec, 5 secs
lola: 6304047 markings, 11576178 edges, 407715 markings/sec, 10 secs
lola: 8276136 markings, 15362660 edges, 394418 markings/sec, 15 secs
lola: 10210783 markings, 19110969 edges, 386929 markings/sec, 20 secs
lola: 12075395 markings, 22794625 edges, 372922 markings/sec, 25 secs
lola: 13986522 markings, 26462319 edges, 382225 markings/sec, 30 secs
lola: 15840558 markings, 30017437 edges, 370807 markings/sec, 35 secs
lola: 17690126 markings, 33706127 edges, 369914 markings/sec, 40 secs
lola: 19560416 markings, 37295133 edges, 374058 markings/sec, 45 secs
lola: 21546309 markings, 41115709 edges, 397179 markings/sec, 50 secs
lola: 23363680 markings, 44740385 edges, 363474 markings/sec, 55 secs
lola: 25300584 markings, 48464915 edges, 387381 markings/sec, 60 secs
lola: 27047439 markings, 51948506 edges, 349371 markings/sec, 65 secs
lola: 28933017 markings, 55572223 edges, 377116 markings/sec, 70 secs
lola: 30628612 markings, 58953413 edges, 339119 markings/sec, 75 secs
lola: 32498532 markings, 62547253 edges, 373984 markings/sec, 80 secs
lola: 34166259 markings, 65872766 edges, 333545 markings/sec, 85 secs
lola: 35985192 markings, 69427618 edges, 363787 markings/sec, 90 secs
lola: 37644114 markings, 72674076 edges, 331784 markings/sec, 95 secs
lola: 39331773 markings, 76039439 edges, 337532 markings/sec, 100 secs
lola: 41175097 markings, 79582728 edges, 368665 markings/sec, 105 secs
lola: 42823491 markings, 82869831 edges, 329679 markings/sec, 110 secs
lola: 44639736 markings, 86413965 edges, 363249 markings/sec, 115 secs
lola: 46342045 markings, 89754864 edges, 340462 markings/sec, 120 secs
lola: 47990061 markings, 93041068 edges, 329603 markings/sec, 125 secs
lola: 49822188 markings, 96563960 edges, 366425 markings/sec, 130 secs
lola: 51496523 markings, 99903402 edges, 334867 markings/sec, 135 secs
lola: 53236733 markings, 103373029 edges, 348042 markings/sec, 140 secs
lola: 55106057 markings, 106971673 edges, 373865 markings/sec, 145 secs
lola: 56796246 markings, 110342585 edges, 338038 markings/sec, 150 secs
lola: 58570941 markings, 113880648 edges, 354939 markings/sec, 155 secs
lola: 60391677 markings, 117383831 edges, 364147 markings/sec, 160 secs
lola: 62067546 markings, 120726293 edges, 335174 markings/sec, 165 secs
lola: 63851307 markings, 124282148 edges, 356752 markings/sec, 170 secs
lola: 65661795 markings, 127766335 edges, 362098 markings/sec, 175 secs
lola: 67337766 markings, 131108357 edges, 335194 markings/sec, 180 secs
lola: 69108384 markings, 134638196 edges, 354124 markings/sec, 185 secs
lola: 70928151 markings, 138141976 edges, 363953 markings/sec, 190 secs
lola: 72589755 markings, 141455772 edges, 332321 markings/sec, 195 secs
lola: 74328183 markings, 144921352 edges, 347686 markings/sec, 200 secs
lola: 76185064 markings, 148499945 edges, 371376 markings/sec, 205 secs
lola: 77843994 markings, 151808629 edges, 331786 markings/sec, 210 secs
lola: 79545406 markings, 155200739 edges, 340282 markings/sec, 215 secs
lola: 81424914 markings, 158825056 edges, 375902 markings/sec, 220 secs
lola: 83070775 markings, 162107678 edges, 329172 markings/sec, 225 secs
lola: 84745281 markings, 165446037 edges, 334901 markings/sec, 230 secs
lola: 86608134 markings, 169086522 edges, 372571 markings/sec, 235 secs
lola: 88307130 markings, 172426282 edges, 339799 markings/sec, 240 secs
lola: 89960178 markings, 175722516 edges, 330610 markings/sec, 245 secs
lola: 91698984 markings, 179188741 edges, 347761 markings/sec, 250 secs
lola: 93530078 markings, 182719332 edges, 366219 markings/sec, 255 secs
lola: 95150457 markings, 185951064 edges, 324076 markings/sec, 260 secs
lola: 96820660 markings, 189280832 edges, 334041 markings/sec, 265 secs
lola: 98627498 markings, 192850697 edges, 361368 markings/sec, 270 secs
lola: 100337049 markings, 196172235 edges, 341910 markings/sec, 275 secs
lola: 101963244 markings, 199415279 edges, 325239 markings/sec, 280 secs
lola: 103663926 markings, 202805444 edges, 340136 markings/sec, 285 secs
lola: 105519681 markings, 206386888 edges, 371151 markings/sec, 290 secs
lola: 107052405 markings, 209443501 edges, 306545 markings/sec, 295 secs
lola: 108485508 markings, 212301687 edges, 286621 markings/sec, 300 secs
lola: 109386357 markings, 214097418 edges, 180170 markings/sec, 305 secs
lola: 110777517 markings, 216870024 edges, 278232 markings/sec, 310 secs
lola: 111645491 markings, 218503204 edges, 173595 markings/sec, 315 secs
lola: 111924825 markings, 219040048 edges, 55867 markings/sec, 320 secs
lola: 112289961 markings, 219768335 edges, 73027 markings/sec, 325 secs
lola: 112616907 markings, 220420084 edges, 65389 markings/sec, 330 secs
lola: 113118227 markings, 221419912 edges, 100264 markings/sec, 335 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown yes unknown yes unknown no unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 340 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((X (((1 <= p24) U X (((1 <= p3) AND (1 <= p23))))) OR ((1 <= p8) AND (1 <= p30))) U (1 <= p24)) AND G (((1 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((X (((1 <= p24) U X (((1 <= p3) AND (1 <= p23))))) OR ((1 <= p8) AND (1 <= p30))) U (1 <= p24)) AND G (((1 <= p5)))))
lola: processed formula length: 122
lola: 53 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 2810 markings, 2810 edges
lola: ========================================
lola: subprocess 5 will run for 383 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p12)))
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 <= p12)))
lola: processed formula length: 18
lola: 53 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: add low 1
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: 2811 markings, 2812 edges
lola: ========================================
lola: subprocess 6 will run for 438 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p19) AND (1 <= p22))))
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 <= p19) AND (1 <= p22))))
lola: processed formula length: 35
lola: 53 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: 20 markings, 20 edges
lola: ========================================
lola: subprocess 7 will run for 511 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p20) OR ((1 <= p8) AND (200 <= p29)))))
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 <= p20) OR ((1 <= p8) AND (200 <= p29)))))
lola: processed formula length: 53
lola: 53 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: 806 markings, 806 edges
lola: ========================================
lola: subprocess 8 will run for 613 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G (((p14 <= 0))) OR (p7 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G (((p14 <= 0))) OR (p7 <= 1))))
lola: processed formula length: 39
lola: 53 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: 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: add low 2
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: 14386 markings, 47126 edges
lola: ========================================
lola: subprocess 9 will run for 767 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((((p19 <= 0) OR (p22 <= 0)) R ((1 <= p19) AND (1 <= p22))) OR (F (((1 <= p14))) OR ((1 <= p14))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((((p19 <= 0) OR (p22 <= 0)) R ((1 <= p19) AND (1 <= p22))) OR (F (((1 <= p14))) OR ((1 <= p14))))))
lola: processed formula length: 107
lola: 53 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: 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: 3662 markings, 4071 edges
lola: ========================================
lola: subprocess 10 will run for 1022 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((1 <= p9) AND (1 <= p10)) OR ((G ((2 <= p7)) AND F (((1 <= p9) AND (1 <= p10)))) OR F (((1 <= p17) OR (2 <= p7)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((1 <= p9) AND (1 <= p10)) OR ((G ((2 <= p7)) AND F (((1 <= p9) AND (1 <= p10)))) OR F (((1 <= p17) OR (2 <= p7)))))))
lola: processed formula length: 126
lola: 53 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 2935 markings, 2972 edges
lola: ========================================
lola: subprocess 11 will run for 1534 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (((1 <= p15) AND (300 <= p27))) AND (F (((1 <= p5))) OR ((1 <= p8) AND (1 <= p30)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (((1 <= p15) AND (300 <= p27))) AND (F (((1 <= p5))) OR ((1 <= p8) AND (1 <= p30)))))
lola: processed formula length: 91
lola: 53 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: 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: 412 markings, 412 edges
lola: ========================================
lola: subprocess 12 will run for 3068 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p15) AND (1 <= p28)) OR (F (((1 <= p15) AND (1 <= p28))) AND F (G (((p15 <= 0) OR (p28 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 3068 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p15) AND (1 <= p28))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p15) AND (1 <= p28))
lola: processed formula length: 27
lola: 53 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p15 <= 0) OR (p28 <= 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 (((p15 <= 0) OR (p28 <= 0))))
lola: processed formula length: 35
lola: 53 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: add low 1
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: 421 markings, 422 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (X (X (F (((1 <= p0) AND (1 <= p2) AND (1 <= p12) AND (1 <= p32))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (F (((1 <= p0) AND (1 <= p2) AND (1 <= p12) AND (1 <= p32))))))
lola: processed formula length: 71
lola: 53 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: 2117063 markings, 3674773 edges, 423413 markings/sec, 0 secs
lola: 4090683 markings, 7437701 edges, 394724 markings/sec, 5 secs
lola: 6136335 markings, 11268944 edges, 409130 markings/sec, 10 secs
lola: 8125716 markings, 15073168 edges, 397876 markings/sec, 15 secs
lola: 10025023 markings, 18790326 edges, 379861 markings/sec, 20 secs
lola: 11921725 markings, 22488460 edges, 379340 markings/sec, 25 secs
lola: 13836594 markings, 26163643 edges, 382974 markings/sec, 30 secs
lola: 15759813 markings, 29856273 edges, 384644 markings/sec, 35 secs
lola: 17557467 markings, 33441952 edges, 359531 markings/sec, 40 secs
lola: 19434253 markings, 37043939 edges, 375357 markings/sec, 45 secs
lola: 21239274 markings, 40565809 edges, 361004 markings/sec, 50 secs
lola: 23015715 markings, 44046606 edges, 355288 markings/sec, 55 secs
lola: 24900231 markings, 47666132 edges, 376903 markings/sec, 60 secs
lola: 26612415 markings, 51081141 edges, 342437 markings/sec, 65 secs
lola: 28499511 markings, 54707177 edges, 377419 markings/sec, 70 secs
lola: 30186876 markings, 58072646 edges, 337473 markings/sec, 75 secs
lola: 32038326 markings, 61675059 edges, 370290 markings/sec, 80 secs
lola: 33758654 markings, 65060154 edges, 344066 markings/sec, 85 secs
lola: 35498901 markings, 68530545 edges, 348049 markings/sec, 90 secs
lola: 37384556 markings, 72156435 edges, 377131 markings/sec, 95 secs
lola: 39133420 markings, 75643985 edges, 349773 markings/sec, 100 secs
lola: 41044904 markings, 79322790 edges, 382297 markings/sec, 105 secs
lola: 42750629 markings, 82724868 edges, 341145 markings/sec, 110 secs
lola: 44626926 markings, 86391800 edges, 375259 markings/sec, 115 secs
lola: 46400010 markings, 89870632 edges, 354617 markings/sec, 120 secs
lola: 48136567 markings, 93333204 edges, 347311 markings/sec, 125 secs
lola: 50025903 markings, 96970328 edges, 377867 markings/sec, 130 secs
lola: 51717582 markings, 100344155 edges, 338336 markings/sec, 135 secs
lola: 53477304 markings, 103852724 edges, 351944 markings/sec, 140 secs
lola: 55326874 markings, 107412479 edges, 369914 markings/sec, 145 secs
lola: 57013339 markings, 110775410 edges, 337293 markings/sec, 150 secs
lola: 58839181 markings, 114393754 edges, 365168 markings/sec, 155 secs
lola: 60607431 markings, 117814671 edges, 353650 markings/sec, 160 secs
lola: 62291790 markings, 121173403 edges, 336872 markings/sec, 165 secs
lola: 64152915 markings, 124823452 edges, 372225 markings/sec, 170 secs
lola: 65891964 markings, 128225284 edges, 347810 markings/sec, 175 secs
lola: 67584602 markings, 131600577 edges, 338528 markings/sec, 180 secs
lola: 69349944 markings, 135100413 edges, 353068 markings/sec, 185 secs
lola: 71117229 markings, 138519593 edges, 353457 markings/sec, 190 secs
lola: 72740994 markings, 141757291 edges, 324753 markings/sec, 195 secs
lola: 74516158 markings, 145296038 edges, 355033 markings/sec, 200 secs
lola: 76286265 markings, 148702036 edges, 354021 markings/sec, 205 secs
lola: 77968695 markings, 152056946 edges, 336486 markings/sec, 210 secs
lola: 79635316 markings, 155379638 edges, 333324 markings/sec, 215 secs
lola: 81509787 markings, 158994610 edges, 374894 markings/sec, 220 secs
lola: 83163607 markings, 162292337 edges, 330764 markings/sec, 225 secs
lola: 84861165 markings, 165677458 edges, 339512 markings/sec, 230 secs
lola: 86755077 markings, 169340844 edges, 378782 markings/sec, 235 secs
lola: 88420734 markings, 172653199 edges, 333131 markings/sec, 240 secs
lola: 90114555 markings, 176030201 edges, 338764 markings/sec, 245 secs
lola: 91880513 markings, 179550555 edges, 353192 markings/sec, 250 secs
lola: 93698769 markings, 183055556 edges, 363651 markings/sec, 255 secs
lola: 95347545 markings, 186343921 edges, 329755 markings/sec, 260 secs
lola: 97054524 markings, 189747158 edges, 341396 markings/sec, 265 secs
lola: 98944897 markings, 193399159 edges, 378075 markings/sec, 270 secs
lola: 100517677 markings, 196532692 edges, 314556 markings/sec, 275 secs
lola: 102181546 markings, 199850522 edges, 332774 markings/sec, 280 secs
lola: 103913270 markings, 203302527 edges, 346345 markings/sec, 285 secs
lola: 105748958 markings, 206844021 edges, 367138 markings/sec, 290 secs
lola: 107368245 markings, 210073557 edges, 323857 markings/sec, 295 secs
lola: 108909597 markings, 213147624 edges, 308270 markings/sec, 300 secs
lola: 110033564 markings, 215388529 edges, 224793 markings/sec, 305 secs
lola: 111398322 markings, 218076332 edges, 272952 markings/sec, 310 secs
lola: 111726960 markings, 218645161 edges, 65728 markings/sec, 315 secs
lola: 112029180 markings, 219247879 edges, 60444 markings/sec, 320 secs
lola: 112384257 markings, 219956132 edges, 71015 markings/sec, 325 secs
lola: 112834086 markings, 220853627 edges, 89966 markings/sec, 330 secs
lola: 113367618 markings, 221917300 edges, 106706 markings/sec, 335 secs
lola: 114317097 markings, 223811138 edges, 189896 markings/sec, 340 secs
lola: 115794588 markings, 226756756 edges, 295498 markings/sec, 345 secs
lola: 116935683 markings, 229031373 edges, 228219 markings/sec, 350 secs
lola: 118267245 markings, 231582950 edges, 266312 markings/sec, 355 secs
lola: 119394435 markings, 233817347 edges, 225438 markings/sec, 360 secs
lola: 120505185 markings, 236032027 edges, 222150 markings/sec, 365 secs
lola: 121861948 markings, 238737315 edges, 271353 markings/sec, 370 secs
lola: 123343878 markings, 241691775 edges, 296386 markings/sec, 375 secs
lola: 124650724 markings, 244288405 edges, 261369 markings/sec, 380 secs
lola: 125867293 markings, 246607332 edges, 243314 markings/sec, 385 secs
lola: 127139295 markings, 249143992 edges, 254400 markings/sec, 390 secs
lola: 128358376 markings, 251574451 edges, 243816 markings/sec, 395 secs
lola: 129667023 markings, 254183464 edges, 261729 markings/sec, 400 secs
lola: 131023176 markings, 256886230 edges, 271231 markings/sec, 405 secs
lola: 132568626 markings, 259853258 edges, 309090 markings/sec, 410 secs
lola: 133666604 markings, 262043109 edges, 219596 markings/sec, 415 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no yes no yes no no unknown no no no no no
lola:
preliminary result: no no yes no yes no no unknown no no no no no
lola: memory consumption: 3372 KB
lola: time consumption: 924 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="GPPP-PT-C0100N0000010000"
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 GPPP-PT-C0100N0000010000, 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 r113-smll-162075355700130"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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