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.r132-tall-162075428000001.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 GlobalResAllocation-COL-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-162075428000001
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 388K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 127K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K 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.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Mar 28 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 11:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 11:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Mar 22 20:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Mar 22 20:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 28K 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 GlobalResAllocation-COL-03-00
FORMULA_NAME GlobalResAllocation-COL-03-01
FORMULA_NAME GlobalResAllocation-COL-03-02
FORMULA_NAME GlobalResAllocation-COL-03-03
FORMULA_NAME GlobalResAllocation-COL-03-04
FORMULA_NAME GlobalResAllocation-COL-03-05
FORMULA_NAME GlobalResAllocation-COL-03-06
FORMULA_NAME GlobalResAllocation-COL-03-07
FORMULA_NAME GlobalResAllocation-COL-03-08
FORMULA_NAME GlobalResAllocation-COL-03-09
FORMULA_NAME GlobalResAllocation-COL-03-10
FORMULA_NAME GlobalResAllocation-COL-03-11
FORMULA_NAME GlobalResAllocation-COL-03-12
FORMULA_NAME GlobalResAllocation-COL-03-13
FORMULA_NAME GlobalResAllocation-COL-03-14
FORMULA_NAME GlobalResAllocation-COL-03-15

=== Now, execution of the tool begins

BK_START 1620888387111

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 06:46:28] [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-13 06:46:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 06:46:28] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2021-05-13 06:46:29] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 593 ms
[2021-05-13 06:46:29] [INFO ] sort/places :
Proc->Processes,pr_in,pr_released,
Res->Resources,
PR->in_critical_s,

[2021-05-13 06:46:29] [INFO ] r2 symmetric to r1 in transition enter2
[2021-05-13 06:46:29] [INFO ] r3 symmetric to r2 in transition enter3
[2021-05-13 06:46:29] [INFO ] r2 symmetric to r1 in transition enter3
[2021-05-13 06:46:29] [INFO ] r4 symmetric to r3 in transition enter4
[2021-05-13 06:46:29] [INFO ] r3 symmetric to r2 in transition enter4
[2021-05-13 06:46:29] [INFO ] r2 symmetric to r1 in transition enter4
[2021-05-13 06:46:29] [INFO ] r2 symmetric to r1 in transition release2
[2021-05-13 06:46:29] [INFO ] Imported 5 HL places and 7 HL transitions for a total of 33 PT places and 4791.0 transition bindings in 36 ms.
[2021-05-13 06:46:29] [INFO ] Computed order based on color domains.
[2021-05-13 06:46:29] [INFO ] Unfolded HLPN to a Petri net with 33 places and 711 transitions in 32 ms.
[2021-05-13 06:46:29] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 57 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 952 ms. (steps per millisecond=105 ) properties seen :[0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Normalized transition count is 693 out of 711 initially.
// Phase 1: matrix 693 rows 33 cols
[2021-05-13 06:46:30] [INFO ] Computed 12 place invariants in 22 ms
[2021-05-13 06:46:30] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned unsat
[2021-05-13 06:46:30] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-13 06:46:30] [INFO ] [Real]Absence check using 8 positive and 4 generalized place invariants in 2 ms returned unsat
[2021-05-13 06:46:30] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned unsat
[2021-05-13 06:46:30] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 4 simplifications.
[2021-05-13 06:46:30] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-13 06:46:30] [INFO ] Flatten gal took : 120 ms
FORMULA GlobalResAllocation-COL-03-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-03-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-03-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-03-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 06:46:30] [INFO ] Applying decomposition
[2021-05-13 06:46:30] [INFO ] Flatten gal took : 78 ms
[2021-05-13 06:46:30] [INFO ] Decomposing Gal with order
[2021-05-13 06:46:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 06:46:31] [INFO ] Removed a total of 3822 redundant transitions.
[2021-05-13 06:46:31] [INFO ] Flatten gal took : 203 ms
[2021-05-13 06:46:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2021-05-13 06:46:31] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-13 06:46:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 11 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ GlobalResAllocation-COL-03 @ 3570 seconds

FORMULA GlobalResAllocation-COL-03-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GlobalResAllocation-COL-03-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GlobalResAllocation-COL-03-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GlobalResAllocation-COL-03-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GlobalResAllocation-COL-03-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GlobalResAllocation-COL-03-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GlobalResAllocation-COL-03-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GlobalResAllocation-COL-03-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GlobalResAllocation-COL-03-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GlobalResAllocation-COL-03-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GlobalResAllocation-COL-03-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GlobalResAllocation-COL-03-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLCardinality @ GlobalResAllocation-COL-03

{
"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": "Thu May 13 06:46:32 2021
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"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": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "F (G ((p9 + p10 + p11 + 1 <= p0 + p1 + p2)))",
"processed_size": 44,
"rewrites": 66
},
"result":
{
"edges": 16,
"markings": 13,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"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": 0,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 39,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 27,
"visible_transitions": 0
},
"processed": "G (((p9 + p10 + p11 <= p3 + p4 + p5 + p6 + p7 + p8) OR (1 <= p3 + p4 + p5 + p6 + p7 + p8) OR (p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p3 + p4 + p5 + p6 + p7 + p8)))",
"processed_size": 235,
"rewrites": 66
},
"result":
{
"edges": 26,
"markings": 20,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"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": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 21,
"visible_transitions": 0
},
"processed": "X ((F ((X (G ((p30 + p31 + p32 <= 0))) AND (p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= 0))) OR G (F ((1 <= p30 + p31 + p32)))))",
"processed_size": 193,
"rewrites": 66
},
"result":
{
"edges": 246192,
"markings": 13453,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 2,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 36,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "X (X (((G ((p9 + p10 + p11 + 1 <= p30 + p31 + p32)) OR (p3 + p4 + p5 + p6 + p7 + p8 <= 0)) U X (((p30 + p31 + p32 <= p9 + p10 + p11) U G ((3 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))))))",
"processed_size": 256,
"rewrites": 66
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 14
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 21,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "X ((X (F ((F ((p3 + p4 + p5 + p6 + p7 + p8 <= 2)) OR (p9 + p10 + p11 <= p3 + p4 + p5 + p6 + p7 + p8)))) AND G ((p3 + p4 + p5 + p6 + p7 + p8 <= 2))))",
"processed_size": 148,
"rewrites": 66
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "X (X (F ((2 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29))))",
"processed_size": 124,
"rewrites": 66
},
"result":
{
"edges": 938,
"markings": 485,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"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": "X (F ((p30 + p31 + p32 <= 2)))",
"processed_size": 30,
"rewrites": 66
},
"result":
{
"edges": 162,
"markings": 161,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 66,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 24,
"visible_transitions": 0
},
"processed": "((1 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29) U X ((F ((p3 + p4 + p5 + p6 + p7 + p8 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29)) OR (p3 + p4 + p5 + p6 + p7 + p8 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29))))",
"processed_size": 407,
"rewrites": 66
},
"result":
{
"edges": 321,
"markings": 321,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 7,
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G (((p9 + p10 + p11 <= 0) AND (F ((p30 + p31 + p32 <= 0)) OR G ((p9 + p10 + p11 <= 0)))))",
"processed_size": 89,
"rewrites": 66
},
"result":
{
"edges": 6,
"markings": 6,
"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": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 24,
"visible_transitions": 0
},
"processed": "((G (F ((p0 + p1 + p2 + 1 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29))) OR (2 <= p0 + p1 + p2)) U ((2 <= p0 + p1 + p2) AND (3 <= p9 + p10 + p11)))",
"processed_size": 212,
"rewrites": 66
},
"result":
{
"edges": 109,
"markings": 109,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 1783
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((p30 + p31 + p32 <= 2))",
"processed_size": 26,
"rewrites": 66
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"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": 10,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"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": 24,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 24,
"visible_transitions": 0
},
"processed": "G ((p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + 1 <= p3 + p4 + p5 + p6 + p7 + p8))",
"processed_size": 146,
"rewrites": 66
},
"result":
{
"edges": 6,
"markings": 6,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"child":
[

{
"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": 24,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 24,
"visible_transitions": 0
},
"processed": "G ((p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + 1 <= p3 + p4 + p5 + p6 + p7 + p8))",
"processed_size": 146,
"rewrites": 66
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"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": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 21,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 21,
"visible_transitions": 0
},
"processed": "G (F (((p0 + p1 + p2 <= 1) AND (p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= 0))))",
"processed_size": 146,
"rewrites": 66
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 39792,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(F(**) AND G(**)) : (F(G(*)) AND (X(F(*)) AND **)) : ((G(F(*)) OR **) U **) : (G(F(**)) OR G(*)) : G((* AND (F(*) OR G(*)))) : (G(**) AND X(X((** U **)))) : X((F((X(G(*)) AND *)) OR G(F(**)))) : X(X(((G(*) OR **) U X((** U G(**)))))) : X((X(F((F(*) OR *))) AND G(*))) : X(X(F(**))) : X(F(*)) : (** U X((F(**) OR **)))"
},
"net":
{
"arcs": 4947,
"conflict_clusters": 7,
"places": 33,
"places_significant": 21,
"singleton_clusters": 0,
"transitions": 711
},
"result":
{
"preliminary_value": "no no no no no no yes no no no no no ",
"value": "no no no no no no yes no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 744/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1056
lola: finding significant places
lola: 33 places, 711 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 LTLCardinality.xml
lola: (((0 <= 0) U F (((3 <= p30 + p31 + p32) U F ((p0 + p1 + p2 <= p9 + p10 + p11))))) AND G ((p30 + p31 + p32 <= 2))) : ((NOT(G (F ((p0 + p1 + p2 <= p9 + p10 + p11)))) AND NOT(G (X ((p0 + p1 + p2 <= p9 + p10 + p11))))) AND (p9 + p10 + p11 <= 2)) : ((G (NOT(G ((p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p0 + p1 + p2)))) OR (2 <= p0 + p1 + p2)) U ((2 <= p0 + p1 + p2) AND (3 <= p9 + p10 + p11))) : (G (F (((p0 + p1 + p2 <= 1) AND (p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= 0)))) OR NOT(F (((0 <= 0) U (p3 + p4 + p5 + p6 + p7 + p8 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29))))) : G (NOT((G ((1 <= p30 + p31 + p32)) U (1 <= p9 + p10 + p11)))) : (G (((p9 + p10 + p11 <= p3 + p4 + p5 + p6 + p7 + p8) OR (1 <= p3 + p4 + p5 + p6 + p7 + p8) OR (p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p3 + p4 + p5 + p6 + p7 + p8))) AND X (X (((1 <= p3 + p4 + p5 + p6 + p7 + p8) U (p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p3 + p4 + p5 + p6 + p7 + p8))))) : NOT(X ((G ((F (X ((1 <= p30 + p31 + p32))) OR (1 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29))) AND F (G (NOT(F ((1 <= p30 + p31 + p32)))))))) : X (X (((NOT(F ((p30 + p31 + p32 <= p9 + p10 + p11))) OR (p3 + p4 + p5 + p6 + p7 + p8 <= 0)) U X (((p30 + p31 + p32 <= p9 + p10 + p11) U G ((3 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29))))))) : NOT(X ((G (X ((G ((3 <= p3 + p4 + p5 + p6 + p7 + p8)) AND (p3 + p4 + p5 + p6 + p7 + p8 + 1 <= p9 + p10 + p11)))) OR F ((3 <= p3 + p4 + p5 + p6 + p7 + p8))))) : F ((X (X ((p0 + p1 + p2 <= p3 + p4 + p5 + p6 + p7 + p8))) U F (X (X ((2 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))))) : X (NOT(G ((3 <= p30 + p31 + p32)))) : ((1 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29) U X ((F ((p3 + p4 + p5 + p6 + p7 + p8 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29)) OR (p3 + p4 + p5 + p6 + p7 + p8 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:318
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((p9 + p10 + p11 + 1 <= p0 + p1 + p2))) AND (X (F ((p9 + p10 + p11 + 1 <= p0 + p1 + p2))) AND (p9 + p10 + p11 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p9 + p10 + p11 <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p9 + p10 + p11 <= 2)
lola: processed formula length: 21
lola: 66 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 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p9 + p10 + p11 + 1 <= p0 + p1 + p2)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p9 + p10 + p11 + 1 <= p0 + p1 + p2)))
lola: processed formula length: 44
lola: 66 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: add low 639
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: 13 markings, 16 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((p9 + p10 + p11 <= p3 + p4 + p5 + p6 + p7 + p8) OR (1 <= p3 + p4 + p5 + p6 + p7 + p8) OR (p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p3 + p4 + p5 + p6 + p7 + p8))) AND X (X (((1 <= p3 + p4 + p5 + p6 + p7 + p8) U (p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p3 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p9 + p10 + p11 <= p3 + p4 + p5 + p6 + p7 + p8) OR (1 <= p3 + p4 + p5 + p6 + p7 + p8) OR (p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p3 + p4 + p5 + p6 + p7 + p8)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p9 + p10 + p11 <= p3 + p4 + p5 + p6 + p7 + p8) OR (1 <= p3 + p4 + p5 + p6 + p7 + p8) OR (p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p3 + p4 + p5 + p6 + p7 + p8)))
lola: processed formula length: 235
lola: 66 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: 20 markings, 26 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((X (G ((p30 + p31 + p32 <= 0))) AND (p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= 0))) OR G (F ((1 <= p30 + p31 + p32)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((X (G ((p30 + p31 + p32 <= 0))) AND (p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= 0))) OR G (F ((1 <= p30 + p31 + p32)))))
lola: processed formula length: 193
lola: 66 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: 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: 13453 markings, 246192 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (((G ((p9 + p10 + p11 + 1 <= p30 + p31 + p32)) OR (p3 + p4 + p5 + p6 + p7 + p8 <= 0)) U X (((p30 + p31 + p32 <= p9 + p10 + p11) U G ((3 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (((G ((p9 + p10 + p11 + 1 <= p30 + p31 + p32)) OR (p3 + p4 + p5 + p6 + p7 + p8 <= 0)) U X (((p30 + p31 + p32 <= p9 + p10 + p11) U G ((3 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))))))
lola: processed formula length: 256
lola: 66 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 14 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (F ((F ((p3 + p4 + p5 + p6 + p7 + p8 <= 2)) OR (p9 + p10 + p11 <= p3 + p4 + p5 + p6 + p7 + p8)))) AND G ((p3 + p4 + p5 + p6 + p7 + p8 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (F ((F ((p3 + p4 + p5 + p6 + p7 + p8 <= 2)) OR (p9 + p10 + p11 <= p3 + p4 + p5 + p6 + p7 + p8)))) AND G ((p3 + p4 + p5 + p6 + p7 + p8 <= 2))))
lola: processed formula length: 148
lola: 66 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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((2 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((2 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29))))
lola: processed formula length: 124
lola: 66 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 485 markings, 938 edges
lola: ========================================
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p30 + p31 + p32 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p30 + p31 + p32 <= 2)))
lola: processed formula length: 30
lola: 66 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: 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: 161 markings, 162 edges
lola: ========================================
lola: subprocess 7 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29) U X ((F ((p3 + p4 + p5 + p6 + p7 + p8 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29)) OR (p3 + p4 + p5 + p6 + p7 + p8 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((1 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29) U X ((F ((p3 + p4 + p5 + p6 + p7 + p8 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29)) OR (p3 + p4 + p5 + p6 + p7 + p8 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + ... (shortened)
lola: processed formula length: 407
lola: 66 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 321 markings, 321 edges
lola: ========================================
lola: subprocess 8 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p9 + p10 + p11 <= 0) AND (F ((p30 + p31 + p32 <= 0)) OR G ((p9 + p10 + p11 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p9 + p10 + p11 <= 0) AND (F ((p30 + p31 + p32 <= 0)) OR G ((p9 + p10 + p11 <= 0)))))
lola: processed formula length: 89
lola: 66 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 9 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G (F ((p0 + p1 + p2 + 1 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29))) OR (2 <= p0 + p1 + p2)) U ((2 <= p0 + p1 + p2) AND (3 <= p9 + p10 + p11)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((G (F ((p0 + p1 + p2 + 1 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29))) OR (2 <= p0 + p1 + p2)) U ((2 <= p0 + p1 + p2) AND (3 <= p9 + p10 + p11)))
lola: processed formula length: 212
lola: 66 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: 109 markings, 109 edges
lola: ========================================
lola: subprocess 10 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((p0 + p1 + p2 <= p9 + p10 + p11)) AND G ((p30 + p31 + p32 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p30 + p31 + p32 <= 2))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p30 + p31 + p32 <= 2))
lola: processed formula length: 26
lola: 66 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: 11 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F (((p0 + p1 + p2 <= 1) AND (p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= 0)))) OR G ((p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + 1 <= p3 + p4 + p5 + p6 + p7 + p8)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + 1 <= p3 + p4 + p5 + p6 + p7 + p8))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + 1 <= p3 + p4 + p5 + p6 + p7 + p8))
lola: processed formula length: 146
lola: 66 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: 6 markings, 6 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: (G (F (((p0 + p1 + p2 <= 1) AND (p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= 0)))) OR G ((p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + 1 <= p3 + p4 + p5 + p6 + p7 + p8)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G ((p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + 1 <= p3 + p4 + p5 + p6 + p7 + p8))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + 1 <= p3 + p4 + p5 + p6 + p7 + p8))
lola: processed formula length: 146
lola: 66 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: 6 markings, 6 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F (((p0 + p1 + p2 <= 1) AND (p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= 0))))
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 (((p0 + p1 + p2 <= 1) AND (p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= 0))))
lola: processed formula length: 146
lola: 66 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: 6 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no yes no no no no no
lola:
preliminary result: no no no no no no yes no no no no no
lola: memory consumption: 39792 KB
lola: time consumption: 3 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="GlobalResAllocation-COL-03"
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 GlobalResAllocation-COL-03, 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 r132-tall-162075428000001"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GlobalResAllocation-COL-03.tgz
mv GlobalResAllocation-COL-03 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 ;