fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r208-smll-162089471000078
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for RwMutex-PT-r0010w1000

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4646.207 3600000.00 371944.00 1497.30 FTFFFFFFFFTTFTFF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 136K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 103K 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.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 11:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 11:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 25 14:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 25 14:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 11 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1.8M May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1621034871546

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-14 23:27:54] [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]
[2021-05-14 23:27:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 23:27:55] [INFO ] Load time of PNML (sax parser for PT used): 559 ms
[2021-05-14 23:27:55] [INFO ] Transformed 2030 places.
[2021-05-14 23:27:55] [INFO ] Transformed 2020 transitions.
[2021-05-14 23:27:55] [INFO ] Found NUPN structural information;
[2021-05-14 23:27:55] [INFO ] Parsed PT model containing 2030 places and 2020 transitions in 699 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 72 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 8597 ms. (steps per millisecond=11 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 2020 rows 2030 cols
[2021-05-14 23:28:05] [INFO ] Computed 1020 place invariants in 770 ms
[2021-05-14 23:28:06] [INFO ] [Real]Absence check using 1020 positive place invariants in 151 ms returned unsat
[2021-05-14 23:28:07] [INFO ] [Real]Absence check using 1020 positive place invariants in 195 ms returned unsat
[2021-05-14 23:28:07] [INFO ] [Real]Absence check using 1020 positive place invariants in 198 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2021-05-14 23:28:08] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2021-05-14 23:28:09] [INFO ] Flatten gal took : 786 ms
FORMULA RwMutex-PT-r0010w1000-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w1000-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w1000-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w1000-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w1000-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w1000-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w1000-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 23:28:09] [INFO ] Applying decomposition
[2021-05-14 23:28:09] [INFO ] Flatten gal took : 278 ms
[2021-05-14 23:28:09] [INFO ] Decomposing Gal with order
[2021-05-14 23:28:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 23:28:16] [INFO ] Removed a total of 17998 redundant transitions.
[2021-05-14 23:28:16] [INFO ] Flatten gal took : 5836 ms
[2021-05-14 23:28:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 153 ms.
[2021-05-14 23:28:20] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 16 ms.
[2021-05-14 23:28:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 88 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ RwMutex-PT-r0010w1000 @ 3570 seconds

FORMULA RwMutex-PT-r0010w1000-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w1000-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w1000-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w1000-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w1000-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w1000-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w1000-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w1000-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w1000-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3251
rslt: Output for LTLFireability @ RwMutex-PT-r0010w1000

{
"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": "Fri May 14 23:28:21 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 361
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 4,
"aconj": 3,
"adisj": 1,
"aneg": 1,
"comp": 34,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 34,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "G (F ((X (X (G ((X (((1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p34) AND (1 <= p36) AND (1 <= p37) AND (1 <= p1564))) OR (G (((p27 <= 0) OR (p28 <= 0) OR (p29 <= 0) OR (p30 <= 0) OR (p31 <= 0) OR (p32 <= 0) OR (p33 <= 0) OR (p34 <= 0) OR (p36 <= 0) OR (p37 <= 0) OR (p1564 <= 0))) AND X (F (((1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p34) AND (1 <= p36) AND (1 <= p37) AND (1 <= p1564))))))))) OR ((p194 <= 0)))))",
"processed_size": 560,
"rewrites": 217
},
"result":
{
"edges": 12241,
"markings": 2025,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 12
},
"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": 406
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 406
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "((1 <= p1015))",
"processed_size": 14,
"rewrites": 217
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 464
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 1,
"X": 4,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((X (X (G (((1 <= p597))))) OR (((p661 <= 0)) OR (G (F (((1 <= p221)))) AND F ((X (X (G (((1 <= p597))))) OR ((p661 <= 0))))))) U ((1 <= p221)))",
"processed_size": 144,
"rewrites": 217
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"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": 541
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 541
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"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": "G (((p215 <= 0)))",
"processed_size": 17,
"rewrites": 217
},
"result":
{
"edges": 2010,
"markings": 1007,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"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": 650
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "X (X (G (((1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p34) AND (1 <= p36) AND (1 <= p37) AND (1 <= p1361)))))",
"processed_size": 176,
"rewrites": 217
},
"result":
{
"edges": 6,
"markings": 6,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 650
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "X (F (((1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p34) AND (1 <= p36) AND (1 <= p37) AND (1 <= p1565))))",
"processed_size": 172,
"rewrites": 217
},
"result":
{
"edges": 305,
"markings": 156,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 812
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 2,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 23,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 23,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "(X (F (((1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p34) AND (1 <= p36) AND (1 <= p37) AND (1 <= p1951)))) U (G (((1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p34) AND (1 <= p36) AND (1 <= p37) AND (1 <= p2023))) AND X (((1 <= p477)))))",
"processed_size": 369,
"rewrites": 217
},
"result":
{
"edges": 7,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 812
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 4,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F ((X (X (X (X (F (((p644 <= 0))))))) AND (((1 <= p182)) AND ((p644 <= 0)))))",
"processed_size": 77,
"rewrites": 217
},
"result":
{
"edges": 5686,
"markings": 3247,
"produced_by": "LTL model checker",
"value": false
},
"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": 1083
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 4,
"X": 3,
"aconj": 6,
"adisj": 0,
"aneg": 0,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "((F (((1 <= p409))) U (X (X (((1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p34) AND (1 <= p36) AND (1 <= p37) AND (1 <= p978)))) OR ((1 <= p1039)))) U (((1 <= p1039)) U (((1 <= p409)) U X (((1 <= p1039))))))",
"processed_size": 273,
"rewrites": 217
},
"result":
{
"edges": 1964,
"markings": 623,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 24
},
"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": 1625
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 12,
"adisj": 0,
"aneg": 0,
"comp": 22,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 11,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "F ((X (X (X (G (((1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p34) AND (1 <= p36) AND (1 <= p37) AND (1 <= p1875)))))) AND (((1 <= p27)) AND (((1 <= p28)) AND (((1 <= p29)) AND (((1 <= p30)) AND (((1 <= p31)) AND (((1 <= p32)) AND (((1 <= p33)) AND (((1 <= p34)) AND (((1 <= p36)) AND (((1 <= p37)) AND ((1 <= p1875))))))))))))))",
"processed_size": 395,
"rewrites": 217
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"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": 3251
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 12,
"aneg": 13,
"comp": 23,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 23,
"taut": 0,
"tconj": 11,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "G (F ((F ((F (((p731 <= 0))) OR ((1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p34) AND (1 <= p36) AND (1 <= p37) AND (1 <= p1156)))) AND (((1 <= p27)) AND (((1 <= p28)) AND (((1 <= p29)) AND (((1 <= p30)) AND (((1 <= p31)) AND (((1 <= p32)) AND (((1 <= p33)) AND (((1 <= p34)) AND (((1 <= p36)) AND (((1 <= p37)) AND ((1 <= p1156)))))))))))))))",
"processed_size": 410,
"rewrites": 217
},
"result":
{
"edges": 455,
"markings": 156,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 389920,
"runtime": 319.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F((X(X(G((X(**) OR (G(**) AND X(F(**))))))) OR *))) : (X(F(**)) OR **) : ((X(X(G(**))) OR (** OR (G(F(**)) AND F((X(X(G(**))) OR **))))) U **) : (X(X(G(*))) OR G(*)) : ((X(F(**)) U (G(*) AND X(**))) OR X(F(**))) : F((X(X(X(X(F(*))))) AND (** AND **))) : ((F(**) U (X(X(**)) OR **)) U (** U (** U X(**)))) : F((X(X(X(G(**)))) AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND **)))))))))))) : G(F((F((F(*) OR *)) AND (* AND (* AND (* AND (* AND (* AND (* AND (* AND (* AND (* AND (* AND *)))))))))))))"
},
"net":
{
"arcs": 24060,
"conflict_clusters": 1011,
"places": 2030,
"places_significant": 1010,
"singleton_clusters": 0,
"transitions": 2020
},
"result":
{
"preliminary_value": "yes no no no no no no no no ",
"value": "yes 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: 4050/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2030
lola: finding significant places
lola: 2030 places, 2020 transitions, 1010 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: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p1564 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p1564 <= 1)
lola: LP says that atomic proposition is always true: (p194 <= 1)
lola: LP says that atomic proposition is always true: (p876 <= 1)
lola: LP says that atomic proposition is always true: (p1015 <= 1)
lola: LP says that atomic proposition is always true: (p221 <= 1)
lola: LP says that atomic proposition is always true: (p221 <= 1)
lola: LP says that atomic proposition is always true: (p597 <= 1)
lola: LP says that atomic proposition is always true: (p661 <= 1)
lola: LP says that atomic proposition is always true: (p221 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p1361 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p1361 <= 1)
lola: LP says that atomic proposition is always true: (p215 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p1951 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p2023 <= 1)
lola: LP says that atomic proposition is always true: (p477 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p1565 <= 1)
lola: LP says that atomic proposition is always true: (p644 <= 1)
lola: LP says that atomic proposition is always true: (p182 <= 1)
lola: LP says that atomic proposition is always true: (p644 <= 1)
lola: LP says that atomic proposition is always true: (p409 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p978 <= 1)
lola: LP says that atomic proposition is always true: (p1039 <= 1)
lola: LP says that atomic proposition is always true: (p1039 <= 1)
lola: LP says that atomic proposition is always true: (p409 <= 1)
lola: LP says that atomic proposition is always true: (p1039 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p1875 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p1875 <= 1)
lola: LP says that atomic proposition is always true: (p731 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p1156 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p1156 <= 1)
lola: G (NOT(G ((F (X (NOT(X ((G (((p27 <= 0) OR (p28 <= 0) OR (p29 <= 0) OR (p30 <= 0) OR (p31 <= 0) OR (p32 <= 0) OR (p33 <= 0) OR (p34 <= 0) OR (p36 <= 0) OR (p37 <= 0) OR (p1564 <= 0))) U X (((1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p34) AND (1 <= p36) AND (1 <= p37) AND (1 <= p1564)))))))) AND ((1 <= p194)))))) : (NOT(G (((1 <= 0) U NOT(X (((1 <= p876))))))) OR ((1 <= p1015))) : ((G ((((1 <= p221)) U F (((1 <= p221))))) U (G (X (X (((1 <= p597))))) OR ((p661 <= 0)))) U ((1 <= p221))) : (NOT(X (NOT(X (NOT(F ((((1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p34) AND (1 <= p36) AND (1 <= p37) AND (1 <= p1361)) U ((p27 <= 0) OR (p28 <= 0) OR (p29 <= 0) OR (p30 <= 0) OR (p31 <= 0) OR (p32 <= 0) OR (p33 <= 0) OR (p34 <= 0) OR (p36 <= 0) OR (p37 <= 0) OR (p1361 <= 0))))))))) OR NOT(F (((1 <= p215))))) : ((F (X (((1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p34) AND (1 <= p36) AND (1 <= p37) AND (1 <= p1951)))) U (NOT(F (((p27 <= 0) OR (p28 <= 0) OR (p29 <= 0) OR (p30 <= 0) OR (p31 <= 0) OR (p32 <= 0) OR (p33 <= 0) OR (p34 <= 0) OR (p36 <= 0) OR (p37 <= 0) OR (p2023 <= 0)))) AND X (((1 <= p477))))) OR F (X (((1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p34) AND (1 <= p36) AND (1 <= p37) AND (1 <= p1565))))) : F (((X (NOT(X (G (X (X (((1 <= p644)))))))) AND ((1 <= p182))) AND ((p644 <= 0)))) : ((F (((1 <= p409))) U (X (X (((1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p34) AND (1 <= p36) AND (1 <= p37) AND (1 <= p978)))) OR ((1 <= p1039)))) U (((1 <= p1039)) U (((1 <= p409)) U X (((1 <= p1039)))))) : F ((((((((((((NOT(X (NOT(G (X (X (((1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p34) AND (1 <= p36) AND (1 <= p37) AND (1 <= p1875)))))))) AND ((1 <= p27))) AND ((1 <= p28))) AND ((1 <= p29))) AND ((1 <= p30))) AND ((1 <= p31))) AND ((1 <= p32))) AND ((1 <= p33))) AND ((1 <= p34))) AND ((1 <= p36))) AND ((1 <= p37))) AND ((1 <= p1875)))) : NOT(X (F (G ((((((((((((G ((G (((1 <= p731))) AND ((p27 <= 0) OR (p28 <= 0) OR (p29 <= 0) OR (p30 <= 0) OR (p31 <= 0) OR (p32 <= 0) OR (p33 <= 0) OR (p34 <= 0) OR (p36 <= 0) OR (p37 <= 0) OR (p1156 <= 0)))) OR ((p27 <= 0))) OR ((p28 <= 0))) OR ((p29 <= 0))) OR ((p30 <= 0))) OR ((p31 <= 0))) OR ((p32 <= 0))) OR ((p33 <= 0))) OR ((p34 <= 0))) OR ((p36 <= 0))) OR ((p37 <= 0))) OR ((p1156 <= 0)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:185
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:335
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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 361 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X (X (G ((X (((1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p34) AND (1 <= p36) AND (1 <= p37) AND (1 <= p1564))) OR (G (((p27 <= 0) OR (p28 <= 0) OR (p29 <= 0) OR (p30 <= 0) OR (p31 <= 0) OR (p32 <= 0) OR (p33 <= 0) OR (p34 <= 0) OR (p36 <= 0) OR (p37 <= 0) OR (p1564 <= 0))) AND X (F (((1 <= p27) AND (1 <= p28) AND ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (X (G ((X (((1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p34) AND (1 <= p36) AND (1 <= p37) AND (1 <= p1564))) OR (G (((p27 <= 0) OR (p28 <= 0) OR (p29 <= 0) OR (p30 <= 0) OR (p31 <= 0) OR (p32 <= 0) OR (p33 <= 0) OR (p34 <= 0) OR (p36 <= 0) OR (p37 <= 0) OR (p1564 <= 0))) AND X (F (((1 <= p27) AND (1 <= p28) AND ... (shortened)
lola: processed formula length: 560
lola: 217 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 12 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: 2025 markings, 12241 edges
lola: ========================================
lola: subprocess 1 will run for 406 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F (((1 <= p876)))) OR ((1 <= p1015)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 406 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p1015))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p1015))
lola: processed formula length: 14
lola: 217 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 464 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p876))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p876))))
lola: processed formula length: 21
lola: 217 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: 3 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 464 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (X (G (((1 <= p597))))) OR (((p661 <= 0)) OR (G (F (((1 <= p221)))) AND F ((X (X (G (((1 <= p597))))) OR ((p661 <= 0))))))) U ((1 <= p221)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((X (X (G (((1 <= p597))))) OR (((p661 <= 0)) OR (G (F (((1 <= p221)))) AND F ((X (X (G (((1 <= p597))))) OR ((p661 <= 0))))))) U ((1 <= p221)))
lola: processed formula length: 144
lola: 217 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 11 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: 2 markings, 2 edges
lola: ========================================
lola: subprocess 3 will run for 541 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (G (((1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p34) AND (1 <= p36) AND (1 <= p37) AND (1 <= p1361))))) OR G (((p215 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 541 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p215 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p215 <= 0)))
lola: processed formula length: 17
lola: 217 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: 1007 markings, 2010 edges
lola: ========================================
lola: subprocess 4 will run for 650 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p34) AND (1 <= p36) AND (1 <= p37) AND (1 <= p1361)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p34) AND (1 <= p36) AND (1 <= p37) AND (1 <= p1361)))))
lola: processed formula length: 176
lola: 217 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: 6 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 650 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (F (((1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p34) AND (1 <= p36) AND (1 <= p37) AND (1 <= p1951)))) U (G (((1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p34) AND (1 <= p36) AND (1 <= p37) AND (1 <= p2023))) AND X (((1 <= p477))))) OR X (F (((1 <= p27) AND (1 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 650 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p34) AND (1 <= p36) AND (1 <= p37) AND (1 <= p1565))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p34) AND (1 <= p36) AND (1 <= p37) AND (1 <= p1565))))
lola: processed formula length: 172
lola: 217 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: 156 markings, 305 edges
lola: ========================================
lola: subprocess 5 will run for 812 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F (((1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p34) AND (1 <= p36) AND (1 <= p37) AND (1 <= p1951)))) U (G (((1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p34) AND (1 <= p36) AND (1 <= p37) AND (1 <= p2023))) AND X (((1 <= p477)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (F (((1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p34) AND (1 <= p36) AND (1 <= p37) AND (1 <= p1951)))) U (G (((1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p34) AND (1 <= p36) AND (1 <= p37) AND (1 <= p2023))) AND X (((1 <= p477)))))
lola: processed formula length: 369
lola: 217 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 812 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (X (X (X (F (((p644 <= 0))))))) AND (((1 <= p182)) AND ((p644 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (X (X (X (F (((p644 <= 0))))))) AND (((1 <= p182)) AND ((p644 <= 0)))))
lola: processed formula length: 77
lola: 217 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: 3247 markings, 5686 edges
lola: ========================================
lola: subprocess 6 will run for 1083 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F (((1 <= p409))) U (X (X (((1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p34) AND (1 <= p36) AND (1 <= p37) AND (1 <= p978)))) OR ((1 <= p1039)))) U (((1 <= p1039)) U (((1 <= p409)) U X (((1 <= p1039))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((F (((1 <= p409))) U (X (X (((1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p34) AND (1 <= p36) AND (1 <= p37) AND (1 <= p978)))) OR ((1 <= p1039)))) U (((1 <= p1039)) U (((1 <= p409)) U X (((1 <= p1039))))))
lola: processed formula length: 273
lola: 217 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 24 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: 623 markings, 1964 edges
lola: ========================================
lola: subprocess 7 will run for 1625 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (X (X (G (((1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p34) AND (1 <= p36) AND (1 <= p37) AND (1 <= p1875)))))) AND (((1 <= p27)) AND (((1 <= p28)) AND (((1 <= p29)) AND (((1 <= p30)) AND (((1 <= p31)) AND (((1 <= p32)) AND (((1 <= p33)) AND (((1 <= p34)) AND (((1 <= p36)) AND (((1 <= p37)) AND ((1 <= p1875))))))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (X (X (G (((1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p34) AND (1 <= p36) AND (1 <= p37) AND (1 <= p1875)))))) AND (((1 <= p27)) AND (((1 <= p28)) AND (((1 <= p29)) AND (((1 <= p30)) AND (((1 <= p31)) AND (((1 <= p32)) AND (((1 <= p33)) AND (((1 <= p34)) AND (((1 <= p36)) AND (((1 <= p37)) AND ((1 <= p1875))))))))))))))
lola: processed formula length: 395
lola: 217 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 12 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 8 will run for 3251 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F ((F (((p731 <= 0))) OR ((1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p34) AND (1 <= p36) AND (1 <= p37) AND (1 <= p1156)))) AND (((1 <= p27)) AND (((1 <= p28)) AND (((1 <= p29)) AND (((1 <= p30)) AND (((1 <= p31)) AND (((1 <= p32)) AND (((1 <= p33)) AND (((1 <= p34)) AND (((1 <= p36)) AND (((1 <= p37)) AND ((1 <= p1156)))))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F ((F (((p731 <= 0))) OR ((1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p34) AND (1 <= p36) AND (1 <= p37) AND (1 <= p1156)))) AND (((1 <= p27)) AND (((1 <= p28)) AND (((1 <= p29)) AND (((1 <= p30)) AND (((1 <= p31)) AND (((1 <= p32)) AND (((1 <= p33)) AND (((1 <= p34)) AND (((1 <= p36)) AND (((1 <= p37)) AND ((1 <= p1156)))))... (shortened)
lola: processed formula length: 410
lola: 217 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: 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: 156 markings, 455 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no no no no no no
lola:
preliminary result: yes no no no no no no no no
lola: memory consumption: 389920 KB
lola: time consumption: 319 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="RwMutex-PT-r0010w1000"
export BK_EXAMINATION="LTLFireability"
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 RwMutex-PT-r0010w1000, 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 r208-smll-162089471000078"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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