fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r180-ebro-158987900300458
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for DLCround-PT-03b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15738.930 3600000.00 508242.00 306.80 FTFFFFFTFFFTFFFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r180-ebro-158987900300458.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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 itslola
Input is DLCround-PT-03b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987900300458
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 4.3K Mar 30 18:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 30 18:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 29 08:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 29 08:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 04:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 28 04:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 26 22:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 26 22:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 432K Mar 24 05:37 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 DLCround-PT-03b-00
FORMULA_NAME DLCround-PT-03b-01
FORMULA_NAME DLCround-PT-03b-02
FORMULA_NAME DLCround-PT-03b-03
FORMULA_NAME DLCround-PT-03b-04
FORMULA_NAME DLCround-PT-03b-05
FORMULA_NAME DLCround-PT-03b-06
FORMULA_NAME DLCround-PT-03b-07
FORMULA_NAME DLCround-PT-03b-08
FORMULA_NAME DLCround-PT-03b-09
FORMULA_NAME DLCround-PT-03b-10
FORMULA_NAME DLCround-PT-03b-11
FORMULA_NAME DLCround-PT-03b-12
FORMULA_NAME DLCround-PT-03b-13
FORMULA_NAME DLCround-PT-03b-14
FORMULA_NAME DLCround-PT-03b-15

=== Now, execution of the tool begins

BK_START 1591229902527

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 00:18:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 00:18:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 00:18:26] [INFO ] Load time of PNML (sax parser for PT used): 278 ms
[2020-06-04 00:18:26] [INFO ] Transformed 1383 places.
[2020-06-04 00:18:26] [INFO ] Transformed 1887 transitions.
[2020-06-04 00:18:26] [INFO ] Found NUPN structural information;
[2020-06-04 00:18:26] [INFO ] Parsed PT model containing 1383 places and 1887 transitions in 383 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 117 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 5 resets, run finished after 742 ms. (steps per millisecond=134 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 1887 rows 1383 cols
[2020-06-04 00:18:27] [INFO ] Computed 52 place invariants in 117 ms
[2020-06-04 00:18:28] [INFO ] [Real]Absence check using 52 positive place invariants in 172 ms returned sat
[2020-06-04 00:18:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:18:36] [INFO ] [Real]Absence check using state equation in 8740 ms returned sat
[2020-06-04 00:18:37] [INFO ] Computed and/alt/rep : 1886/4162/1886 causal constraints in 373 ms.
[2020-06-04 00:18:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:18:45] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 00:18:48] [INFO ] [Nat]Absence check using 52 positive place invariants in 9505 ms returned unknown
[2020-06-04 00:18:49] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-04 00:18:49] [INFO ] Flatten gal took : 334 ms
FORMULA DLCround-PT-03b-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03b-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03b-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03b-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03b-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03b-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 00:18:49] [INFO ] Applying decomposition
[2020-06-04 00:18:49] [INFO ] Flatten gal took : 179 ms
[2020-06-04 00:18:49] [INFO ] Decomposing Gal with order
[2020-06-04 00:18:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-04 00:18:50] [INFO ] Removed a total of 812 redundant transitions.
[2020-06-04 00:18:50] [INFO ] Flatten gal took : 301 ms
[2020-06-04 00:18:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 2211 labels/synchronizations in 388 ms.
[2020-06-04 00:18:50] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 7 ms.
[2020-06-04 00:18:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 33 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ DLCround-PT-03b @ 3570 seconds

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

FORMULA DLCround-PT-03b-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA DLCround-PT-03b-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

FORMULA DLCround-PT-03b-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3112
rslt: Output for LTLFireability @ DLCround-PT-03b

{
"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=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 00:18:51 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 354
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"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 (F (((1 <= p437))))",
"processed_size": 21,
"rewrites": 69
},
"result":
{
"edges": 353,
"markings": 353,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"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": 394
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"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": "X ((G (((p437 <= 0))) OR F (((p1073 <= 0)))))",
"processed_size": 45,
"rewrites": 69
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 394
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "((p1288 <= 0))",
"processed_size": 14,
"rewrites": 71
},
"result":
{
"edges": 353,
"markings": 353,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 11
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 443
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"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": "X ((G (F (((1 <= p741)))) AND ((p1302 <= 0))))",
"processed_size": 46,
"rewrites": 69
},
"result":
{
"edges": 77,
"markings": 77,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 506
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 3,
"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": "F (G ((G (F (((1 <= p596) AND (1 <= p1319)))) AND X (((1 <= p1000))))))",
"processed_size": 71,
"rewrites": 69
},
"result":
{
"edges": 103,
"markings": 102,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 591
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 2,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((X (((1 <= p584))) U ((1 <= p1022))) U X (((1 <= p782))))",
"processed_size": 58,
"rewrites": 69
},
"result":
{
"edges": 76,
"markings": 76,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 709
},
"child":
[

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 886
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(((1 <= p401)) U (G (((1 <= p376))) OR (((1 <= p365)) OR ((1 <= p401)))))",
"processed_size": 73,
"rewrites": 69
},
"result":
{
"edges": 353,
"markings": 353,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 6,
"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": 1181
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "((p365 <= 0))",
"processed_size": 13,
"rewrites": 71
},
"result":
{
"edges": 353,
"markings": 353,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"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": 1772
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"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 (X (((1 <= p365))))",
"processed_size": 21,
"rewrites": 69
},
"result":
{
"edges": 76,
"markings": 76,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1181
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"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": "F ((X (((1 <= p159))) AND ((p278 <= 0) OR (p1229 <= 0))))",
"processed_size": 58,
"rewrites": 69
},
"result":
{
"edges": 76,
"markings": 76,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1772
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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 (F (((p791 <= 0))))",
"processed_size": 21,
"rewrites": 69
},
"result":
{
"edges": 17519220,
"markings": 15232602,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3112
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p637) AND (1 <= p1319))))",
"processed_size": 38,
"rewrites": 69
},
"result":
{
"edges": 354,
"markings": 353,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 55916,
"runtime": 458.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X((G(*) OR F(*))) OR (G(F(**)) AND X(F((G(*) OR F(*)))))) : ((** U **) OR (F(**) AND F(G((F(**) AND (X(**) OR (G(**) OR **))))))) : X((G(F(**)) AND **)) : F(G((G(F(**)) AND X(**)))) : F(G(**)) : ((X(**) U **) U X(**)) : (X(**) OR (X(F(**)) AND F(G((X((X(**) U **)) OR (** OR **)))))) : G(F(**)) : ((** U (G(**) OR (** OR **))) OR (F(**) OR X(X(**)))) : F((X(**) AND **))"
},
"net":
{
"arcs": 4809,
"conflict_clusters": 1227,
"places": 1383,
"places_significant": 1331,
"singleton_clusters": 0,
"transitions": 1887
},
"result":
{
"preliminary_value": "yes no no no no no no no no no ",
"value": "yes 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: 3270/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1383
lola: finding significant places
lola: 1383 places, 1887 transitions, 1331 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 LTLFireability.xml
lola: LP says that atomic proposition is always true: (p437 <= 1)
lola: LP says that atomic proposition is always true: (p437 <= 1)
lola: LP says that atomic proposition is always true: (p1073 <= 1)
lola: LP says that atomic proposition is always true: (p663 <= 1)
lola: LP says that atomic proposition is always true: (p1339 <= 1)
lola: LP says that atomic proposition is always true: (p1017 <= 1)
lola: LP says that atomic proposition is always true: (p1017 <= 1)
lola: LP says that atomic proposition is always true: (p1017 <= 1)
lola: LP says that atomic proposition is always true: (p1288 <= 1)
lola: LP says that atomic proposition is always true: (p302 <= 1)
lola: LP says that atomic proposition is always true: (p741 <= 1)
lola: LP says that atomic proposition is always true: (p1302 <= 1)
lola: LP says that atomic proposition is always true: (p596 <= 1)
lola: LP says that atomic proposition is always true: (p1319 <= 1)
lola: LP says that atomic proposition is always true: (p1000 <= 1)
lola: LP says that atomic proposition is always true: (p637 <= 1)
lola: LP says that atomic proposition is always true: (p1319 <= 1)
lola: LP says that atomic proposition is always true: (p584 <= 1)
lola: LP says that atomic proposition is always true: (p1022 <= 1)
lola: LP says that atomic proposition is always true: (p782 <= 1)
lola: LP says that atomic proposition is always true: (p856 <= 1)
lola: LP says that atomic proposition is always true: (p347 <= 1)
lola: LP says that atomic proposition is always true: (p1176 <= 1)
lola: LP says that atomic proposition is always true: (p347 <= 1)
lola: LP says that atomic proposition is always true: (p1176 <= 1)
lola: LP says that atomic proposition is always true: (p356 <= 1)
lola: LP says that atomic proposition is always true: (p1176 <= 1)
lola: LP says that atomic proposition is always true: (p791 <= 1)
lola: LP says that atomic proposition is always true: (p791 <= 1)
lola: LP says that atomic proposition is always true: (p401 <= 1)
lola: LP says that atomic proposition is always true: (p376 <= 1)
lola: LP says that atomic proposition is always true: (p365 <= 1)
lola: LP says that atomic proposition is always true: (p401 <= 1)
lola: LP says that atomic proposition is always true: (p365 <= 1)
lola: LP says that atomic proposition is always true: (p365 <= 1)
lola: LP says that atomic proposition is always true: (p159 <= 1)
lola: LP says that atomic proposition is always true: (p278 <= 1)
lola: LP says that atomic proposition is always true: (p1229 <= 1)
lola: (X (G (F (((1 <= p437))))) U (NOT(F (X (((1 <= p437))))) OR NOT(G (X (((1 <= p1073))))))) : (F (G (((X (((1 <= p663) AND (1 <= p1339))) OR G (((1 <= p1017)))) U ((1 <= p1017))))) U (((1 <= p1017)) U ((1 <= p1288)))) : X ((NOT(F ((((1 <= p302)) U X (G (NOT(X (X (X (((1 <= p741))))))))))) AND ((p1302 <= 0)))) : G (F (NOT(X (NOT(G ((G (F (((1 <= p596) AND (1 <= p1319)))) AND X (((1 <= p1000)))))))))) : G (F (G (F (G (X (((1 <= p637) AND (1 <= p1319)))))))) : ((X (((1 <= p584))) U ((1 <= p1022))) U X (((1 <= p782)))) : (F (G (((X ((X (((1 <= p856))) U ((1 <= p347) AND (1 <= p1176)))) OR ((p347 <= 0))) OR ((p1176 <= 0))))) U X (((1 <= p356) AND (1 <= p1176)))) : X (X (X (G ((((1 <= p791)) U ((p791 <= 0))))))) : (((((1 <= p401)) U ((G (((1 <= p376))) OR ((1 <= p365))) OR ((1 <= p401)))) OR F (((1 <= p365)))) OR X (X (((1 <= p365))))) : F ((X (((1 <= p159))) AND ((p278 <= 0) OR (p1229 <= 0))))
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: 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:528
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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: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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:419
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((G (((p437 <= 0))) OR F (((p1073 <= 0))))) OR (G (F (((1 <= p437)))) AND X (F ((G (((p437 <= 0))) OR F (((p1073 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p437))))
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 (((1 <= p437))))
lola: processed formula length: 21
lola: 69 rewrites
lola: closed formula file LTLFireability.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: 353 markings, 353 edges
lola: ========================================
lola: subprocess 1 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((p437 <= 0))) OR F (((p1073 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((p437 <= 0))) OR F (((p1073 <= 0)))))
lola: processed formula length: 45
lola: 69 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p1017)) U ((1 <= p1288))) OR (F (((1 <= p1288))) AND F (G ((F (((1 <= p1017))) AND (X (((1 <= p663) AND (1 <= p1339))) OR (G (((1 <= p1017))) OR ((1 <= p1017)))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p1288)))
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: ((p1288 <= 0))
lola: processed formula length: 14
lola: 71 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 353 markings, 353 edges
lola: ========================================
lola: subprocess 2 will run for 443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p1017)) U ((1 <= p1288)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p1017)) U ((1 <= p1288)))
lola: processed formula length: 33
lola: 69 rewrites
lola: closed formula file LTLFireability.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: 353 markings, 353 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (F (((1 <= p741)))) AND ((p1302 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (F (((1 <= p741)))) AND ((p1302 <= 0))))
lola: processed formula length: 46
lola: 69 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 77 markings, 77 edges
lola: ========================================
lola: subprocess 3 will run for 506 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G (F (((1 <= p596) AND (1 <= p1319)))) AND X (((1 <= p1000))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G (F (((1 <= p596) AND (1 <= p1319)))) AND X (((1 <= p1000))))))
lola: processed formula length: 71
lola: 69 rewrites
lola: closed formula file LTLFireability.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: 102 markings, 103 edges
lola: ========================================
lola: subprocess 4 will run for 591 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (((1 <= p584))) U ((1 <= p1022))) U X (((1 <= p782))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((X (((1 <= p584))) U ((1 <= p1022))) U X (((1 <= p782))))
lola: processed formula length: 58
lola: 69 rewrites
lola: closed formula file LTLFireability.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: 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: 76 markings, 76 edges
lola: ========================================
lola: subprocess 5 will run for 709 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((1 <= p356) AND (1 <= p1176))) OR (X (F (((1 <= p356) AND (1 <= p1176)))) AND F (G ((X ((X (((1 <= p856))) U ((1 <= p347) AND (1 <= p1176)))) OR (((p347 <= 0)) OR ((p1176 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 709 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p356) AND (1 <= p1176)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p356) AND (1 <= p1176)))
lola: processed formula length: 34
lola: 69 rewrites
lola: closed formula file LTLFireability.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: 76 markings, 76 edges
lola: ========================================
lola: subprocess 6 will run for 886 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p356) AND (1 <= p1176))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p356) AND (1 <= p1176))))
lola: processed formula length: 38
lola: 69 rewrites
lola: closed formula file LTLFireability.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: 76 markings, 76 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 886 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p401)) U (G (((1 <= p376))) OR (((1 <= p365)) OR ((1 <= p401))))) OR (F (((1 <= p365))) OR X (X (((1 <= p365))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 886 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p401)) U (G (((1 <= p376))) OR (((1 <= p365)) OR ((1 <= p401)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p401)) U (G (((1 <= p376))) OR (((1 <= p365)) OR ((1 <= p401)))))
lola: processed formula length: 73
lola: 69 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 353 markings, 353 edges
lola: ========================================
lola: subprocess 7 will run for 1181 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p365)))
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: ((p365 <= 0))
lola: processed formula length: 13
lola: 71 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 353 markings, 353 edges
lola: ========================================
lola: subprocess 8 will run for 1772 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (((1 <= p365))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (((1 <= p365))))
lola: processed formula length: 21
lola: 69 rewrites
lola: closed formula file LTLFireability.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: 76 markings, 76 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 1181 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (((1 <= p159))) AND ((p278 <= 0) OR (p1229 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (((1 <= p159))) AND ((p278 <= 0) OR (p1229 <= 0))))
lola: processed formula length: 58
lola: 69 rewrites
lola: closed formula file LTLFireability.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: 76 markings, 76 edges
lola: ========================================
lola: subprocess 8 will run for 1772 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((p791 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((p791 <= 0))))
lola: processed formula length: 21
lola: 69 rewrites
lola: closed formula file LTLFireability.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: 175590 markings, 201740 edges, 35118 markings/sec, 0 secs
lola: 351925 markings, 404340 edges, 35267 markings/sec, 5 secs
lola: 519474 markings, 596888 edges, 33510 markings/sec, 10 secs
lola: 690945 markings, 794687 edges, 34294 markings/sec, 15 secs
lola: 865678 markings, 996669 edges, 34947 markings/sec, 20 secs
lola: 1041837 markings, 1199326 edges, 35232 markings/sec, 25 secs
lola: 1218005 markings, 1401869 edges, 35234 markings/sec, 30 secs
lola: 1394504 markings, 1605987 edges, 35300 markings/sec, 35 secs
lola: 1570996 markings, 1810209 edges, 35298 markings/sec, 40 secs
lola: 1741699 markings, 2008199 edges, 34141 markings/sec, 45 secs
lola: 1917241 markings, 2213574 edges, 35108 markings/sec, 50 secs
lola: 2092336 markings, 2417808 edges, 35019 markings/sec, 55 secs
lola: 2268260 markings, 2620547 edges, 35185 markings/sec, 60 secs
lola: 2443602 markings, 2821849 edges, 35068 markings/sec, 65 secs
lola: 2619529 markings, 3024737 edges, 35185 markings/sec, 70 secs
lola: 2789626 markings, 3219967 edges, 34019 markings/sec, 75 secs
lola: 2966631 markings, 3425162 edges, 35401 markings/sec, 80 secs
lola: 3143509 markings, 3630577 edges, 35376 markings/sec, 85 secs
lola: 3321294 markings, 3837844 edges, 35557 markings/sec, 90 secs
lola: 3497292 markings, 4043240 edges, 35200 markings/sec, 95 secs
lola: 3675966 markings, 4253606 edges, 35735 markings/sec, 100 secs
lola: 3854229 markings, 4463444 edges, 35653 markings/sec, 105 secs
lola: 4031682 markings, 4669512 edges, 35491 markings/sec, 110 secs
lola: 4209274 markings, 4875497 edges, 35518 markings/sec, 115 secs
lola: 4389417 markings, 5088796 edges, 36029 markings/sec, 120 secs
lola: 4568143 markings, 5299927 edges, 35745 markings/sec, 125 secs
lola: 4747142 markings, 5511044 edges, 35800 markings/sec, 130 secs
lola: 4925313 markings, 5721482 edges, 35634 markings/sec, 135 secs
lola: 5104173 markings, 5932544 edges, 35772 markings/sec, 140 secs
lola: 5283206 markings, 6144530 edges, 35807 markings/sec, 145 secs
lola: 5462958 markings, 6357921 edges, 35950 markings/sec, 150 secs
lola: 5642294 markings, 6569603 edges, 35867 markings/sec, 155 secs
lola: 5822315 markings, 6783732 edges, 36004 markings/sec, 160 secs
lola: 6000076 markings, 6992367 edges, 35552 markings/sec, 165 secs
lola: 6180762 markings, 7207069 edges, 36137 markings/sec, 170 secs
lola: 6362973 markings, 7424265 edges, 36442 markings/sec, 175 secs
lola: 6543305 markings, 7637964 edges, 36066 markings/sec, 180 secs
lola: 6724322 markings, 7852822 edges, 36203 markings/sec, 185 secs
lola: 6904691 markings, 8066725 edges, 36074 markings/sec, 190 secs
lola: 7083075 markings, 8278580 edges, 35677 markings/sec, 195 secs
lola: 7262541 markings, 8491764 edges, 35893 markings/sec, 200 secs
lola: 7441511 markings, 8704091 edges, 35794 markings/sec, 205 secs
lola: 7614707 markings, 8909629 edges, 34639 markings/sec, 210 secs
lola: 7792627 markings, 9119669 edges, 35584 markings/sec, 215 secs
lola: 7970725 markings, 9330769 edges, 35620 markings/sec, 220 secs
lola: 8149272 markings, 9543987 edges, 35709 markings/sec, 225 secs
lola: 8319210 markings, 9736099 edges, 33988 markings/sec, 230 secs
lola: 8494259 markings, 9932500 edges, 35010 markings/sec, 235 secs
lola: 8666077 markings, 10125091 edges, 34364 markings/sec, 240 secs
lola: 8841191 markings, 10320612 edges, 35023 markings/sec, 245 secs
lola: 9019142 markings, 10520374 edges, 35590 markings/sec, 250 secs
lola: 9195184 markings, 10718421 edges, 35208 markings/sec, 255 secs
lola: 9371898 markings, 10916720 edges, 35343 markings/sec, 260 secs
lola: 9545051 markings, 11111071 edges, 34631 markings/sec, 265 secs
lola: 9721140 markings, 11309283 edges, 35218 markings/sec, 270 secs
lola: 9893343 markings, 11503004 edges, 34441 markings/sec, 275 secs
lola: 10068697 markings, 11700389 edges, 35071 markings/sec, 280 secs
lola: 10243904 markings, 11897356 edges, 35041 markings/sec, 285 secs
lola: 10419203 markings, 12094996 edges, 35060 markings/sec, 290 secs
lola: 10595522 markings, 12293196 edges, 35264 markings/sec, 295 secs
lola: 10772442 markings, 12492839 edges, 35384 markings/sec, 300 secs
lola: 10944915 markings, 12686775 edges, 34495 markings/sec, 305 secs
lola: 11118580 markings, 12881924 edges, 34733 markings/sec, 310 secs
lola: 11293281 markings, 13079685 edges, 34940 markings/sec, 315 secs
lola: 11469381 markings, 13277547 edges, 35220 markings/sec, 320 secs
lola: 11646211 markings, 13476405 edges, 35366 markings/sec, 325 secs
lola: 11823603 markings, 13676227 edges, 35478 markings/sec, 330 secs
lola: 12000908 markings, 13876262 edges, 35461 markings/sec, 335 secs
lola: 12177608 markings, 14076117 edges, 35340 markings/sec, 340 secs
lola: 12354694 markings, 14275502 edges, 35417 markings/sec, 345 secs
lola: 12531088 markings, 14473949 edges, 35279 markings/sec, 350 secs
lola: 12705967 markings, 14670794 edges, 34976 markings/sec, 355 secs
lola: 12881548 markings, 14867961 edges, 35116 markings/sec, 360 secs
lola: 13057068 markings, 15066253 edges, 35104 markings/sec, 365 secs
lola: 13234117 markings, 15265363 edges, 35410 markings/sec, 370 secs
lola: 13409133 markings, 15462947 edges, 35003 markings/sec, 375 secs
lola: 13580601 markings, 15656248 edges, 34294 markings/sec, 380 secs
lola: 13757333 markings, 15854922 edges, 35346 markings/sec, 385 secs
lola: 13932184 markings, 16051814 edges, 34970 markings/sec, 390 secs
lola: 14107734 markings, 16249870 edges, 35110 markings/sec, 395 secs
lola: 14283064 markings, 16447561 edges, 35066 markings/sec, 400 secs
lola: 14456668 markings, 16643088 edges, 34721 markings/sec, 405 secs
lola: 14632238 markings, 16841192 edges, 35114 markings/sec, 410 secs
lola: 14807163 markings, 17038419 edges, 34985 markings/sec, 415 secs
lola: 14982737 markings, 17236846 edges, 35115 markings/sec, 420 secs
lola: 15158801 markings, 17436051 edges, 35213 markings/sec, 425 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: 15232602 markings, 17519220 edges
lola: ========================================
lola: subprocess 9 will run for 3112 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p637) AND (1 <= p1319))))
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 <= p637) AND (1 <= p1319))))
lola: processed formula length: 38
lola: 69 rewrites
lola: closed formula file LTLFireability.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: 353 markings, 354 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no no no no no no no
lola:
preliminary result: yes no no no no no no no no no
lola: memory consumption: 55916 KB
lola: time consumption: 458 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.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="DLCround-PT-03b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 itslola"
echo " Input is DLCround-PT-03b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-ebro-158987900300458"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-03b.tgz
mv DLCround-PT-03b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;