About the Execution of ITS-LoLa for RwMutex-PT-r0020w0010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15728.940 | 3600000.00 | 22092.00 | 68.60 | FFFFFFTTFFFTFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2020-input.r186-oct2-158987938800298.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-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 itslola
Input is RwMutex-PT-r0020w0010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938800298
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 3.6K Apr 12 12:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 12 12:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 11 13:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 11 13:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 14 12:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 10 17:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 10 17:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 9 23:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 9 23:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 11 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 43K Mar 24 05:38 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-r0020w0010-00
FORMULA_NAME RwMutex-PT-r0020w0010-01
FORMULA_NAME RwMutex-PT-r0020w0010-02
FORMULA_NAME RwMutex-PT-r0020w0010-03
FORMULA_NAME RwMutex-PT-r0020w0010-04
FORMULA_NAME RwMutex-PT-r0020w0010-05
FORMULA_NAME RwMutex-PT-r0020w0010-06
FORMULA_NAME RwMutex-PT-r0020w0010-07
FORMULA_NAME RwMutex-PT-r0020w0010-08
FORMULA_NAME RwMutex-PT-r0020w0010-09
FORMULA_NAME RwMutex-PT-r0020w0010-10
FORMULA_NAME RwMutex-PT-r0020w0010-11
FORMULA_NAME RwMutex-PT-r0020w0010-12
FORMULA_NAME RwMutex-PT-r0020w0010-13
FORMULA_NAME RwMutex-PT-r0020w0010-14
FORMULA_NAME RwMutex-PT-r0020w0010-15
=== Now, execution of the tool begins
BK_START 1591233085289
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 01:11:26] [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 01:11:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 01:11:26] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2020-06-04 01:11:27] [INFO ] Transformed 80 places.
[2020-06-04 01:11:27] [INFO ] Transformed 60 transitions.
[2020-06-04 01:11:27] [INFO ] Parsed PT model containing 80 places and 60 transitions in 69 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 298 ms. (steps per millisecond=335 ) properties seen :[1, 0, 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, 0, 1, 1, 1]
// Phase 1: matrix 60 rows 80 cols
[2020-06-04 01:11:27] [INFO ] Computed 50 place invariants in 5 ms
[2020-06-04 01:11:27] [INFO ] [Real]Absence check using 50 positive place invariants in 25 ms returned sat
[2020-06-04 01:11:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 01:11:27] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2020-06-04 01:11:27] [INFO ] Computed and/alt/rep : 30/30/30 causal constraints in 5 ms.
[2020-06-04 01:11:27] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
[2020-06-04 01:11:27] [INFO ] [Real]Absence check using 50 positive place invariants in 17 ms returned sat
[2020-06-04 01:11:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 01:11:27] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2020-06-04 01:11:27] [INFO ] Computed and/alt/rep : 30/30/30 causal constraints in 3 ms.
[2020-06-04 01:11:27] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
[2020-06-04 01:11:27] [INFO ] [Real]Absence check using 50 positive place invariants in 18 ms returned sat
[2020-06-04 01:11:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 01:11:27] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2020-06-04 01:11:27] [INFO ] Computed and/alt/rep : 30/30/30 causal constraints in 2 ms.
[2020-06-04 01:11:27] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
[2020-06-04 01:11:27] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-04 01:11:27] [INFO ] Flatten gal took : 79 ms
FORMULA RwMutex-PT-r0020w0010-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0020w0010-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 01:11:27] [INFO ] Flatten gal took : 53 ms
[2020-06-04 01:11:28] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2020-06-04 01:11:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ RwMutex-PT-r0020w0010 @ 3570 seconds
FORMULA RwMutex-PT-r0020w0010-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0020w0010-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0020w0010-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0020w0010-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0020w0010-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0020w0010-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0020w0010-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0020w0010-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0020w0010-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0020w0010-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0020w0010-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0020w0010-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0020w0010-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0020w0010-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3555
rslt: Output for LTLFireability @ RwMutex-PT-r0020w0010
{
"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 01:11:28 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F ((F ((X (((1 <= p10) AND (1 <= p65))) OR ((1 <= p10) AND (1 <= p65)))) AND G (((1 <= p22) AND (1 <= p48))))))",
"processed_size": 114,
"rewrites": 49
},
"result":
{
"edges": 628792,
"markings": 134611,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 3,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 28,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 28,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 23,
"visible_transitions": 0
},
"processed": "X ((F (G (((1 <= p53) AND (1 <= p77)))) AND (G ((((1 <= p53) AND (1 <= p77)) OR X (G (((1 <= p53) AND (1 <= p77)))))) AND X (F (((1 <= p69) OR ((1 <= p23) AND (1 <= p47) AND (1 <= p48) AND (1 <= p49) AND (1 <= p50) AND (1 <= p51) AND (1 <= p52) AND (1 <= p53) AND (1 <= p54) AND (1 <= p56) AND (1 <= p57) AND (1 <= p58) AND (1 <= p59) AND (1 <= p60) AND (1 <= p61) AND (1 <= p62) AND (1 <= p63) AND (1 <= p64) AND (1 <= p65) AND (1 <= p67) AND (1 <= p68))))))))",
"processed_size": 462,
"rewrites": 49
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (((((1 <= p12) AND (1 <= p67)) U (X (G ((1 <= p46))) OR (1 <= p46))) OR G ((1 <= p46))))",
"processed_size": 90,
"rewrites": 49
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((((p35 <= 0) R ((p54 <= 0) OR (p79 <= 0))) OR ((1 <= p54) AND (1 <= p79))))",
"processed_size": 79,
"rewrites": 49
},
"result":
{
"edges": 30,
"markings": 31,
"produced_by": "LTL model checker",
"value": true
},
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 0,
"aneg": 1,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 4,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G ((F (((1 <= p11) AND (1 <= p47))) AND ((X (((1 <= p8) AND (1 <= p63))) AND (F (((p8 <= 0) OR (p63 <= 0))) AND ((1 <= p8) AND (1 <= p63)))) OR ((1 <= p11) AND (1 <= p47))))))",
"processed_size": 179,
"rewrites": 49
},
"result":
{
"edges": 364519,
"markings": 84177,
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 2,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 24,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 23,
"visible_transitions": 0
},
"processed": "X ((F (((1 <= p17) AND (1 <= p47) AND (1 <= p48) AND (1 <= p49) AND (1 <= p50) AND (1 <= p51) AND (1 <= p52) AND (1 <= p53) AND (1 <= p54) AND (1 <= p56) AND (1 <= p57) AND (1 <= p58) AND (1 <= p59) AND (1 <= p60) AND (1 <= p61) AND (1 <= p62) AND (1 <= p63) AND (1 <= p64) AND (1 <= p65) AND (1 <= p67) AND (1 <= p68))) U ((G ((1 <= p71)) OR (1 <= p28)) U (1 <= p28))))",
"processed_size": 370,
"rewrites": 49
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((1 <= p26)))",
"processed_size": 18,
"rewrites": 49
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 21,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 21,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 21,
"visible_transitions": 0
},
"processed": "F (G (((p15 <= 0) OR (p47 <= 0) OR (p48 <= 0) OR (p49 <= 0) OR (p50 <= 0) OR (p51 <= 0) OR (p52 <= 0) OR (p53 <= 0) OR (p54 <= 0) OR (p56 <= 0) OR (p57 <= 0) OR (p58 <= 0) OR (p59 <= 0) OR (p60 <= 0) OR (p61 <= 0) OR (p62 <= 0) OR (p63 <= 0) OR (p64 <= 0) OR (p65 <= 0) OR (p67 <= 0) OR (p68 <= 0))))",
"processed_size": 320,
"rewrites": 49
},
"result":
{
"edges": 20971503,
"markings": 1048577,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 592
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(F ((1 <= p35)) U (F ((1 <= p29)) OR (1 <= p73)))",
"processed_size": 49,
"rewrites": 49
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 711
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 3,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((1 <= p30) U G ((F (G (((p27 <= 0) AND (p30 <= 0)))) AND ((1 <= p4) AND ((1 <= p59) AND (p30 <= 0))))))",
"processed_size": 104,
"rewrites": 49
},
"result":
{
"edges": 16,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 889
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 42,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 42,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 22,
"visible_transitions": 0
},
"processed": "G ((((1 <= p20) AND (1 <= p47) AND (1 <= p48) AND (1 <= p49) AND (1 <= p50) AND (1 <= p51) AND (1 <= p52) AND (1 <= p53) AND (1 <= p54) AND (1 <= p56) AND (1 <= p57) AND (1 <= p58) AND (1 <= p59) AND (1 <= p60) AND (1 <= p61) AND (1 <= p62) AND (1 <= p63) AND (1 <= p64) AND (1 <= p65) AND (1 <= p67) AND (1 <= p68)) OR ((1 <= p14) AND (1 <= p47) AND (1 <= p48) AND (1 <= p49) AND (1 <= p50) AND (1 <= p51) AND (1 <= p52) AND (1 <= p53) AND (1 <= p54) AND (1 <= p56) AND (1 <= p57) AND (1 <= p58) AND (1 <= p59) AND (1 <= p60) AND (1 <= p61) AND (1 <= p62) AND (1 <= p63) AND (1 <= p64) AND (1 <= p65) AND (1 <= p67) AND (1 <= p68))))",
"processed_size": 635,
"rewrites": 49
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"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": 1185
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1185
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p7 <= 0) OR (p62 <= 0))",
"processed_size": 25,
"rewrites": 50
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1778
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p35 <= 0)",
"processed_size": 10,
"rewrites": 51
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1778
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1777
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p75 <= 0)",
"processed_size": 10,
"rewrites": 51
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 12,
"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": 3555
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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 ((p73 <= 0)) U (1 <= p75))",
"processed_size": 29,
"rewrites": 49
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3555
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3555
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((((p1 <= 0) OR (p56 <= 0)) AND ((p4 <= 0) OR (p59 <= 0))))",
"processed_size": 63,
"rewrites": 49
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((((p1 <= 0) OR (p56 <= 0)) AND ((p4 <= 0) OR (p59 <= 0))))",
"processed_size": 63,
"rewrites": 49
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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 (((p1 <= 0) OR (p56 <= 0))))",
"processed_size": 34,
"rewrites": 49
},
"result":
{
"edges": 4,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 45244,
"runtime": 15.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "((F(*) U **) OR (G(*) AND F(**))) : (F(G(*)) OR (G(*) AND F(G(*)))) : G(F((F((X(**) OR **)) AND G(**)))) : G(F(**)) : F(G(*)) : X((F(G(**)) AND (G((** OR X(G(**)))) AND X(F(**))))) : G(**) : (F(**) U (F(**) OR **)) : F(((** U (X(G(**)) OR **)) OR G(**))) : X(((* R *) OR **)) : (** U G((F(G(*)) AND (** AND (** AND **))))) : F(G((F(**) AND ((X(**) AND (F(*) AND (** AND **))) OR **)))) : X((F(**) U ((G(**) OR **) U **))) : (F(**) OR (** OR **))"
},
"net":
{
"arcs": 560,
"conflict_clusters": 31,
"places": 80,
"places_significant": 30,
"singleton_clusters": 0,
"transitions": 60
},
"result":
{
"preliminary_value": "no no no no no no no no no yes no no no no ",
"value": "no no no no no no no no no yes no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 140/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 80
lola: finding significant places
lola: 80 places, 60 transitions, 30 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: (NOT(F (((1 <= p52) AND (1 <= p66)))) U (NOT(G ((1 <= p73))) U (1 <= p75))) : (NOT(F ((((1 <= p1) AND (1 <= p56)) OR ((1 <= p4) AND (1 <= p59))))) U G (F (NOT(F (X (((1 <= p1) AND (1 <= p56)))))))) : G (F (X (F ((F ((X (((1 <= p10) AND (1 <= p65))) OR ((1 <= p10) AND (1 <= p65)))) AND G (((1 <= p22) AND (1 <= p48)))))))) : G (F (G (F ((1 <= p26))))) : F (NOT(F (((1 <= p15) AND (1 <= p47) AND (1 <= p48) AND (1 <= p49) AND (1 <= p50) AND (1 <= p51) AND (1 <= p52) AND (1 <= p53) AND (1 <= p54) AND (1 <= p56) AND (1 <= p57) AND (1 <= p58) AND (1 <= p59) AND (1 <= p60) AND (1 <= p61) AND (1 <= p62) AND (1 <= p63) AND (1 <= p64) AND (1 <= p65) AND (1 <= p67) AND (1 <= p68))))) : X ((G ((((1 <= p53) AND (1 <= p77)) U G (X (((1 <= p53) AND (1 <= p77)))))) AND F (X (((1 <= p69) OR ((1 <= p23) AND (1 <= p47) AND (1 <= p48) AND (1 <= p49) AND (1 <= p50) AND (1 <= p51) AND (1 <= p52) AND (1 <= p53) AND (1 <= p54) AND (1 <= p56) AND (1 <= p57) AND (1 <= p58) AND (1 <= p59) AND (1 <= p60) AND (1 <= p61) AND (1 <= p62) AND (1 <= p63) AND (1 <= p64) AND (1 <= p65) AND (1 <= p67) AND (1 <= p68))))))) : G ((((1 <= p20) AND (1 <= p47) AND (1 <= p48) AND (1 <= p49) AND (1 <= p50) AND (1 <= p51) AND (1 <= p52) AND (1 <= p53) AND (1 <= p54) AND (1 <= p56) AND (1 <= p57) AND (1 <= p58) AND (1 <= p59) AND (1 <= p60) AND (1 <= p61) AND (1 <= p62) AND (1 <= p63) AND (1 <= p64) AND (1 <= p65) AND (1 <= p67) AND (1 <= p68)) OR ((1 <= p14) AND (1 <= p47) AND (1 <= p48) AND (1 <= p49) AND (1 <= p50) AND (1 <= p51) AND (1 <= p52) AND (1 <= p53) AND (1 <= p54) AND (1 <= p56) AND (1 <= p57) AND (1 <= p58) AND (1 <= p59) AND (1 <= p60) AND (1 <= p61) AND (1 <= p62) AND (1 <= p63) AND (1 <= p64) AND (1 <= p65) AND (1 <= p67) AND (1 <= p68)))) : (F ((1 <= p35)) U (F ((1 <= p29)) OR (1 <= p73))) : F (((((1 <= p12) AND (1 <= p67)) U (X (G ((1 <= p46))) OR (1 <= p46))) OR G ((1 <= p46)))) : X ((NOT(((1 <= p35) U ((1 <= p54) AND (1 <= p79)))) OR ((1 <= p54) AND (1 <= p79)))) : ((1 <= p30) U G ((((F (NOT(F (((1 <= p27) OR (1 <= p30))))) AND (1 <= p4)) AND (1 <= p59)) AND (p30 <= 0)))) : G (F (G (((((X (((1 <= p8) AND (1 <= p63))) AND NOT(G (((1 <= p8) AND (1 <= p63))))) AND (1 <= p8)) AND (1 <= p63)) U ((1 <= p11) AND (1 <= p47)))))) : X ((F (((1 <= p17) AND (1 <= p47) AND (1 <= p48) AND (1 <= p49) AND (1 <= p50) AND (1 <= p51) AND (1 <= p52) AND (1 <= p53) AND (1 <= p54) AND (1 <= p56) AND (1 <= p57) AND (1 <= p58) AND (1 <= p59) AND (1 <= p60) AND (1 <= p61) AND (1 <= p62) AND (1 <= p63) AND (1 <= p64) AND (1 <= p65) AND (1 <= p67) AND (1 <= p68))) U ((G ((1 <= p71)) OR (1 <= p28)) U (1 <= p28)))) : ((F ((1 <= p35)) OR (p7 <= 0)) OR (p62 <= 0))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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:437
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F ((X (((1 <= p10) AND (1 <= p65))) OR ((1 <= p10) AND (1 <= p65)))) AND G (((1 <= p22) AND (1 <= p48))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F ((X (((1 <= p10) AND (1 <= p65))) OR ((1 <= p10) AND (1 <= p65)))) AND G (((1 <= p22) AND (1 <= p48))))))
lola: processed formula length: 114
lola: 49 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: 134611 markings, 628792 edges
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (G (((1 <= p53) AND (1 <= p77)))) AND (G ((((1 <= p53) AND (1 <= p77)) OR X (G (((1 <= p53) AND (1 <= p77)))))) AND X (F (((1 <= p69) OR ((1 <= p23) AND (1 <= p47) AND (1 <= p48) AND (1 <= p49) AND (1 <= p50) AND (1 <= p51) AND (1 <= p52) AND (1 <= p53) AND (1 <= p54) AND (1 <= p56) AND (1 <= p57) AND (1 <= p58) AND (1 <= p59) AND (1 <= p60) AND (1 <= p61) AND (1 <= p62) AND (1 <= p63) AND ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (G (((1 <= p53) AND (1 <= p77)))) AND (G ((((1 <= p53) AND (1 <= p77)) OR X (G (((1 <= p53) AND (1 <= p77)))))) AND X (F (((1 <= p69) OR ((1 <= p23) AND (1 <= p47) AND (1 <= p48) AND (1 <= p49) AND (1 <= p50) AND (1 <= p51) AND (1 <= p52) AND (1 <= p53) AND (1 <= p54) AND (1 <= p56) AND (1 <= p57) AND (1 <= p58) AND (1 <= p59) AND (1 <= p60) AND (1 <= p61) AND (1 <= p62) AND (1 <= p63) AND ... (shortened)
lola: processed formula length: 462
lola: 49 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((((1 <= p12) AND (1 <= p67)) U (X (G ((1 <= p46))) OR (1 <= p46))) OR G ((1 <= p46))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (((((1 <= p12) AND (1 <= p67)) U (X (G ((1 <= p46))) OR (1 <= p46))) OR G ((1 <= p46))))
lola: processed formula length: 90
lola: 49 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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p35 <= 0) R ((p54 <= 0) OR (p79 <= 0))) OR ((1 <= p54) AND (1 <= p79))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p35 <= 0) R ((p54 <= 0) OR (p79 <= 0))) OR ((1 <= p54) AND (1 <= p79))))
lola: processed formula length: 79
lola: 49 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 31 markings, 30 edges
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (((1 <= p11) AND (1 <= p47))) AND ((X (((1 <= p8) AND (1 <= p63))) AND (F (((p8 <= 0) OR (p63 <= 0))) AND ((1 <= p8) AND (1 <= p63)))) OR ((1 <= p11) AND (1 <= p47))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (((1 <= p11) AND (1 <= p47))) AND ((X (((1 <= p8) AND (1 <= p63))) AND (F (((p8 <= 0) OR (p63 <= 0))) AND ((1 <= p8) AND (1 <= p63)))) OR ((1 <= p11) AND (1 <= p47))))))
lola: processed formula length: 179
lola: 49 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: add low 32
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: 84177 markings, 364519 edges
lola: ========================================
lola: subprocess 5 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((1 <= p17) AND (1 <= p47) AND (1 <= p48) AND (1 <= p49) AND (1 <= p50) AND (1 <= p51) AND (1 <= p52) AND (1 <= p53) AND (1 <= p54) AND (1 <= p56) AND (1 <= p57) AND (1 <= p58) AND (1 <= p59) AND (1 <= p60) AND (1 <= p61) AND (1 <= p62) AND (1 <= p63) AND (1 <= p64) AND (1 <= p65) AND (1 <= p67) AND (1 <= p68))) U ((G ((1 <= p71)) OR (1 <= p28)) U (1 <= p28))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((1 <= p17) AND (1 <= p47) AND (1 <= p48) AND (1 <= p49) AND (1 <= p50) AND (1 <= p51) AND (1 <= p52) AND (1 <= p53) AND (1 <= p54) AND (1 <= p56) AND (1 <= p57) AND (1 <= p58) AND (1 <= p59) AND (1 <= p60) AND (1 <= p61) AND (1 <= p62) AND (1 <= p63) AND (1 <= p64) AND (1 <= p65) AND (1 <= p67) AND (1 <= p68))) U ((G ((1 <= p71)) OR (1 <= p28)) U (1 <= p28))))
lola: processed formula length: 370
lola: 49 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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((1 <= p26)))
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 <= p26)))
lola: processed formula length: 18
lola: 49 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: 3 markings, 3 edges
lola: ========================================
lola: subprocess 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p15 <= 0) OR (p47 <= 0) OR (p48 <= 0) OR (p49 <= 0) OR (p50 <= 0) OR (p51 <= 0) OR (p52 <= 0) OR (p53 <= 0) OR (p54 <= 0) OR (p56 <= 0) OR (p57 <= 0) OR (p58 <= 0) OR (p59 <= 0) OR (p60 <= 0) OR (p61 <= 0) OR (p62 <= 0) OR (p63 <= 0) OR (p64 <= 0) OR (p65 <= 0) OR (p67 <= 0) OR (p68 <= 0))))
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 (((p15 <= 0) OR (p47 <= 0) OR (p48 <= 0) OR (p49 <= 0) OR (p50 <= 0) OR (p51 <= 0) OR (p52 <= 0) OR (p53 <= 0) OR (p54 <= 0) OR (p56 <= 0) OR (p57 <= 0) OR (p58 <= 0) OR (p59 <= 0) OR (p60 <= 0) OR (p61 <= 0) OR (p62 <= 0) OR (p63 <= 0) OR (p64 <= 0) OR (p65 <= 0) OR (p67 <= 0) OR (p68 <= 0))))
lola: processed formula length: 320
lola: 49 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: 1048341 markings, 8971313 edges, 209668 markings/sec, 0 secs
lola: 1048574 markings, 18574493 edges, 47 markings/sec, 5 secs
lola: add low 57
lola: add low 55
lola: add low 44
lola: add low 33
lola: add low 32
lola: add low 31
lola: add low 59
lola: add low 30
lola: add low 58
lola: add low 32
lola: add low 31
lola: add low 29
lola: add low 59
lola: add low 58
lola: add low 57
lola: add low 32
lola: add low 31
lola: add low 59
lola: add low 28
lola: add low 58
lola: add low 55
lola: add low 32
lola: add low 31
lola: add low 59
lola: add low 30
lola: add low 58
lola: add low 32
lola: add low 31
lola: add low 29
lola: add low 59
lola: add low 58
lola: add low 32
lola: add low 57
lola: add low 31
lola: add low 27
lola: add low 59
lola: add low 55
lola: add low 44
lola: add low 32
lola: add low 58
lola: add low 30
lola: add low 59
lola: add low 31
lola: add low 32
lola: add low 29
lola: add low 59
lola: add low 58
lola: add low 57
lola: add low 32
lola: add low 31
lola: add low 59
lola: add low 22
lola: add low 58
lola: add low 55
lola: add low 33
lola: add low 32
lola: add low 31
lola: add low 59
lola: add low 30
lola: add low 58
lola: add low 32
lola: add low 31
lola: add low 29
lola: add low 59
lola: add low 58
lola: add low 57
lola: add low 32
lola: add low 31
lola: add low 59
lola: add low 28
lola: add low 58
lola: add low 55
lola: add low 32
lola: add low 31
lola: add low 59
lola: add low 30
lola: add low 58
lola: add low 32
lola: add low 31
lola: add low 29
lola: add low 59
lola: add low 58
lola: add low 32
lola: add low 57
lola: add low 31
lola: add low 27
lola: add low 59
lola: add low 58
lola: add low 55
lola: add low 32
lola: add low 44
lola: add low 31
lola: add low 59
lola: add low 30
lola: add low 58
lola: add low 32
lola: add low 31
lola: add low 29
lola: add low 59
lola: add low 58
lola: add low 32
lola: add low 57
lola: add low 31
lola: add low 12
lola: add low 59
lola: add low 58
lola: add low 55
lola: add low 33
lola: add low 32
lola: add low 31
lola: add low 59
lola: add low 30
lola: add low 58
lola: add low 32
lola: add low 31
lola: add low 29
lola: add low 59
lola: add low 58
lola: add low 57
lola: add low 32
lola: add low 31
lola: add low 59
lola: add low 28
lola: add low 58
lola: add low 55
lola: add low 32
lola: add low 31
lola: add low 59
lola: add low 30
lola: add low 58
lola: add low 32
lola: add low 31
lola: add low 29
lola: add low 59
lola: add low 58
lola: add low 32
lola: add low 57
lola: add low 31
lola: add low 27
lola: add low 59
lola: add low 58
lola: add low 55
lola: add low 32
lola: add low 44
lola: add low 31
lola: add low 59
lola: add low 30
lola: add low 58
lola: add low 32
lola: add low 31
lola: add low 29
lola: add low 59
lola: add low 58
lola: add low 32
lola: add low 57
lola: add low 28
lola: add low 45
lola: add low 30
lola: add low 59
lola: add low 55
lola: add low 32
lola: add low 31
lola: add low 59
lola: add low 57
lola: add low 32
lola: add low 26
lola: add low 58
lola: add low 30
lola: add low 59
lola: add low 31
lola: add low 32
lola: add low 29
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: 1048577 markings, 20971503 edges
lola: ========================================
lola: subprocess 8 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((1 <= p35)) U (F ((1 <= p29)) OR (1 <= p73)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((1 <= p35)) U (F ((1 <= p29)) OR (1 <= p73)))
lola: processed formula length: 49
lola: 49 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 9 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p30) U G ((F (G (((p27 <= 0) AND (p30 <= 0)))) AND ((1 <= p4) AND ((1 <= p59) AND (p30 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((1 <= p30) U G ((F (G (((p27 <= 0) AND (p30 <= 0)))) AND ((1 <= p4) AND ((1 <= p59) AND (p30 <= 0))))))
lola: processed formula length: 104
lola: 49 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 32
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: 11 markings, 16 edges
lola: ========================================
lola: subprocess 10 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((1 <= p20) AND (1 <= p47) AND (1 <= p48) AND (1 <= p49) AND (1 <= p50) AND (1 <= p51) AND (1 <= p52) AND (1 <= p53) AND (1 <= p54) AND (1 <= p56) AND (1 <= p57) AND (1 <= p58) AND (1 <= p59) AND (1 <= p60) AND (1 <= p61) AND (1 <= p62) AND (1 <= p63) AND (1 <= p64) AND (1 <= p65) AND (1 <= p67) AND (1 <= p68)) OR ((1 <= p14) AND (1 <= p47) AND (1 <= p48) AND (1 <= p49) AND (1 <= p50) AND (1 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((1 <= p20) AND (1 <= p47) AND (1 <= p48) AND (1 <= p49) AND (1 <= p50) AND (1 <= p51) AND (1 <= p52) AND (1 <= p53) AND (1 <= p54) AND (1 <= p56) AND (1 <= p57) AND (1 <= p58) AND (1 <= p59) AND (1 <= p60) AND (1 <= p61) AND (1 <= p62) AND (1 <= p63) AND (1 <= p64) AND (1 <= p65) AND (1 <= p67) AND (1 <= p68)) OR ((1 <= p14) AND (1 <= p47) AND (1 <= p48) AND (1 <= p49) AND (1 <= p50) AND (1 ... (shortened)
lola: processed formula length: 635
lola: 49 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 11 will run for 1185 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((1 <= p35)) OR ((p7 <= 0) OR (p62 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 1185 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p7 <= 0) OR (p62 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: ((p7 <= 0) OR (p62 <= 0))
lola: processed formula length: 25
lola: 50 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 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 12 will run for 1778 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p35))
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: (p35 <= 0)
lola: processed formula length: 10
lola: 51 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: 2 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 1778 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F ((p73 <= 0)) U (1 <= p75)) OR (G (((p52 <= 0) OR (p66 <= 0))) AND F ((1 <= p75))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 1777 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p75))
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: (p75 <= 0)
lola: processed formula length: 10
lola: 51 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: 2 markings, 2 edges
lola: ========================================
lola: subprocess 13 will run for 3555 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((p73 <= 0)) U (1 <= p75))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((p73 <= 0)) U (1 <= p75))
lola: processed formula length: 29
lola: 49 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: 2 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 3555 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G (((p1 <= 0) OR (p56 <= 0)))) OR (G ((((p1 <= 0) OR (p56 <= 0)) AND ((p4 <= 0) OR (p59 <= 0)))) AND F (G (((p1 <= 0) OR (p56 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 3555 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p1 <= 0) OR (p56 <= 0)) AND ((p4 <= 0) OR (p59 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p1 <= 0) OR (p56 <= 0)) AND ((p4 <= 0) OR (p59 <= 0))))
lola: processed formula length: 63
lola: 49 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: 4 markings, 4 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (F (G (((p1 <= 0) OR (p56 <= 0)))) OR (G ((((p1 <= 0) OR (p56 <= 0)) AND ((p4 <= 0) OR (p59 <= 0)))) AND F (G (((p1 <= 0) OR (p56 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G ((((p1 <= 0) OR (p56 <= 0)) AND ((p4 <= 0) OR (p59 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p1 <= 0) OR (p56 <= 0)) AND ((p4 <= 0) OR (p59 <= 0))))
lola: processed formula length: 63
lola: 49 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: 4 markings, 4 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G (((p1 <= 0) OR (p56 <= 0))))
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 (((p1 <= 0) OR (p56 <= 0))))
lola: processed formula length: 34
lola: 49 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: add low 32
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, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no no yes no no no no
lola:
preliminary result: no no no no no no no no no yes no no no no
lola: memory consumption: 45244 KB
lola: time consumption: 15 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-r0020w0010"
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 RwMutex-PT-r0020w0010, 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 r186-oct2-158987938800298"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RwMutex-PT-r0020w0010.tgz
mv RwMutex-PT-r0020w0010 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 '
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 ;