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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 20K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 177K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 86K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 27 14:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 14:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 20:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 20:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 3.9K May 5 16:52 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 SwimmingPool-PT-07-00
FORMULA_NAME SwimmingPool-PT-07-01
FORMULA_NAME SwimmingPool-PT-07-02
FORMULA_NAME SwimmingPool-PT-07-03
FORMULA_NAME SwimmingPool-PT-07-04
FORMULA_NAME SwimmingPool-PT-07-05
FORMULA_NAME SwimmingPool-PT-07-06
FORMULA_NAME SwimmingPool-PT-07-07
FORMULA_NAME SwimmingPool-PT-07-08
FORMULA_NAME SwimmingPool-PT-07-09
FORMULA_NAME SwimmingPool-PT-07-10
FORMULA_NAME SwimmingPool-PT-07-11
FORMULA_NAME SwimmingPool-PT-07-12
FORMULA_NAME SwimmingPool-PT-07-13
FORMULA_NAME SwimmingPool-PT-07-14
FORMULA_NAME SwimmingPool-PT-07-15

=== Now, execution of the tool begins

BK_START 1621226463992

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

FORMULA SwimmingPool-PT-07-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA SwimmingPool-PT-07-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-07-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-07-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-07-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-07-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-07-08 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-07-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2653
rslt: Output for LTLCardinality @ SwimmingPool-PT-07

{
"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=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Mon May 17 04:41:07 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"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": 3,
"visible_transitions": 0
},
"processed": "X (X ((G ((p6 + 1 <= p8)) AND (p6 + 1 <= p3))))",
"processed_size": 47,
"rewrites": 63
},
"result":
{
"edges": 146,
"markings": 146,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((X (X (G ((p2 + 1 <= p6)))) OR (p8 <= 2)))",
"processed_size": 45,
"rewrites": 63
},
"result":
{
"edges": 148,
"markings": 148,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 4,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G ((F (((p0 + 1 <= p4) R (p6 + 1 <= p2))) AND ((G ((1 <= p6)) AND ((p2 <= p6) AND ((p4 <= p0) AND (p1 <= p0)))) OR X (((p0 + 1 <= p4) R (p6 + 1 <= p2))))))",
"processed_size": 155,
"rewrites": 63
},
"result":
{
"edges": 146,
"markings": 146,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 518
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"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": 3,
"visible_transitions": 0
},
"processed": "F ((X (F (((1 <= p6) OR G ((p6 <= p2))))) AND ((p0 <= 0) OR (p6 <= 0))))",
"processed_size": 73,
"rewrites": 63
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 622
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((p2 <= 2) AND F ((G ((p2 + 1 <= p8)) AND (F ((p2 <= 2)) OR G ((p2 + 1 <= p8)))))))",
"processed_size": 86,
"rewrites": 63
},
"result":
{
"edges": 93454,
"markings": 67134,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"compoundnumber": 5,
"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": 778
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1037
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((p5 <= p6))",
"processed_size": 14,
"rewrites": 63
},
"result":
{
"edges": 500,
"markings": 500,
"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": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1556
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((p6 + 1 <= p5)))",
"processed_size": 22,
"rewrites": 63
},
"result":
{
"edges": 639,
"markings": 603,
"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": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1037
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((p5 <= p2))",
"processed_size": 14,
"rewrites": 63
},
"result":
{
"edges": 502,
"markings": 502,
"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": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1555
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((p1 <= p3)))",
"processed_size": 18,
"rewrites": 63
},
"result":
{
"edges": 163,
"markings": 161,
"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": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3111
},
"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": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p4 <= 1) OR (p4 <= 0) OR (p3 + 1 <= p1))",
"processed_size": 44,
"rewrites": 65
},
"result":
{
"edges": 146,
"markings": 146,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

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

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

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((p1 <= p6))",
"processed_size": 14,
"rewrites": 63
},
"result":
{
"edges": 496,
"markings": 496,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((F ((p1 <= p6)) AND ((((p6 <= p3) AND (p1 <= 1)) OR (1 <= p5)) OR (p1 <= p6))))",
"processed_size": 83,
"rewrites": 63
},
"result":
{
"edges": 94844,
"markings": 37478,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3716,
"runtime": 917.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(X((G(*) AND **))) : X((X(X(G(*))) OR **)) : (F(**) OR (G(F(**)) AND F(**))) : (* AND (G(*) OR G(F(*)))) : G((F((* R *)) AND ((G(**) AND (** AND (** AND **))) OR X((* R *))))) : F(G((X(**) OR (G(F(**)) AND X(*))))) : (G((F(**) AND (** OR **))) OR G(**)) : F((X(F((** OR G(**)))) AND **)) : G((* AND F((G(*) AND (F(*) OR G(*)))))) : (F(**) AND G(**))"
},
"net":
{
"arcs": 20,
"conflict_clusters": 6,
"places": 9,
"places_significant": 6,
"singleton_clusters": 0,
"transitions": 7
},
"result":
{
"preliminary_value": "no no no no no unknown no yes no no ",
"value": "no no no no no unknown no yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 16/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 7 transitions, 6 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: X (X ((NOT(F ((p8 <= p6))) AND (p6 + 1 <= p3)))) : X ((NOT(F (X (F (X ((p6 <= p2)))))) OR (p8 <= 2))) : (G (F ((p1 <= p3))) U F (((2 <= p4) AND (1 <= p4) AND (p1 <= p3)))) : NOT((F (G ((p5 <= p6))) U (p6 + 1 <= p5))) : G (((((G ((1 <= p6)) AND (p2 <= p6)) AND (p4 <= p0)) AND (p1 <= p0)) U NOT(X (((p4 <= p0) U (p2 <= p6)))))) : F (G ((X ((2 <= p7)) OR (G (F ((3 <= p8))) AND NOT(X ((p8 <= p1))))))) : (G (((((p6 <= p3) AND (p1 <= 1)) OR (1 <= p5)) U (p1 <= p6))) OR G ((p1 <= p6))) : F ((NOT(X ((NOT(F ((1 <= p6))) AND G (NOT(G ((p6 <= p2))))))) AND ((p0 <= 0) OR (p6 <= 0)))) : (NOT(F ((3 <= p2))) AND NOT(F (G ((G ((3 <= p2)) U F ((p8 <= p2))))))) : (F ((p1 <= p5)) AND G ((p5 <= p2)))
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:332
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((G ((p6 + 1 <= p8)) AND (p6 + 1 <= p3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((G ((p6 + 1 <= p8)) AND (p6 + 1 <= p3))))
lola: processed formula length: 47
lola: 63 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 146 markings, 146 edges
lola: ========================================
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (X (G ((p2 + 1 <= p6)))) OR (p8 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (X (G ((p2 + 1 <= p6)))) OR (p8 <= 2)))
lola: processed formula length: 45
lola: 63 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 148 markings, 148 edges
lola: ========================================
lola: subprocess 2 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (((p0 + 1 <= p4) R (p6 + 1 <= p2))) AND ((G ((1 <= p6)) AND ((p2 <= p6) AND ((p4 <= p0) AND (p1 <= p0)))) OR X (((p0 + 1 <= p4) R (p6 + 1 <= p2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (((p0 + 1 <= p4) R (p6 + 1 <= p2))) AND ((G ((1 <= p6)) AND ((p2 <= p6) AND ((p4 <= p0) AND (p1 <= p0)))) OR X (((p0 + 1 <= p4) R (p6 + 1 <= p2))))))
lola: processed formula length: 155
lola: 63 rewrites
lola: closed formula file LTLCardinality.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: 146 markings, 146 edges
lola: ========================================
lola: subprocess 3 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X ((2 <= p7)) OR (G (F ((3 <= p8))) AND X ((p1 + 1 <= p8))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X ((2 <= p7)) OR (G (F ((3 <= p8))) AND X ((p1 + 1 <= p8))))))
lola: processed formula length: 69
lola: 63 rewrites
lola: closed formula file LTLCardinality.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: 2214462 markings, 7199950 edges, 442892 markings/sec, 0 secs
lola: 4081969 markings, 13676171 edges, 373501 markings/sec, 5 secs
lola: 5771224 markings, 19603804 edges, 337851 markings/sec, 10 secs
lola: 7404300 markings, 25373247 edges, 326615 markings/sec, 15 secs
lola: 8998329 markings, 31031191 edges, 318806 markings/sec, 20 secs
lola: 10573830 markings, 36635083 edges, 315100 markings/sec, 25 secs
lola: 12168918 markings, 42338578 edges, 319018 markings/sec, 30 secs
lola: 13863876 markings, 48407043 edges, 338992 markings/sec, 35 secs
lola: 15383337 markings, 53863829 edges, 303892 markings/sec, 40 secs
lola: 17024403 markings, 59774629 edges, 328213 markings/sec, 45 secs
lola: 18776805 markings, 66086113 edges, 350480 markings/sec, 50 secs
lola: 20514735 markings, 72365539 edges, 347586 markings/sec, 55 secs
lola: 22091299 markings, 78062659 edges, 315313 markings/sec, 60 secs
lola: 23564780 markings, 83390156 edges, 294696 markings/sec, 65 secs
lola: 25095990 markings, 88943795 edges, 306242 markings/sec, 70 secs
lola: 26538238 markings, 94168484 edges, 288450 markings/sec, 75 secs
lola: 28151320 markings, 100028745 edges, 322616 markings/sec, 80 secs
lola: 29591392 markings, 105268185 edges, 288014 markings/sec, 85 secs
lola: 31050129 markings, 110574464 edges, 291747 markings/sec, 90 secs
lola: 32593899 markings, 116184406 edges, 308754 markings/sec, 95 secs
lola: 34172444 markings, 121946055 edges, 315709 markings/sec, 100 secs
lola: 35774088 markings, 127782135 edges, 320329 markings/sec, 105 secs
lola: 37381539 markings, 133644385 edges, 321490 markings/sec, 110 secs
lola: 38986727 markings, 139498552 edges, 321038 markings/sec, 115 secs
lola: 40577020 markings, 145311681 edges, 318059 markings/sec, 120 secs
lola: 42160161 markings, 151111809 edges, 316628 markings/sec, 125 secs
lola: 43666702 markings, 156611675 edges, 301308 markings/sec, 130 secs
lola: 45057514 markings, 161690527 edges, 278162 markings/sec, 135 secs
lola: 46455417 markings, 166810309 edges, 279581 markings/sec, 140 secs
lola: 47873951 markings, 172005240 edges, 283707 markings/sec, 145 secs
lola: 49298901 markings, 177220265 edges, 284990 markings/sec, 150 secs
lola: 50723307 markings, 182451081 edges, 284881 markings/sec, 155 secs
lola: 52157559 markings, 187714283 edges, 286850 markings/sec, 160 secs
lola: 53595415 markings, 192990249 edges, 287571 markings/sec, 165 secs
lola: 55042308 markings, 198294145 edges, 289379 markings/sec, 170 secs
lola: 56497666 markings, 203628465 edges, 291072 markings/sec, 175 secs
lola: 57948875 markings, 208954306 edges, 290242 markings/sec, 180 secs
lola: 59395157 markings, 214261735 edges, 289256 markings/sec, 185 secs
lola: 60841611 markings, 219582595 edges, 289291 markings/sec, 190 secs
lola: 62291527 markings, 224920309 edges, 289983 markings/sec, 195 secs
lola: 63732337 markings, 230228367 edges, 288162 markings/sec, 200 secs
lola: 65182511 markings, 235565561 edges, 290035 markings/sec, 205 secs
lola: 66628585 markings, 240899099 edges, 289215 markings/sec, 210 secs
lola: 68083372 markings, 246248338 edges, 290957 markings/sec, 215 secs
lola: 69536717 markings, 251585413 edges, 290669 markings/sec, 220 secs
lola: 70983059 markings, 256917165 edges, 289268 markings/sec, 225 secs
lola: 72423334 markings, 262223108 edges, 288055 markings/sec, 230 secs
lola: 73866889 markings, 267550028 edges, 288711 markings/sec, 235 secs
lola: 75314199 markings, 272883288 edges, 289462 markings/sec, 240 secs
lola: 76735913 markings, 278133251 edges, 284343 markings/sec, 245 secs
lola: 78185619 markings, 283475064 edges, 289941 markings/sec, 250 secs
lola: 79626071 markings, 288786460 edges, 288090 markings/sec, 255 secs
lola: 81067717 markings, 294107329 edges, 288329 markings/sec, 260 secs
lola: 82511778 markings, 299434411 edges, 288812 markings/sec, 265 secs
lola: 83949275 markings, 304744691 edges, 287499 markings/sec, 270 secs
lola: 85379820 markings, 310034275 edges, 286109 markings/sec, 275 secs
lola: 86822563 markings, 315356499 edges, 288549 markings/sec, 280 secs
lola: 88251347 markings, 320640450 edges, 285757 markings/sec, 285 secs
lola: 89672629 markings, 325899095 edges, 284256 markings/sec, 290 secs
lola: 91109087 markings, 331195865 edges, 287292 markings/sec, 295 secs
lola: 92536449 markings, 336477829 edges, 285472 markings/sec, 300 secs
lola: 93905801 markings, 341532017 edges, 273870 markings/sec, 305 secs
lola: 95196921 markings, 346323564 edges, 258224 markings/sec, 310 secs
lola: 96527195 markings, 351234428 edges, 266055 markings/sec, 315 secs
lola: 97866249 markings, 356183020 edges, 267811 markings/sec, 320 secs
lola: 99207398 markings, 361135729 edges, 268230 markings/sec, 325 secs
lola: 100566630 markings, 366167131 edges, 271846 markings/sec, 330 secs
lola: 101884310 markings, 371039591 edges, 263536 markings/sec, 335 secs
lola: 102984960 markings, 375121211 edges, 220130 markings/sec, 340 secs
lola: 104180958 markings, 379551085 edges, 239200 markings/sec, 345 secs
lola: 105296674 markings, 383684072 edges, 223143 markings/sec, 350 secs
lola: 106429134 markings, 387887987 edges, 226492 markings/sec, 355 secs
lola: 107510854 markings, 391897065 edges, 216344 markings/sec, 360 secs
lola: 108554804 markings, 395765761 edges, 208790 markings/sec, 365 secs
lola: 109567439 markings, 399518373 edges, 202527 markings/sec, 370 secs
lola: 110867025 markings, 404327656 edges, 259917 markings/sec, 375 secs
lola: 111846579 markings, 407951591 edges, 195911 markings/sec, 380 secs
lola: 113121275 markings, 412678973 edges, 254939 markings/sec, 385 secs
lola: 114215649 markings, 416741958 edges, 218875 markings/sec, 390 secs
lola: 115297137 markings, 420745771 edges, 216298 markings/sec, 395 secs
lola: 116205674 markings, 424128779 edges, 181707 markings/sec, 400 secs
lola: 117377842 markings, 428468969 edges, 234434 markings/sec, 405 secs
lola: 118111514 markings, 431185199 edges, 146734 markings/sec, 410 secs
lola: 119156806 markings, 435067171 edges, 209058 markings/sec, 415 secs
lola: 120290136 markings, 439279575 edges, 226666 markings/sec, 420 secs
lola: 121394710 markings, 443375865 edges, 220915 markings/sec, 425 secs
lola: 122678532 markings, 448137095 edges, 256764 markings/sec, 430 secs
lola: 123550228 markings, 451372667 edges, 174339 markings/sec, 435 secs
lola: 124763094 markings, 455862659 edges, 242573 markings/sec, 440 secs
lola: 126196752 markings, 461183767 edges, 286732 markings/sec, 445 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 518 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (F (((1 <= p6) OR G ((p6 <= p2))))) AND ((p0 <= 0) OR (p6 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (F (((1 <= p6) OR G ((p6 <= p2))))) AND ((p0 <= 0) OR (p6 <= 0))))
lola: processed formula length: 73
lola: 63 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 5 will run for 622 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p2 <= 2) AND F ((G ((p2 + 1 <= p8)) AND (F ((p2 <= 2)) OR G ((p2 + 1 <= p8)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p2 <= 2) AND F ((G ((p2 + 1 <= p8)) AND (F ((p2 <= 2)) OR G ((p2 + 1 <= p8)))))))
lola: processed formula length: 86
lola: 63 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 12 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: 67134 markings, 93454 edges
lola: ========================================
lola: subprocess 6 will run for 778 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p5 <= p6) AND (G ((p5 <= p6)) OR G (F ((p6 + 1 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 778 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p5 <= p6)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p5 <= p6)
lola: processed formula length: 10
lola: 63 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 1037 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p5 <= p6))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p5 <= p6))
lola: processed formula length: 14
lola: 63 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 500 markings, 500 edges
lola: ========================================
lola: subprocess 8 will run for 1556 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p6 + 1 <= p5)))
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 ((p6 + 1 <= p5)))
lola: processed formula length: 22
lola: 63 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 603 markings, 639 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 1037 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((p1 <= p5)) AND G ((p5 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 1037 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p5 <= p2))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p5 <= p2))
lola: processed formula length: 14
lola: 63 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 502 markings, 502 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 1555 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((2 <= p4) AND (1 <= p4) AND (p1 <= p3))) OR (G (F ((p1 <= p3))) AND F (((2 <= p4) AND (1 <= p4) AND (p1 <= p3)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 1555 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p1 <= p3)))
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 ((p1 <= p3)))
lola: processed formula length: 18
lola: 63 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 161 markings, 163 edges
lola: ========================================
lola: subprocess 9 will run for 3111 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((2 <= p4) AND (1 <= p4) AND (p1 <= p3)))
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: ((p4 <= 1) OR (p4 <= 0) OR (p3 + 1 <= p1))
lola: processed formula length: 44
lola: 65 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 146 markings, 146 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 3111 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((F ((p1 <= p6)) AND ((((p6 <= p3) AND (p1 <= 1)) OR (1 <= p5)) OR (p1 <= p6)))) OR G ((p1 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 3111 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p1 <= p6))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p1 <= p6))
lola: processed formula length: 14
lola: 63 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 496 markings, 496 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((X ((2 <= p7)) OR (G (F ((3 <= p8))) AND X ((p1 + 1 <= p8))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X ((2 <= p7)) OR (G (F ((3 <= p8))) AND X ((p1 + 1 <= p8))))))
lola: processed formula length: 69
lola: 63 rewrites
lola: closed formula file LTLCardinality.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: 2359446 markings, 7698393 edges, 471889 markings/sec, 0 secs
lola: 4309543 markings, 14472457 edges, 390019 markings/sec, 5 secs
lola: 6204897 markings, 21134545 edges, 379071 markings/sec, 10 secs
lola: 8066248 markings, 27720437 edges, 372270 markings/sec, 15 secs
lola: 9897607 markings, 34227899 edges, 366272 markings/sec, 20 secs
lola: 11703746 markings, 40672079 edges, 361228 markings/sec, 25 secs
lola: 13464729 markings, 46974103 edges, 352197 markings/sec, 30 secs
lola: 15226243 markings, 53297980 edges, 352303 markings/sec, 35 secs
lola: 16976860 markings, 59603534 edges, 350123 markings/sec, 40 secs
lola: 18717678 markings, 65876882 edges, 348164 markings/sec, 45 secs
lola: 20447483 markings, 72121499 edges, 345961 markings/sec, 50 secs
lola: 22136873 markings, 78228185 edges, 337878 markings/sec, 55 secs
lola: 23822375 markings, 84321648 edges, 337100 markings/sec, 60 secs
lola: 25469596 markings, 90302287 edges, 329444 markings/sec, 65 secs
lola: 27085086 markings, 96153341 edges, 323098 markings/sec, 70 secs
lola: 28681384 markings, 101950360 edges, 319260 markings/sec, 75 secs
lola: 30281153 markings, 107780507 edges, 319954 markings/sec, 80 secs
lola: 31889445 markings, 113625075 edges, 321658 markings/sec, 85 secs
lola: 33496971 markings, 119483637 edges, 321505 markings/sec, 90 secs
lola: 35105524 markings, 125344394 edges, 321711 markings/sec, 95 secs
lola: 36715094 markings, 131211613 edges, 321914 markings/sec, 100 secs
lola: 38280207 markings, 136930429 edges, 313023 markings/sec, 105 secs
lola: 39823139 markings, 142553733 edges, 308586 markings/sec, 110 secs
lola: 41314597 markings, 148015459 edges, 298292 markings/sec, 115 secs
lola: 42796208 markings, 153425423 edges, 296322 markings/sec, 120 secs
lola: 44262072 markings, 158780699 edges, 293173 markings/sec, 125 secs
lola: 45715542 markings, 164100271 edges, 290694 markings/sec, 130 secs
lola: 47156655 markings, 169382207 edges, 288223 markings/sec, 135 secs
lola: 48594285 markings, 174640773 edges, 287526 markings/sec, 140 secs
lola: 50015212 markings, 179850061 edges, 284185 markings/sec, 145 secs
lola: 51435043 markings, 185059193 edges, 283966 markings/sec, 150 secs
lola: 52840157 markings, 190219230 edges, 281023 markings/sec, 155 secs
lola: 54242547 markings, 195366335 edges, 280478 markings/sec, 160 secs
lola: 55642658 markings, 200492565 edges, 280022 markings/sec, 165 secs
lola: 57033857 markings, 205601026 edges, 278240 markings/sec, 170 secs
lola: 58413167 markings, 210658989 edges, 275862 markings/sec, 175 secs
lola: 59788823 markings, 215707805 edges, 275131 markings/sec, 180 secs
lola: 61160065 markings, 220751623 edges, 274248 markings/sec, 185 secs
lola: 62527593 markings, 225781964 edges, 273506 markings/sec, 190 secs
lola: 63869281 markings, 230730845 edges, 268338 markings/sec, 195 secs
lola: 65228557 markings, 235734729 edges, 271855 markings/sec, 200 secs
lola: 66576055 markings, 240705368 edges, 269500 markings/sec, 205 secs
lola: 67936649 markings, 245705799 edges, 272119 markings/sec, 210 secs
lola: 69285913 markings, 250666022 edges, 269853 markings/sec, 215 secs
lola: 70660383 markings, 255727545 edges, 274894 markings/sec, 220 secs
lola: 72034343 markings, 260793324 edges, 274792 markings/sec, 225 secs
lola: 73427763 markings, 265928527 edges, 278684 markings/sec, 230 secs
lola: 74815223 markings, 271038206 edges, 277492 markings/sec, 235 secs
lola: 76190441 markings, 276120612 edges, 275044 markings/sec, 240 secs
lola: 77569345 markings, 281202083 edges, 275781 markings/sec, 245 secs
lola: 78949073 markings, 286283923 edges, 275946 markings/sec, 250 secs
lola: 80293971 markings, 291256583 edges, 268980 markings/sec, 255 secs
lola: 81657069 markings, 296279547 edges, 272620 markings/sec, 260 secs
lola: 83006849 markings, 301263766 edges, 269956 markings/sec, 265 secs
lola: 84335977 markings, 306175883 edges, 265826 markings/sec, 270 secs
lola: 85663747 markings, 311082312 edges, 265554 markings/sec, 275 secs
lola: 86995045 markings, 315992192 edges, 266260 markings/sec, 280 secs
lola: 88307059 markings, 320845370 edges, 262403 markings/sec, 285 secs
lola: 89601597 markings, 325639621 edges, 258908 markings/sec, 290 secs
lola: 90921893 markings, 330505377 edges, 264059 markings/sec, 295 secs
lola: 92235765 markings, 335362937 edges, 262774 markings/sec, 300 secs
lola: 93567019 markings, 340287245 edges, 266251 markings/sec, 305 secs
lola: 94893136 markings, 345197402 edges, 265223 markings/sec, 310 secs
lola: 96235781 markings, 350161707 edges, 268529 markings/sec, 315 secs
lola: 97591173 markings, 355167191 edges, 271078 markings/sec, 320 secs
lola: 98945360 markings, 360166323 edges, 270837 markings/sec, 325 secs
lola: 100276094 markings, 365091351 edges, 266147 markings/sec, 330 secs
lola: 101603326 markings, 370000943 edges, 265446 markings/sec, 335 secs
lola: 102530842 markings, 373442609 edges, 185503 markings/sec, 340 secs
lola: 103636737 markings, 377533328 edges, 221179 markings/sec, 345 secs
lola: 104647506 markings, 381282923 edges, 202154 markings/sec, 350 secs
lola: 105917603 markings, 385982660 edges, 254019 markings/sec, 355 secs
lola: 107151928 markings, 390564621 edges, 246865 markings/sec, 360 secs
lola: 108387558 markings, 395147739 edges, 247126 markings/sec, 365 secs
lola: 109298724 markings, 398526573 edges, 182233 markings/sec, 370 secs
lola: 110421161 markings, 402681335 edges, 224487 markings/sec, 375 secs
lola: 111616635 markings, 407099357 edges, 239095 markings/sec, 380 secs
lola: 112738733 markings, 411261280 edges, 224420 markings/sec, 385 secs
lola: 113945525 markings, 415741172 edges, 241358 markings/sec, 390 secs
lola: 115047236 markings, 419821214 edges, 220342 markings/sec, 395 secs
lola: 116086597 markings, 423687895 edges, 207872 markings/sec, 400 secs
lola: 117361756 markings, 428409246 edges, 255032 markings/sec, 405 secs
lola: 118446122 markings, 432428898 edges, 216873 markings/sec, 410 secs
lola: 119605400 markings, 436740700 edges, 231856 markings/sec, 415 secs
lola: 120882914 markings, 441480327 edges, 255503 markings/sec, 420 secs
lola: 122190020 markings, 446322801 edges, 261421 markings/sec, 425 secs
lola: 123225068 markings, 450164125 edges, 207010 markings/sec, 430 secs
lola: 124221264 markings, 453857241 edges, 199239 markings/sec, 435 secs
lola: 125327076 markings, 457955005 edges, 221162 markings/sec, 440 secs
lola: 126269114 markings, 461453187 edges, 188408 markings/sec, 445 secs
lola: lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (G ((F ((p1 <= p6)) AND ((((p6 <= p3) AND (p1 <= 1)) OR (1 <= p5)) OR (p1 <= p6)))) OR G ((p1 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G ((p1 <= p6))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p1 <= p6))
lola: processed formula length: 14
lola: 63 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 496 markings, 496 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((F ((p1 <= p6)) AND ((((p6 <= p3) AND (p1 <= 1)) OR (1 <= p5)) OR (p1 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((p1 <= p6)) AND ((((p6 <= p3) AND (p1 <= 1)) OR (1 <= p5)) OR (p1 <= p6))))
lola: processed formula length: 83
lola: 63 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 37478 markings, 94844 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no unknown no yes no no
lola:
preliminary result: no no no no no unknown no yes no no
lola: memory consumption: 3716 KB
lola: time consumption: 917 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.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="SwimmingPool-PT-07"
export BK_EXAMINATION="LTLCardinality"
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 SwimmingPool-PT-07, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r265-tall-162106800700381"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SwimmingPool-PT-07.tgz
mv SwimmingPool-PT-07 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;