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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 388K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 117K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 93K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Mar 28 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 28 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 14:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 14:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 20:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 20:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 3.9K May 5 16:52 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SwimmingPool-PT-03-00
FORMULA_NAME SwimmingPool-PT-03-01
FORMULA_NAME SwimmingPool-PT-03-02
FORMULA_NAME SwimmingPool-PT-03-03
FORMULA_NAME SwimmingPool-PT-03-04
FORMULA_NAME SwimmingPool-PT-03-05
FORMULA_NAME SwimmingPool-PT-03-06
FORMULA_NAME SwimmingPool-PT-03-07
FORMULA_NAME SwimmingPool-PT-03-08
FORMULA_NAME SwimmingPool-PT-03-09
FORMULA_NAME SwimmingPool-PT-03-10
FORMULA_NAME SwimmingPool-PT-03-11
FORMULA_NAME SwimmingPool-PT-03-12
FORMULA_NAME SwimmingPool-PT-03-13
FORMULA_NAME SwimmingPool-PT-03-14
FORMULA_NAME SwimmingPool-PT-03-15

=== Now, execution of the tool begins

BK_START 1621224385071

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

FORMULA SwimmingPool-PT-03-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA SwimmingPool-PT-03-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

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

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

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

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

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Mon May 17 04:06:27 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (F ((p1 <= p3))))",
"processed_size": 22,
"rewrites": 77
},
"result":
{
"edges": 73,
"markings": 73,
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (((G (F (((p8 <= 0) AND (p5 <= 2)))) OR (p1 + 1 <= p6)) U (p6 <= p1)))",
"processed_size": 72,
"rewrites": 77
},
"result":
{
"edges": 73,
"markings": 72,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((G (F ((X (F ((1 <= p3))) AND (1 <= p3)))) AND (p5 <= p6)))",
"processed_size": 62,
"rewrites": 77
},
"result":
{
"edges": 445076382,
"markings": 67640481,
"produced_by": "LTL model checker",
"value": true
},
"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": 403
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"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": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((X (F ((3 <= p8))) OR F (G ((2 <= p7)))))",
"processed_size": 44,
"rewrites": 77
},
"result":
{
"edges": 140630332,
"markings": 38709305,
"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": 445
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((X ((2 <= p6)) OR F (G ((G ((p1 <= p7)) AND (1 <= p6))))))",
"processed_size": 61,
"rewrites": 77
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 519
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((X (X ((1 <= p5))) AND (p2 <= p6)) U G ((G ((p6 + 1 <= p2)) AND (p6 + 1 <= p2))))",
"processed_size": 82,
"rewrites": 77
},
"result":
{
"edges": 66,
"markings": 66,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 13
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 779
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((p3 + 1 <= p6)))",
"processed_size": 22,
"rewrites": 77
},
"result":
{
"edges": 70,
"markings": 69,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1039
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 4,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 5,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G ((F ((G ((p0 <= 0)) OR (G ((p0 + 1 <= p6)) AND (p0 <= 0)))) AND (G ((p2 + 1 <= p7)) OR (p2 + 1 <= p7)))))",
"processed_size": 110,
"rewrites": 77
},
"result":
{
"edges": 73,
"markings": 73,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 15
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1559
},
"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": "(p3 <= p2)",
"processed_size": 10,
"rewrites": 77
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3118
},
"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": "(p6 + 1 <= p1)",
"processed_size": 14,
"rewrites": 77
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"child":
[

{
"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": "(p6 + 1 <= p1)",
"processed_size": 14,
"rewrites": 77
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((G (F ((p3 + 1 <= p6))) OR (2 <= p1)))",
"processed_size": 41,
"rewrites": 77
},
"result":
{
"edges": 73,
"markings": 73,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 23548,
"runtime": 452.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(G(*) AND **) : X((G((X(**) AND **)) OR (** OR (X(X(X(**))) AND **)))) : X(X(F(**))) : X(((G(F(*)) OR **) U **)) : X((G(F((X(F(**)) AND **))) AND **)) : G((X(F(**)) OR F(G(**)))) : (F((G(F(*)) OR *)) OR **) : F((X(**) OR F(G((G(**) AND **))))) : F(G(*)) : F(G((F((G(*) OR (G(*) AND *))) AND (G(*) OR *)))) : ((X(X(**)) AND **) U G((G(**) AND **))) : (X((X(F(*)) AND ((G(*) R *) R *))) OR G(**))"
},
"net":
{
"arcs": 20,
"conflict_clusters": 6,
"places": 9,
"places_significant": 6,
"singleton_clusters": 0,
"transitions": 7
},
"result":
{
"preliminary_value": "no yes no no yes no no yes no no no no ",
"value": "no yes no no yes no no yes 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: 16/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 7 transitions, 6 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: (G (NOT(F ((((F ((p8 <= p0)) AND (p8 <= p6)) OR (p3 <= p6)) U (p8 <= p0))))) AND (p3 <= p2)) : X (((G ((X ((2 <= p8)) AND (3 <= p8))) OR (1 <= p8)) OR (X (X (X ((1 <= p8)))) AND (2 <= p8)))) : X (F (X ((F (NOT(X (NOT(((p8 + 1 <= p7) U X ((p6 <= p5))))))) U (p1 <= p3))))) : X (((NOT(G (F (G (((1 <= p8) OR (3 <= p5)))))) OR (p1 + 1 <= p6)) U (p6 <= p1))) : X ((F (G (F (((p6 <= p2) U (X (F ((1 <= p3))) AND (1 <= p3)))))) AND (p5 <= p6))) : G ((F (X ((3 <= p8))) OR X (X (((2 <= p7) U F (G (X ((2 <= p7))))))))) : (NOT(G ((F (G ((p6 <= p3))) AND (p1 <= 1)))) OR (p6 + 1 <= p1)) : F ((X ((2 <= p6)) OR F (G (X ((G ((p1 <= p7)) AND (1 <= p6))))))) : F (NOT(G (F ((F (NOT(X ((p8 <= p2)))) U F ((p6 <= p3))))))) : F (NOT(F ((G ((F ((p6 <= p0)) U (1 <= p0))) OR (F ((p7 <= p2)) AND (p7 <= p2)))))) : ((X (X ((1 <= p5))) AND (p2 <= p6)) U G ((G ((p6 + 1 <= p2)) AND (p6 + 1 <= p2)))) : (NOT(X ((X (G ((1 <= p6))) OR ((F ((p1 <= p5)) U (3 <= p4)) U (p5 <= p2))))) OR G ((3 <= p4)))
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:374
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:318
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: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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((X ((2 <= p8)) AND (3 <= p8))) OR ((1 <= p8) OR (X (X (X ((1 <= p8)))) AND (2 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((X ((2 <= p8)) AND (3 <= p8))) OR ((1 <= p8) OR (X (X (X ((1 <= p8)))) AND (2 <= p8)))))
lola: processed formula length: 95
lola: 77 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 15 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((p1 <= p3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((p1 <= p3))))
lola: processed formula length: 22
lola: 77 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: 73 markings, 73 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((G (F (((p8 <= 0) AND (p5 <= 2)))) OR (p1 + 1 <= p6)) U (p6 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((G (F (((p8 <= 0) AND (p5 <= 2)))) OR (p1 + 1 <= p6)) U (p6 <= p1)))
lola: processed formula length: 72
lola: 77 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: 72 markings, 73 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (F ((X (F ((1 <= p3))) AND (1 <= p3)))) AND (p5 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (F ((X (F ((1 <= p3))) AND (1 <= p3)))) AND (p5 <= p6)))
lola: processed formula length: 62
lola: 77 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: ========================================
lola: 2303267 markings, 9703099 edges, 460653 markings/sec, 0 secs
lola: 4048372 markings, 18219249 edges, 349021 markings/sec, 5 secs
lola: 5733687 markings, 26651216 edges, 337063 markings/sec, 10 secs
lola: 7336797 markings, 34780923 edges, 320622 markings/sec, 15 secs
lola: 8942208 markings, 42859320 edges, 321082 markings/sec, 20 secs
lola: 10516658 markings, 50674388 edges, 314890 markings/sec, 25 secs
lola: 12064540 markings, 58202292 edges, 309576 markings/sec, 30 secs
lola: 13603945 markings, 65557821 edges, 307881 markings/sec, 35 secs
lola: 14992777 markings, 72068514 edges, 277766 markings/sec, 40 secs
lola: 16320811 markings, 78177225 edges, 265607 markings/sec, 45 secs
lola: 17753808 markings, 84664639 edges, 286599 markings/sec, 50 secs
lola: 19334571 markings, 91654697 edges, 316153 markings/sec, 55 secs
lola: 20921778 markings, 98612668 edges, 317441 markings/sec, 60 secs
lola: 22534015 markings, 105549961 edges, 322447 markings/sec, 65 secs
lola: 24161585 markings, 112424455 edges, 325514 markings/sec, 70 secs
lola: 25805321 markings, 119315490 edges, 328747 markings/sec, 75 secs
lola: 27453248 markings, 126139464 edges, 329585 markings/sec, 80 secs
lola: 29108042 markings, 132926665 edges, 330959 markings/sec, 85 secs
lola: 30763393 markings, 139663690 edges, 331070 markings/sec, 90 secs
lola: 32446712 markings, 146428377 edges, 336664 markings/sec, 95 secs
lola: 34141015 markings, 153200907 edges, 338861 markings/sec, 100 secs
lola: 35864662 markings, 159984607 edges, 344729 markings/sec, 105 secs
lola: 37600913 markings, 166764279 edges, 347250 markings/sec, 110 secs
lola: 39347939 markings, 173527906 edges, 349405 markings/sec, 115 secs
lola: 41037690 markings, 180015474 edges, 337950 markings/sec, 120 secs
lola: 42601167 markings, 185963620 edges, 312695 markings/sec, 125 secs
lola: 44211282 markings, 192062207 edges, 322023 markings/sec, 130 secs
lola: 45902357 markings, 198414178 edges, 338215 markings/sec, 135 secs
lola: 47627290 markings, 204874820 edges, 344987 markings/sec, 140 secs
lola: 49357080 markings, 211339339 edges, 345958 markings/sec, 145 secs
lola: 51099709 markings, 217839026 edges, 348526 markings/sec, 150 secs
lola: 52864467 markings, 224419359 edges, 352952 markings/sec, 155 secs
lola: 54638919 markings, 231035490 edges, 354890 markings/sec, 160 secs
lola: 56417841 markings, 237673351 edges, 355784 markings/sec, 165 secs
lola: 58198505 markings, 244305850 edges, 356133 markings/sec, 170 secs
lola: 59974282 markings, 250933098 edges, 355155 markings/sec, 175 secs
lola: 61750124 markings, 257555468 edges, 355168 markings/sec, 180 secs
lola: 63519562 markings, 264154004 edges, 353888 markings/sec, 185 secs
lola: 65289888 markings, 270746102 edges, 354065 markings/sec, 190 secs
lola: 67047090 markings, 277277806 edges, 351440 markings/sec, 195 secs
lola: 67618282 markings, 283743084 edges, 114238 markings/sec, 200 secs
lola: 67623024 markings, 289570735 edges, 948 markings/sec, 205 secs
lola: 67625526 markings, 295326521 edges, 500 markings/sec, 210 secs
lola: 67627996 markings, 301041957 edges, 494 markings/sec, 215 secs
lola: 67630025 markings, 306745063 edges, 406 markings/sec, 220 secs
lola: 67631739 markings, 312502616 edges, 343 markings/sec, 225 secs
lola: 67633249 markings, 318313642 edges, 302 markings/sec, 230 secs
lola: 67634694 markings, 324082427 edges, 289 markings/sec, 235 secs
lola: 67635872 markings, 329811585 edges, 236 markings/sec, 240 secs
lola: 67636838 markings, 335471451 edges, 193 markings/sec, 245 secs
lola: 67637535 markings, 340912356 edges, 139 markings/sec, 250 secs
lola: 67638023 markings, 346184086 edges, 98 markings/sec, 255 secs
lola: 67638500 markings, 351676061 edges, 95 markings/sec, 260 secs
lola: 67638844 markings, 357355134 edges, 69 markings/sec, 265 secs
lola: 67639131 markings, 363091107 edges, 57 markings/sec, 270 secs
lola: 67639330 markings, 368922204 edges, 40 markings/sec, 275 secs
lola: 67639541 markings, 374854515 edges, 42 markings/sec, 280 secs
lola: 67639709 markings, 380811453 edges, 34 markings/sec, 285 secs
lola: 67639823 markings, 386784347 edges, 23 markings/sec, 290 secs
lola: 67639924 markings, 392783287 edges, 20 markings/sec, 295 secs
lola: 67639997 markings, 398831806 edges, 15 markings/sec, 300 secs
lola: 67640063 markings, 404917599 edges, 13 markings/sec, 305 secs
lola: 67640110 markings, 411043512 edges, 9 markings/sec, 310 secs
lola: 67640145 markings, 417165651 edges, 7 markings/sec, 315 secs
lola: 67640174 markings, 423185216 edges, 6 markings/sec, 320 secs
lola: 67640180 markings, 429501525 edges, 1 markings/sec, 325 secs
lola: 67640181 markings, 436049204 edges, 0 markings/sec, 330 secs
lola: 67640274 markings, 442869570 edges, 19 markings/sec, 335 secs
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: 67640481 markings, 445076382 edges
lola: ========================================
lola: subprocess 4 will run for 403 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (F ((3 <= p8))) OR F (G ((2 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (F ((3 <= p8))) OR F (G ((2 <= p7)))))
lola: processed formula length: 44
lola: 77 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: 2348868 markings, 7883585 edges, 469774 markings/sec, 0 secs
lola: 4288366 markings, 14665355 edges, 387900 markings/sec, 5 secs
lola: 6119082 markings, 21141489 edges, 366143 markings/sec, 10 secs
lola: 7978982 markings, 27771243 edges, 371980 markings/sec, 15 secs
lola: 9931158 markings, 34776477 edges, 390435 markings/sec, 20 secs
lola: 11853122 markings, 41713501 edges, 384393 markings/sec, 25 secs
lola: 13753322 markings, 48600192 edges, 380040 markings/sec, 30 secs
lola: 15651211 markings, 55504133 edges, 379578 markings/sec, 35 secs
lola: 17547206 markings, 62421047 edges, 379199 markings/sec, 40 secs
lola: 19427316 markings, 69303080 edges, 376022 markings/sec, 45 secs
lola: 21298644 markings, 76167994 edges, 374266 markings/sec, 50 secs
lola: 23154458 markings, 82989986 edges, 371163 markings/sec, 55 secs
lola: 24979086 markings, 89704504 edges, 364926 markings/sec, 60 secs
lola: 26789548 markings, 96390474 edges, 362092 markings/sec, 65 secs
lola: 28601730 markings, 103086441 edges, 362436 markings/sec, 70 secs
lola: 30329759 markings, 109487313 edges, 345606 markings/sec, 75 secs
lola: 31889232 markings, 115261799 edges, 311895 markings/sec, 80 secs
lola: 33435738 markings, 121002507 edges, 309301 markings/sec, 85 secs
lola: 34986388 markings, 126763088 edges, 310130 markings/sec, 90 secs
lola: 36704454 markings, 133152916 edges, 343613 markings/sec, 95 secs
lola: 38387872 markings, 139423576 edges, 336684 markings/sec, 100 secs
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: 38709305 markings, 140630332 edges
lola: ========================================
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X ((2 <= p6)) OR F (G ((G ((p1 <= p7)) AND (1 <= p6))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((2 <= p6)) OR F (G ((G ((p1 <= p7)) AND (1 <= p6))))))
lola: processed formula length: 61
lola: 77 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 6 will run for 519 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (X ((1 <= p5))) AND (p2 <= p6)) U G ((G ((p6 + 1 <= p2)) AND (p6 + 1 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((X (X ((1 <= p5))) AND (p2 <= p6)) U G ((G ((p6 + 1 <= p2)) AND (p6 + 1 <= p2))))
lola: processed formula length: 82
lola: 77 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 13 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: 66 markings, 66 edges
lola: ========================================
lola: subprocess 7 will run for 623 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((X (F ((p6 <= 0))) AND ((G ((p5 + 1 <= p1)) R (p4 <= 2)) R (p2 + 1 <= p5)))) OR G ((3 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 623 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((3 <= p4))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((3 <= p4))
lola: processed formula length: 13
lola: 77 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: 216 markings, 216 edges
lola: ========================================
lola: subprocess 8 will run for 779 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (F ((p6 <= 0))) AND ((G ((p5 + 1 <= p1)) R (p4 <= 2)) R (p2 + 1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (F ((p6 <= 0))) AND ((G ((p5 + 1 <= p1)) R (p4 <= 2)) R (p2 + 1 <= p5))))
lola: processed formula length: 79
lola: 77 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 13 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: 66 markings, 66 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 779 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p3 + 1 <= p6)))
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 ((p3 + 1 <= p6)))
lola: processed formula length: 22
lola: 77 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: 69 markings, 70 edges
lola: ========================================
lola: subprocess 9 will run for 1039 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((G ((p0 <= 0)) OR (G ((p0 + 1 <= p6)) AND (p0 <= 0)))) AND (G ((p2 + 1 <= p7)) OR (p2 + 1 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((G ((p0 <= 0)) OR (G ((p0 + 1 <= p6)) AND (p0 <= 0)))) AND (G ((p2 + 1 <= p7)) OR (p2 + 1 <= p7)))))
lola: processed formula length: 110
lola: 77 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 15 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: 73 markings, 73 edges
lola: ========================================
lola: subprocess 10 will run for 1559 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((p0 + 1 <= p8)) AND (p3 <= p2))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1559 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p3 <= p2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p3 <= p2)
lola: processed formula length: 10
lola: 77 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 11 will run for 3118 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p0 + 1 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p0 + 1 <= p8))
lola: processed formula length: 18
lola: 77 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: 216 markings, 216 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 3118 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((G (F ((p3 + 1 <= p6))) OR (2 <= p1))) OR (p6 + 1 <= p1))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3118 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p6 + 1 <= p1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p6 + 1 <= p1)
lola: processed formula length: 14
lola: 77 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (F ((G (F ((p3 + 1 <= p6))) OR (2 <= p1))) OR (p6 + 1 <= p1))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p6 + 1 <= p1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p6 + 1 <= p1)
lola: processed formula length: 14
lola: 77 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: ========================================
lola: ...considering subproblem: F ((G (F ((p3 + 1 <= p6))) OR (2 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (F ((p3 + 1 <= p6))) OR (2 <= p1)))
lola: processed formula length: 41
lola: 77 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: 73 markings, 73 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no yes no no yes no no no no
lola:
preliminary result: no yes no no yes no no yes no no no no
lola: ========================================
lola: memory consumption: 23548 KB
lola: time consumption: 452 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SwimmingPool-PT-03"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is SwimmingPool-PT-03, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r265-tall-162106800700365"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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