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.r322-tall-162132127900129.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 TwoPhaseLocking-PT-nC00050vD, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r322-tall-162132127900129
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 340K
-rw-r--r-- 1 mcc users 15K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 12 08:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 12 08:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 12 08:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 12 08:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.4K May 12 04:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 12 04:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 11 18:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 11 18:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 12 04:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 12 04:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 10 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 4.6K May 12 08:13 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 TwoPhaseLocking-PT-nC00050vD-00
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-01
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-02
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-03
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-04
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-05
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-06
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-07
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-08
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-09
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-10
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-11
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-12
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-13
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-14
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-15

=== Now, execution of the tool begins

BK_START 1621447495924

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

FORMULA TwoPhaseLocking-PT-nC00050vD-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC00050vD-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC00050vD-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA TwoPhaseLocking-PT-nC00050vD-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC00050vD-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC00050vD-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC00050vD-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC00050vD-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC00050vD-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3565
rslt: Output for LTLCardinality @ TwoPhaseLocking-PT-nC00050vD

{
"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": "Wed May 19 18:04:58 2021
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((p1 <= 1)))",
"processed_size": 17,
"rewrites": 58
},
"result":
{
"edges": 30,
"markings": 30,
"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": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "X (F ((p1 <= p7)))",
"processed_size": 18,
"rewrites": 58
},
"result":
{
"edges": 65,
"markings": 65,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"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 (G ((p1 <= 0)))",
"processed_size": 17,
"rewrites": 58
},
"result":
{
"edges": 103,
"markings": 103,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"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": 2,
"visible_transitions": 0
},
"processed": "F ((X ((p5 + 1 <= p4)) R (p5 + 1 <= p4)))",
"processed_size": 41,
"rewrites": 58
},
"result":
{
"edges": 103,
"markings": 103,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((X (F ((X (X (F ((p1 + 1 <= p3)))) AND (p6 + 1 <= p1)))) AND G (F ((1 <= p4)))))",
"processed_size": 83,
"rewrites": 58
},
"result":
{
"edges": 2137862,
"markings": 424483,
"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": 594
},
"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": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((G ((p0 <= p4)) AND F ((p2 <= 0))))",
"processed_size": 38,
"rewrites": 58
},
"result":
{
"edges": 103,
"markings": 103,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p4 <= 0)",
"processed_size": 9,
"rewrites": 60
},
"result":
{
"edges": 50,
"markings": 51,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "X (G ((2 <= p2)))",
"processed_size": 17,
"rewrites": 58
},
"result":
{
"edges": 103,
"markings": 103,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((1 <= p7)))",
"processed_size": 17,
"rewrites": 58
},
"result":
{
"edges": 294,
"markings": 246,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 0,
"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 (G ((F (G ((2 <= p5))) AND F ((1 <= p1)))))",
"processed_size": 45,
"rewrites": 58
},
"result":
{
"edges": 4463,
"markings": 3300,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((F (G ((G ((p1 + 1 <= p7)) OR (p1 <= 1)))) AND ((p7 <= p1) OR (3 <= p2)))))",
"processed_size": 82,
"rewrites": 58
},
"result":
{
"edges": 301,
"markings": 267,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 3565
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (((p4 <= p6) AND (F (G ((p6 + 1 <= p5))) OR G ((p4 <= p6)))))",
"processed_size": 63,
"rewrites": 58
},
"result":
{
"edges": 205351,
"markings": 107771,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 20292,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(F(**)) OR (G(F(*)) AND **)) : X(G(*)) : G(F((F(G((G(*) OR *))) AND **))) : (X((X(F(**)) U **)) AND F((X(*) R *))) : F(G(**)) : G((X(F((X(X(F(*))) AND **))) AND G(F(**)))) : X((G(**) AND F(*))) : F(G((F(G(**)) AND F(**)))) : (X(G(**)) AND F(**)) : G((* AND (F(G(*)) OR G(*))))"
},
"net":
{
"arcs": 18,
"conflict_clusters": 5,
"places": 8,
"places_significant": 5,
"singleton_clusters": 0,
"transitions": 6
},
"result":
{
"preliminary_value": "no no no no no no no no no no ",
"value": "no no no no no 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: 14/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 256
lola: finding significant places
lola: 8 places, 6 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: (X (F ((p1 <= p7))) OR (NOT(F (((p7 + 1 <= p1) U G ((2 <= p1))))) AND (p1 <= 0))) : X (NOT(((0 <= 0) U F ((1 <= p1))))) : G (F ((X (NOT(G (F ((F ((p7 <= p1)) AND (2 <= p1)))))) AND ((p7 <= p1) OR (3 <= p2))))) : (X ((X (F ((1 <= p1))) U (1 <= p1))) AND F (NOT((X ((p4 <= p5)) U (p4 <= p5))))) : G (F (X (X (X (G (X ((1 <= p7)))))))) : G ((X (F ((NOT(X (G (X ((p3 <= p1))))) AND (p6 + 1 <= p1)))) AND X (G (F ((1 <= p4)))))) : (G (X ((p0 <= p4))) AND NOT(X (G ((1 <= p2))))) : G (F (G (F (G ((F (G ((2 <= p5))) AND F ((1 <= p1)))))))) : (X (G ((2 <= p2))) AND F ((1 <= p4))) : NOT(F ((X ((p4 <= p6)) U (G (F (X ((p5 <= p6)))) U (p6 + 1 <= p4)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k: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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:377
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:525
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:332
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((p1 <= p7))) OR (G (F ((p1 <= 1))) AND (p1 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p1 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p1 <= 0)
lola: processed formula length: 9
lola: 58 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 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p1 <= 1)))
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)))
lola: processed formula length: 17
lola: 58 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: 30 markings, 30 edges
lola: ========================================
lola: subprocess 2 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p1 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p1 <= p7)))
lola: processed formula length: 18
lola: 58 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: 65 markings, 65 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p1 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p1 <= 0)))
lola: processed formula length: 17
lola: 58 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: 103 markings, 103 edges
lola: ========================================
lola: subprocess 2 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((X (F ((1 <= p1))) U (1 <= p1))) AND F ((X ((p5 + 1 <= p4)) R (p5 + 1 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X ((p5 + 1 <= p4)) R (p5 + 1 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((p5 + 1 <= p4)) R (p5 + 1 <= p4)))
lola: processed formula length: 41
lola: 58 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: 103 markings, 103 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (F ((X (X (F ((p1 + 1 <= p3)))) AND (p6 + 1 <= p1)))) AND G (F ((1 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (F ((X (X (F ((p1 + 1 <= p3)))) AND (p6 + 1 <= p1)))) AND G (F ((1 <= p4)))))
lola: processed formula length: 83
lola: 58 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: 424483 markings, 2137862 edges
lola: ========================================
lola: subprocess 4 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((p0 <= p4)) AND F ((p2 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((p0 <= p4)) AND F ((p2 <= 0))))
lola: processed formula length: 38
lola: 58 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: 103 markings, 103 edges
lola: ========================================
lola: subprocess 5 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((2 <= p2))) AND F ((1 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p4))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p4 <= 0)
lola: processed formula length: 9
lola: 60 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 51 markings, 50 edges
lola: ========================================
lola: subprocess 6 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((2 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((2 <= p2)))
lola: processed formula length: 17
lola: 58 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: 103 markings, 103 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((1 <= p7)))
lola: processed formula length: 17
lola: 58 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: 246 markings, 294 edges
lola: ========================================
lola: subprocess 7 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (G ((2 <= p5))) AND F ((1 <= p1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (G ((2 <= p5))) AND F ((1 <= p1)))))
lola: processed formula length: 45
lola: 58 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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 0
lola: add low 3
lola: add low 5
lola: add low 0
lola: add low 3
lola: add low 5
lola: add low 0
lola: add low 3
lola: add low 5
lola: add low 0
lola: add low 3
lola: add low 5
lola: add low 0
lola: add low 3
lola: add low 5
lola: add low 0
lola: add low 3
lola: add low 5
lola: add low 0
lola: add low 3
lola: add low 5
lola: add low 0
lola: add low 3
lola: add low 5
lola: add low 0
lola: add low 3
lola: add low 5
lola: add low 0
lola: add low 3
lola: add low 5
lola: add low 0
lola: add low 3
lola: add low 5
lola: add low 0
lola: add low 3
lola: add low 5
lola: add low 0
lola: add low 3
lola: add low 5
lola: add low 0
lola: add low 3
lola: add low 5
lola: add low 0
lola: add low 3
lola: add low 5
lola: add low 0
lola: add low 3
lola: add low 5
lola: add low 0
lola: add low 3
lola: add low 5
lola: add low 0
lola: add low 3
lola: add low 5
lola: add low 0
lola: add low 3
lola: add low 5
lola: add low 0
lola: add low 3
lola: add low 5
lola: add low 0
lola: add low 3
lola: add low 5
lola: add low 0
lola: add low 3
lola: add low 5
lola: add low 0
lola: add low 3
lola: add low 5
lola: add low 0
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 3
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 5
lola: add low 0
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 3
lola: add low 3
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 2
lola: add low 1
lola: add low 4
lola: add low 2
lola: add low 1
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3300 markings, 4463 edges
lola: ========================================
lola: subprocess 8 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F (G ((G ((p1 + 1 <= p7)) OR (p1 <= 1)))) AND ((p7 <= p1) OR (3 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F (G ((G ((p1 + 1 <= p7)) OR (p1 <= 1)))) AND ((p7 <= p1) OR (3 <= p2)))))
lola: processed formula length: 82
lola: 58 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 267 markings, 301 edges
lola: ========================================
lola: subprocess 9 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p4 <= p6) AND (F (G ((p6 + 1 <= p5))) OR G ((p4 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p4 <= p6) AND (F (G ((p6 + 1 <= p5))) OR G ((p4 <= p6)))))
lola: processed formula length: 63
lola: 58 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: 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 0
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: 107771 markings, 205351 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no no no
lola:
preliminary result: no no no no no no no no no no
lola: memory consumption: 20292 KB
lola: time consumption: 5 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="TwoPhaseLocking-PT-nC00050vD"
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 TwoPhaseLocking-PT-nC00050vD, 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 r322-tall-162132127900129"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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