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-162106800300049.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 SmallOperatingSystem-PT-MT1024DC0512, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-162106800300049
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 19K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K 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.7K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Mar 28 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 28 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 27 13:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 13:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 19:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 19:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K 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 13 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 8.1K 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 SmallOperatingSystem-PT-MT1024DC0512-00
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-01
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-02
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-03
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-04
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-05
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-06
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-07
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-08
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-09
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-10
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-11
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-12
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-13
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-14
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-15

=== Now, execution of the tool begins

BK_START 1621195211164

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-16 20:00:12] [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-16 20:00:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 20:00:12] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2021-05-16 20:00:12] [INFO ] Transformed 9 places.
[2021-05-16 20:00:12] [INFO ] Transformed 8 transitions.
[2021-05-16 20:00:12] [INFO ] Parsed PT model containing 9 places and 8 transitions in 56 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100519 steps, including 0 resets, run finished after 44 ms. (steps per millisecond=2284 ) properties seen :[0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1]
// Phase 1: matrix 8 rows 9 cols
[2021-05-16 20:00:13] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-16 20:00:13] [INFO ] [Real]Absence check using 4 positive place invariants in 8 ms returned unsat
[2021-05-16 20:00:13] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2021-05-16 20:00:13] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned unsat
[2021-05-16 20:00:13] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2021-05-16 20:00:13] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned unsat
[2021-05-16 20:00:13] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2021-05-16 20:00:13] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned unsat
[2021-05-16 20:00:13] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned unsat
[2021-05-16 20:00:13] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2021-05-16 20:00:13] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned unsat
[2021-05-16 20:00:13] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2021-05-16 20:00:13] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned unsat
[2021-05-16 20:00:13] [INFO ] [Real]Absence check using 4 positive place invariants in 11 ms returned unsat
[2021-05-16 20:00:13] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned unsat
Successfully simplified 14 atomic propositions for a total of 17 simplifications.
[2021-05-16 20:00:13] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2021-05-16 20:00:13] [INFO ] Flatten gal took : 20 ms
FORMULA SmallOperatingSystem-PT-MT1024DC0512-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT1024DC0512-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT1024DC0512-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT1024DC0512-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT1024DC0512-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT1024DC0512-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT1024DC0512-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT1024DC0512-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 20:00:13] [INFO ] Flatten gal took : 3 ms
[2021-05-16 20:00:13] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SmallOperatingSystem-PT-MT1024DC0512-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 20:00:13] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-16 20:00:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ SmallOperatingSystem-PT-MT1024DC0512 @ 3570 seconds

FORMULA SmallOperatingSystem-PT-MT1024DC0512-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0512-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0512-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0512-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0512-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0512-09 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0512-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3050
rslt: Output for LTLCardinality @ SmallOperatingSystem-PT-MT1024DC0512

{
"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": "Sun May 16 20:00:14 2021
",
"timelimit": 3570
},
"child":
[

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p1 <= p3)",
"processed_size": 10,
"rewrites": 31
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X ((((1 <= p4) AND (p1 <= p3)) OR F ((p1 <= p3)))))",
"processed_size": 54,
"rewrites": 31
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F ((F ((1 <= p8)) AND X ((3 <= p5))))",
"processed_size": 37,
"rewrites": 31
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (G ((G (((1 <= p5) OR (G ((1 <= p5)) AND F ((1 <= p5))))) OR (1 <= p5))))",
"processed_size": 75,
"rewrites": 31
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"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": 4,
"visible_transitions": 0
},
"processed": "F ((X (G ((p6 <= p2))) AND (p7 + 1 <= p1)))",
"processed_size": 43,
"rewrites": 31
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"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": 3325
},
"child":
[

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

{
"child":
[

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

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"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": "G (F (((p1 + 1 <= p8) AND (p8 + 1 <= p4))))",
"processed_size": 43,
"rewrites": 31
},
"result":
{
"edges": 4,
"markings": 4,
"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": "fairness",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3372,
"runtime": 520.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "((* R *) AND X(*)) : (X(X((** OR F(**)))) OR **) : F((F(**) AND X(**))) : X(G((G((** OR (G(**) AND F(**)))) OR **))) : (F(G(**)) OR G(F(*))) : G(F(**)) : F((X(G(*)) AND **))"
},
"net":
{
"arcs": 27,
"conflict_clusters": 4,
"places": 9,
"places_significant": 5,
"singleton_clusters": 0,
"transitions": 8
},
"result":
{
"preliminary_value": "yes no no no no unknown no ",
"value": "yes no no no no unknown 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: 17/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 8 transitions, 5 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: (NOT(((2 <= p8) U (3 <= p8))) AND NOT(X ((3 <= p8)))) : (X ((X (((1 <= p4) AND (p1 <= p3))) OR X (F ((p1 <= p3))))) OR (p1 <= p3)) : F ((F (((F (NOT(F ((p6 <= p1)))) AND (p6 <= p7)) U (1 <= p8))) AND X ((3 <= p5)))) : G ((G (X ((G ((1 <= p5)) U (1 <= p5)))) OR X ((1 <= p5)))) : (F (G ((3 <= p8))) OR G (X (X (F (NOT(G (((p8 <= p1) OR (p4 <= p8))))))))) : F (X (F (((0 <= 0) U ((2 <= p1) U G (F (((p7 <= p8) OR (p3 + 1 <= p6) OR (1 <= p5))))))))) : F ((NOT(F (X ((p2 + 1 <= p6)))) AND (p7 + 1 <= p1)))
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p8 <= 1) R (p8 <= 2)) AND X ((p8 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p8 <= 1) R (p8 <= 2))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p8 <= 1) R (p8 <= 2))
lola: processed formula length: 23
lola: 31 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p8 <= 2))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p8 <= 2))
lola: processed formula length: 13
lola: 31 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X ((((1 <= p4) AND (p1 <= p3)) OR F ((p1 <= p3))))) OR (p1 <= p3))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p1 <= p3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p1 <= p3)
lola: processed formula length: 10
lola: 31 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((((1 <= p4) AND (p1 <= p3)) OR F ((p1 <= p3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((((1 <= p4) AND (p1 <= p3)) OR F ((p1 <= p3)))))
lola: processed formula length: 54
lola: 31 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: 6 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((1 <= p8)) AND X ((3 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((1 <= p8)) AND X ((3 <= p5))))
lola: processed formula length: 37
lola: 31 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 3 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G (((1 <= p5) OR (G ((1 <= p5)) AND F ((1 <= p5))))) OR (1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G (((1 <= p5) OR (G ((1 <= p5)) AND F ((1 <= p5))))) OR (1 <= p5))))
lola: processed formula length: 75
lola: 31 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: 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 4 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (G ((p6 <= p2))) AND (p7 + 1 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (G ((p6 <= p2))) AND (p7 + 1 <= p1)))
lola: processed formula length: 43
lola: 31 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 5 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((p7 <= p8) OR (p3 + 1 <= p6) OR (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 (((p7 <= p8) OR (p3 + 1 <= p6) OR (1 <= p5))))
lola: processed formula length: 53
lola: 31 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: 3375675 markings, 8391769 edges, 675135 markings/sec, 0 secs
lola: 6599601 markings, 16425245 edges, 644785 markings/sec, 5 secs
lola: 9759808 markings, 24303590 edges, 632041 markings/sec, 10 secs
lola: 12881375 markings, 32087967 edges, 624313 markings/sec, 15 secs
lola: 16013764 markings, 39901505 edges, 626478 markings/sec, 20 secs
lola: 19120540 markings, 47651979 edges, 621355 markings/sec, 25 secs
lola: 22270118 markings, 55510108 edges, 629916 markings/sec, 30 secs
lola: 25336369 markings, 63160695 edges, 613250 markings/sec, 35 secs
lola: 28382686 markings, 70762975 edges, 609263 markings/sec, 40 secs
lola: 31399886 markings, 78291057 edges, 603440 markings/sec, 45 secs
lola: 34458516 markings, 85924695 edges, 611726 markings/sec, 50 secs
lola: 37461031 markings, 93418819 edges, 600503 markings/sec, 55 secs
lola: 40475208 markings, 100941316 edges, 602835 markings/sec, 60 secs
lola: 43451058 markings, 108368621 edges, 595170 markings/sec, 65 secs
lola: 46418815 markings, 115776993 edges, 593551 markings/sec, 70 secs
lola: 49539463 markings, 123567292 edges, 624130 markings/sec, 75 secs
lola: 52629681 markings, 131280777 edges, 618044 markings/sec, 80 secs
lola: 55698028 markings, 138941037 edges, 613669 markings/sec, 85 secs
lola: 58757839 markings, 146579309 edges, 611962 markings/sec, 90 secs
lola: 61807071 markings, 154190790 edges, 609846 markings/sec, 95 secs
lola: 64826593 markings, 161729380 edges, 603904 markings/sec, 100 secs
lola: 67895931 markings, 169392216 edges, 613868 markings/sec, 105 secs
lola: 70924706 markings, 176954304 edges, 605755 markings/sec, 110 secs
lola: 73945405 markings, 184495503 edges, 604140 markings/sec, 115 secs
lola: 76941239 markings, 191975394 edges, 599167 markings/sec, 120 secs
lola: 79976653 markings, 199553990 edges, 607083 markings/sec, 125 secs
lola: 82953454 markings, 206985650 edges, 595360 markings/sec, 130 secs
lola: 84029235 markings, 209673104 edges, 215156 markings/sec, 135 secs
lola: 84134400 markings, 209936436 edges, 21033 markings/sec, 140 secs
lola: 85809687 markings, 214155448 edges, 335057 markings/sec, 145 secs
lola: 87957505 markings, 219659611 edges, 429564 markings/sec, 150 secs
lola: 90200869 markings, 225121258 edges, 448673 markings/sec, 155 secs
lola: 92134088 markings, 229909341 edges, 386644 markings/sec, 160 secs
lola: 92522585 markings, 230879230 edges, 77699 markings/sec, 165 secs
lola: 93661929 markings, 233725690 edges, 227869 markings/sec, 170 secs
lola: 95378785 markings, 238012488 edges, 343371 markings/sec, 175 secs
lola: 96456793 markings, 240702927 edges, 215602 markings/sec, 180 secs
lola: 98621012 markings, 246106814 edges, 432844 markings/sec, 185 secs
lola: 99908577 markings, 249321441 edges, 257513 markings/sec, 190 secs
lola: 100894823 markings, 251784578 edges, 197249 markings/sec, 195 secs
lola: 102612840 markings, 256074037 edges, 343603 markings/sec, 200 secs
lola: lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 3325 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((3 <= p8))) OR G (F (((p1 + 1 <= p8) AND (p8 + 1 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 3325 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((3 <= p8)))
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 ((3 <= p8)))
lola: processed formula length: 17
lola: 31 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: 4 markings, 5 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 (((p7 <= p8) OR (p3 + 1 <= p6) OR (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 (((p7 <= p8) OR (p3 + 1 <= p6) OR (1 <= p5))))
lola: processed formula length: 53
lola: 31 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: 3363247 markings, 8360669 edges, 672649 markings/sec, 0 secs
lola: 6631175 markings, 16504450 edges, 653586 markings/sec, 5 secs
lola: 9853900 markings, 24538226 edges, 644545 markings/sec, 10 secs
lola: 13059569 markings, 32533020 edges, 641134 markings/sec, 15 secs
lola: 16209426 markings, 40389001 edges, 629971 markings/sec, 20 secs
lola: 19232268 markings, 47930356 edges, 604568 markings/sec, 25 secs
lola: 22313708 markings, 55618014 edges, 616288 markings/sec, 30 secs
lola: 25335874 markings, 63159471 edges, 604433 markings/sec, 35 secs
lola: 28346881 markings, 70673259 edges, 602201 markings/sec, 40 secs
lola: 31320483 markings, 78093685 edges, 594720 markings/sec, 45 secs
lola: 34328368 markings, 85600507 edges, 601577 markings/sec, 50 secs
lola: 37351630 markings, 93144936 edges, 604652 markings/sec, 55 secs
lola: 40344633 markings, 100616064 edges, 598601 markings/sec, 60 secs
lola: 43365144 markings, 108155396 edges, 604102 markings/sec, 65 secs
lola: 46376896 markings, 115672057 edges, 602350 markings/sec, 70 secs
lola: 49549280 markings, 123591831 edges, 634477 markings/sec, 75 secs
lola: 52682490 markings, 131413086 edges, 626642 markings/sec, 80 secs
lola: 55781179 markings, 139147443 edges, 619738 markings/sec, 85 secs
lola: 58831999 markings, 146765025 edges, 610164 markings/sec, 90 secs
lola: 61862846 markings, 154330391 edges, 606169 markings/sec, 95 secs
lola: 64855913 markings, 161802595 edges, 598613 markings/sec, 100 secs
lola: 67897742 markings, 169396747 edges, 608366 markings/sec, 105 secs
lola: 70955283 markings, 177029548 edges, 611508 markings/sec, 110 secs
lola: 74012171 markings, 184662577 edges, 611378 markings/sec, 115 secs
lola: 77047649 markings, 192241615 edges, 607096 markings/sec, 120 secs
lola: 80103227 markings, 199870634 edges, 611116 markings/sec, 125 secs
lola: 83089412 markings, 207325666 edges, 597237 markings/sec, 130 secs
lola: 85887486 markings, 214312652 edges, 559615 markings/sec, 135 secs
lola: 86624430 markings, 216151625 edges, 147389 markings/sec, 140 secs
lola: 89190004 markings, 222560424 edges, 513115 markings/sec, 145 secs
lola: 91734933 markings, 228912752 edges, 508986 markings/sec, 150 secs
lola: 91860706 markings, 229227424 edges, 25155 markings/sec, 155 secs
lola: 92123341 markings, 229882321 edges, 52527 markings/sec, 160 secs
lola: 94381867 markings, 235522433 edges, 451705 markings/sec, 165 secs
lola: 97030467 markings, 242136045 edges, 529720 markings/sec, 170 secs
lola: 97172629 markings, 242489646 edges, 28432 markings/sec, 175 secs
lola: 97172629 markings, 242489646 edges, 0 markings/sec, 180 secs
lola: 98327570 markings, 245374814 edges, 230988 markings/sec, 185 secs
lola: 99928347 markings, 249370990 edges, 320155 markings/sec, 190 secs
lola: 99928347 markings, 249370990 edges, 0 markings/sec, 195 secs
lola: 99928347 markings, 249370990 edges, 0 markings/sec, 200 secs
lola: 102118532 markings, 254839624 edges, 438037 markings/sec, 205 secs
lola: 102624625 markings, 256103532 edges, 101219 markings/sec, 210 secs
lola: 102644493 markings, 256153141 edges, 3974 markings/sec, 215 secs
lola: 104378390 markings, 260482467 edges, 346779 markings/sec, 220 secs
lola: 104378421 markings, 260482560 edges, 6 markings/sec, 225 secs
lola: 104378472 markings, 260482715 edges, 10 markings/sec, 230 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (F (G ((3 <= p8))) OR G (F (((p1 + 1 <= p8) AND (p8 + 1 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F (G ((3 <= p8)))
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 ((3 <= p8)))
lola: processed formula length: 17
lola: 31 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: 4 markings, 5 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F (((p1 + 1 <= p8) AND (p8 + 1 <= p4))))
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 + 1 <= p8) AND (p8 + 1 <= p4))))
lola: processed formula length: 43
lola: 31 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: 4 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no no unknown no
lola:
preliminary result: yes no no no no unknown no
lola: memory consumption: 3372 KB
lola: time consumption: 520 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="SmallOperatingSystem-PT-MT1024DC0512"
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 SmallOperatingSystem-PT-MT1024DC0512, 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-162106800300049"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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