About the Execution of ITS-LoLa for DES-PT-01a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15741.680 | 3600000.00 | 1376994.00 | 580.50 | TFFFFFFFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r180-ebro-158987899800194.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is DES-PT-01a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987899800194
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.4K Mar 30 01:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 30 01:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 16:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 8 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Mar 27 08:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Mar 27 08:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 26 08:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 26 08:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 32K Mar 24 05:37 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-01a-00
FORMULA_NAME DES-PT-01a-01
FORMULA_NAME DES-PT-01a-02
FORMULA_NAME DES-PT-01a-03
FORMULA_NAME DES-PT-01a-04
FORMULA_NAME DES-PT-01a-05
FORMULA_NAME DES-PT-01a-06
FORMULA_NAME DES-PT-01a-07
FORMULA_NAME DES-PT-01a-08
FORMULA_NAME DES-PT-01a-09
FORMULA_NAME DES-PT-01a-10
FORMULA_NAME DES-PT-01a-11
FORMULA_NAME DES-PT-01a-12
FORMULA_NAME DES-PT-01a-13
FORMULA_NAME DES-PT-01a-14
FORMULA_NAME DES-PT-01a-15
=== Now, execution of the tool begins
BK_START 1591166558473
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 06:42:41] [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-03 06:42:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 06:42:41] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2020-06-03 06:42:41] [INFO ] Transformed 119 places.
[2020-06-03 06:42:41] [INFO ] Transformed 76 transitions.
[2020-06-03 06:42:41] [INFO ] Found NUPN structural information;
[2020-06-03 06:42:41] [INFO ] Parsed PT model containing 119 places and 76 transitions in 167 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 43 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 3965 resets, run finished after 429 ms. (steps per millisecond=233 ) properties seen :[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, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1]
// Phase 1: matrix 62 rows 119 cols
[2020-06-03 06:42:42] [INFO ] Computed 59 place invariants in 20 ms
[2020-06-03 06:42:42] [INFO ] [Real]Absence check using 33 positive place invariants in 45 ms returned sat
[2020-06-03 06:42:42] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 18 ms returned sat
[2020-06-03 06:42:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:42:42] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2020-06-03 06:42:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 06:42:42] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2020-06-03 06:42:42] [INFO ] Computed and/alt/rep : 61/202/61 causal constraints in 14 ms.
[2020-06-03 06:42:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:42:42] [INFO ] [Nat]Absence check using 33 positive place invariants in 34 ms returned sat
[2020-06-03 06:42:42] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 13 ms returned sat
[2020-06-03 06:42:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:42:42] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2020-06-03 06:42:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2020-06-03 06:42:42] [INFO ] Computed and/alt/rep : 61/202/61 causal constraints in 11 ms.
[2020-06-03 06:42:43] [INFO ] Added : 55 causal constraints over 12 iterations in 256 ms. Result :sat
[2020-06-03 06:42:43] [INFO ] [Real]Absence check using 33 positive place invariants in 14 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-03 06:42:43] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-03 06:42:43] [INFO ] Flatten gal took : 82 ms
FORMULA DES-PT-01a-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01a-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01a-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01a-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 06:42:43] [INFO ] Applying decomposition
[2020-06-03 06:42:43] [INFO ] Flatten gal took : 27 ms
[2020-06-03 06:42:43] [INFO ] Decomposing Gal with order
[2020-06-03 06:42:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-03 06:42:43] [INFO ] Removed a total of 20 redundant transitions.
[2020-06-03 06:42:43] [INFO ] Flatten gal took : 80 ms
[2020-06-03 06:42:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 16 ms.
[2020-06-03 06:42:43] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 10 ms.
[2020-06-03 06:42:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ DES-PT-01a @ 3570 seconds
FORMULA DES-PT-01a-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-01a-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-01a-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-01a-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-01a-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-01a-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-01a-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-01a-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-01a-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-01a-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-01a-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-01a-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2220
rslt: Output for LTLFireability @ DES-PT-01a
{
"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": "Wed Jun 3 06:42:44 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((1 <= p100) AND (1 <= p115))",
"processed_size": 29,
"rewrites": 76
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 326
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (F ((G (((1 <= p15) AND (1 <= p109))) OR ((1 <= p18) AND (1 <= p92)))))",
"processed_size": 73,
"rewrites": 74
},
"result":
{
"edges": 27,
"markings": 27,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 326
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 2,
"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": 2,
"visible_transitions": 0
},
"processed": "X ((F (G (((p38 <= 0) OR (p110 <= 0)))) AND G ((((1 <= p38) AND (1 <= p110)) OR X (G (((p38 <= 0) OR (p110 <= 0))))))))",
"processed_size": 121,
"rewrites": 74
},
"result":
{
"edges": 27,
"markings": 27,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 363
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 363
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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 (((p54 <= 0) OR (p71 <= 0) OR (p17 <= 0) OR (p24 <= 0)))",
"processed_size": 61,
"rewrites": 74
},
"result":
{
"edges": 2546404,
"markings": 364486,
"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": 407
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F (((1 <= p17) AND (1 <= p24))))",
"processed_size": 35,
"rewrites": 74
},
"result":
{
"edges": 27,
"markings": 27,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 407
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X ((F (((1 <= p41) AND (1 <= p43) AND (1 <= p100))) AND ((p41 <= 0) OR (p43 <= 0) OR (p100 <= 0)))))",
"processed_size": 105,
"rewrites": 74
},
"result":
{
"edges": 28,
"markings": 28,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 466
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 2,
"aneg": 2,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G ((((p10 <= 0) OR (p32 <= 0)) OR (X (((p10 <= 0) OR (p32 <= 0))) AND (G (((p0 <= 0))) AND ((p106 <= 0) OR (p108 <= 0))))))",
"processed_size": 126,
"rewrites": 74
},
"result":
{
"edges": 27,
"markings": 27,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 543
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F (((1 <= p60) AND (1 <= p76))))",
"processed_size": 35,
"rewrites": 74
},
"result":
{
"edges": 26,
"markings": 26,
"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": 652
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 0,
"aneg": 1,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 3,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "F ((G (((p5 <= 0) OR (p7 <= 0) OR (p11 <= 0) OR (p12 <= 0) OR (p14 <= 0) OR (p16 <= 0))) AND (((1 <= p26)) AND (((1 <= p31)) AND ((1 <= p33))))))",
"processed_size": 150,
"rewrites": 74
},
"result":
{
"edges": 110,
"markings": 66,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 815
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 815
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (((p26 <= 0) OR (p31 <= 0) OR (p33 <= 0)))",
"processed_size": 46,
"rewrites": 74
},
"result":
{
"edges": 424,
"markings": 235,
"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": 1087
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p26 <= 0) OR (p31 <= 0) OR (p33 <= 0))",
"processed_size": 42,
"rewrites": 76
},
"result":
{
"edges": 25,
"markings": 26,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1087
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1087
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((1 <= p96)) AND ((p101 <= 1) AND (1 <= p101)))",
"processed_size": 48,
"rewrites": 75
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1631
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (((p26 <= 0) OR (p31 <= 0) OR (p33 <= 0)))",
"processed_size": 46,
"rewrites": 74
},
"result":
{
"edges": 424,
"markings": 235,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1631
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1631
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p26) AND (1 <= p31) AND (1 <= p33))",
"processed_size": 42,
"rewrites": 76
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3262
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F (((1 <= p113) AND (1 <= p117))))",
"processed_size": 37,
"rewrites": 74
},
"result":
{
"edges": 897,
"markings": 603,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3262
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3262
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p15) AND (1 <= p109))",
"processed_size": 28,
"rewrites": 74
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 5,
"aneg": 1,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 4,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G ((X (G ((((p56 <= 0) OR (p73 <= 0)) AND ((p74 <= 0) OR (p90 <= 0))))) OR (((p56 <= 0)) OR (((p73 <= 0)) OR (((p74 <= 0)) OR ((p90 <= 0))))))))",
"processed_size": 149,
"rewrites": 74
},
"result":
{
"edges": 616736282,
"markings": 45086785,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p15) AND (1 <= p109))",
"processed_size": 28,
"rewrites": 74
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 2,
"aneg": 3,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G (F ((((((1 <= p46) AND (1 <= p63)) OR ((1 <= p50) AND (1 <= p67))) R ((p50 <= 0) OR (p67 <= 0))) AND G (((p15 <= 0) OR (p109 <= 0))))))",
"processed_size": 140,
"rewrites": 74
},
"result":
{
"edges": 19025,
"markings": 3610,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 44304,
"runtime": 1350.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G((X(G(*)) OR (** OR (** OR (** OR **)))))) : (G(F(((* R *) AND G(*)))) OR **) : G(F(**)) : (F(**) AND X(F((G(**) OR *)))) : X((F(G(**)) AND G((** OR X(G(**)))))) : (G(*) OR (G(**) AND (** AND **))) : (X(F(**)) OR (G(*) AND X(F(**)))) : X(X((F(**) AND *))) : G((** OR (X(*) AND (G(*) AND **)))) : F((G(*) AND (** AND (** AND **)))) : (G(F(**)) AND F(*)) : (F(**) OR G(*))"
},
"net":
{
"arcs": 317,
"conflict_clusters": 46,
"places": 119,
"places_significant": 60,
"singleton_clusters": 0,
"transitions": 62
},
"result":
{
"preliminary_value": "no no no no no no no no no no no no ",
"value": "no no no no no no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 181/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 119
lola: finding significant places
lola: 119 places, 62 transitions, 60 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: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p117 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: F (X (G (X (G (((((NOT(F (X ((((1 <= p56) AND (1 <= p73)) OR ((1 <= p74) AND (1 <= p90)))))) OR ((p56 <= 0))) OR ((p73 <= 0))) OR ((p74 <= 0))) OR ((p90 <= 0)))))))) : (G (F (NOT(G ((((((p46 <= 0) OR (p63 <= 0)) AND ((p50 <= 0) OR (p67 <= 0))) U ((1 <= p50) AND (1 <= p67))) OR F (((1 <= p15) AND (1 <= p109)))))))) OR ((1 <= p15) AND (1 <= p109))) : G (F (((1 <= p60) AND (1 <= p76)))) : (F (((p100 <= 0) OR (p115 <= 0))) AND NOT(G (X (G ((NOT(G (((1 <= p15) AND (1 <= p109)))) AND ((p18 <= 0) OR (p92 <= 0)))))))) : G (X ((((1 <= p38) AND (1 <= p110)) U G (X (((p38 <= 0) OR (p110 <= 0))))))) : (NOT(F (((1 <= p26) AND (1 <= p31) AND (1 <= p33)))) OR ((G (((1 <= p26) AND (1 <= p31) AND (1 <= p33))) AND ((1 <= p96))) AND ((p101 <= 1) AND (1 <= p101)))) : (NOT(F (((1 <= p54) AND (1 <= p71) AND (1 <= p17) AND (1 <= p24)))) U F (X (F (((1 <= p17) AND (1 <= p24)))))) : X ((X (F (((1 <= p41) AND (1 <= p43) AND (1 <= p100)))) AND NOT(X (((1 <= p41) AND (1 <= p43) AND (1 <= p100)))))) : G ((((p10 <= 0) OR (p32 <= 0)) OR ((NOT(X (((1 <= p10) AND (1 <= p32)))) AND NOT(F (((1 <= p0))))) AND ((p106 <= 0) OR (p108 <= 0))))) : F ((((NOT(F (((1 <= p5) AND (1 <= p7) AND (1 <= p11) AND (1 <= p12) AND (1 <= p14) AND (1 <= p16)))) AND ((1 <= p26))) AND ((1 <= p31))) AND ((1 <= p33)))) : (NOT(G (F (NOT(F (((1 <= p113) AND (1 <= p117))))))) AND NOT(G (((1 <= p26) AND (1 <= p31) AND (1 <= p33))))) : (F ((((1 <= p26) AND (1 <= p31) AND (1 <= p33)) U ((1 <= p26) AND (1 <= p31) AND (1 <= p33)))) OR NOT(F (((1 <= p26) AND (1 <= p31) AND (1 <= p33)))))
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: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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:347
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k: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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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: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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (G ((((p56 <= 0) OR (p73 <= 0)) AND ((p74 <= 0) OR (p90 <= 0))))) OR (((p56 <= 0)) OR (((p73 <= 0)) OR (((p74 <= 0)) OR ((p90 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (G ((((p56 <= 0) OR (p73 <= 0)) AND ((p74 <= 0) OR (p90 <= 0))))) OR (((p56 <= 0)) OR (((p73 <= 0)) OR (((p74 <= 0)) OR ((p90 <= 0))))))))
lola: processed formula length: 149
lola: 74 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: 297682 markings, 3274945 edges, 59536 markings/sec, 0 secs
lola: 549612 markings, 6528133 edges, 50386 markings/sec, 5 secs
lola: 802858 markings, 9808320 edges, 50649 markings/sec, 10 secs
lola: 1071281 markings, 12952036 edges, 53685 markings/sec, 15 secs
lola: 1343018 markings, 16051895 edges, 54347 markings/sec, 20 secs
lola: 1605294 markings, 19080010 edges, 52455 markings/sec, 25 secs
lola: 1859187 markings, 22345155 edges, 50779 markings/sec, 30 secs
lola: 2139704 markings, 25535073 edges, 56103 markings/sec, 35 secs
lola: 2413306 markings, 28661046 edges, 54720 markings/sec, 40 secs
lola: 2648844 markings, 31738219 edges, 47108 markings/sec, 45 secs
lola: 2897317 markings, 34804222 edges, 49695 markings/sec, 50 secs
lola: 3132807 markings, 37707075 edges, 47098 markings/sec, 55 secs
lola: 3375205 markings, 40735426 edges, 48480 markings/sec, 60 secs
lola: 3612904 markings, 43757737 edges, 47540 markings/sec, 65 secs
lola: 3860616 markings, 46894763 edges, 49542 markings/sec, 70 secs
lola: 4102797 markings, 50098168 edges, 48436 markings/sec, 75 secs
lola: 4315575 markings, 53185855 edges, 42556 markings/sec, 80 secs
lola: 4535520 markings, 56271333 edges, 43989 markings/sec, 85 secs
lola: 4745510 markings, 59317290 edges, 41998 markings/sec, 90 secs
lola: 4985806 markings, 62243943 edges, 48059 markings/sec, 95 secs
lola: 5204032 markings, 65148441 edges, 43645 markings/sec, 100 secs
lola: 5428409 markings, 68114091 edges, 44875 markings/sec, 105 secs
lola: 5643969 markings, 71267775 edges, 43112 markings/sec, 110 secs
lola: 5884914 markings, 74334515 edges, 48189 markings/sec, 115 secs
lola: 6114957 markings, 77348778 edges, 46009 markings/sec, 120 secs
lola: 6332075 markings, 80348199 edges, 43424 markings/sec, 125 secs
lola: 6533202 markings, 83287130 edges, 40225 markings/sec, 130 secs
lola: 6751609 markings, 86221915 edges, 43681 markings/sec, 135 secs
lola: 6949760 markings, 89034314 edges, 39630 markings/sec, 140 secs
lola: 7159891 markings, 91994621 edges, 42026 markings/sec, 145 secs
lola: 7367276 markings, 94935589 edges, 41477 markings/sec, 150 secs
lola: 7571065 markings, 97917964 edges, 40758 markings/sec, 155 secs
lola: 7834943 markings, 101103122 edges, 52776 markings/sec, 160 secs
lola: 8067297 markings, 104277125 edges, 46471 markings/sec, 165 secs
lola: 8310827 markings, 107387118 edges, 48706 markings/sec, 170 secs
lola: 8531696 markings, 110481430 edges, 44174 markings/sec, 175 secs
lola: 8768246 markings, 113568355 edges, 47310 markings/sec, 180 secs
lola: 9019998 markings, 116639204 edges, 50350 markings/sec, 185 secs
lola: 9257788 markings, 119542741 edges, 47558 markings/sec, 190 secs
lola: 9480258 markings, 122419728 edges, 44494 markings/sec, 195 secs
lola: 9717246 markings, 125359248 edges, 47398 markings/sec, 200 secs
lola: 9939432 markings, 128464912 edges, 44437 markings/sec, 205 secs
lola: 10185917 markings, 131544403 edges, 49297 markings/sec, 210 secs
lola: 10424334 markings, 134579065 edges, 47683 markings/sec, 215 secs
lola: 10672423 markings, 137626143 edges, 49618 markings/sec, 220 secs
lola: 10899958 markings, 140718560 edges, 45507 markings/sec, 225 secs
lola: 11112227 markings, 143706403 edges, 42454 markings/sec, 230 secs
lola: 11312070 markings, 146761174 edges, 39969 markings/sec, 235 secs
lola: 11521879 markings, 149731825 edges, 41962 markings/sec, 240 secs
lola: 11736345 markings, 152793605 edges, 42893 markings/sec, 245 secs
lola: 11965296 markings, 155650430 edges, 45790 markings/sec, 250 secs
lola: 12162858 markings, 158508957 edges, 39512 markings/sec, 255 secs
lola: 12367085 markings, 161380200 edges, 40845 markings/sec, 260 secs
lola: 12571646 markings, 164371285 edges, 40912 markings/sec, 265 secs
lola: 12790582 markings, 167354813 edges, 43787 markings/sec, 270 secs
lola: 13004364 markings, 170366050 edges, 42756 markings/sec, 275 secs
lola: 13213383 markings, 173364014 edges, 41804 markings/sec, 280 secs
lola: 13419469 markings, 176374346 edges, 41217 markings/sec, 285 secs
lola: 13632859 markings, 179421868 edges, 42678 markings/sec, 290 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 2017360 KB
lola: time consumption: 303 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((p100 <= 0) OR (p115 <= 0))) AND X (F ((G (((1 <= p15) AND (1 <= p109))) OR ((1 <= p18) AND (1 <= p92))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((p100 <= 0) OR (p115 <= 0)))
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: ((1 <= p100) AND (1 <= p115))
lola: processed formula length: 29
lola: 76 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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 326 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G (((1 <= p15) AND (1 <= p109))) OR ((1 <= p18) AND (1 <= p92)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G (((1 <= p15) AND (1 <= p109))) OR ((1 <= p18) AND (1 <= p92)))))
lola: processed formula length: 73
lola: 74 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 27 markings, 27 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 326 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (G (((p38 <= 0) OR (p110 <= 0)))) AND G ((((1 <= p38) AND (1 <= p110)) OR X (G (((p38 <= 0) OR (p110 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (G (((p38 <= 0) OR (p110 <= 0)))) AND G ((((1 <= p38) AND (1 <= p110)) OR X (G (((p38 <= 0) OR (p110 <= 0))))))))
lola: processed formula length: 121
lola: 74 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: 27 markings, 27 edges
lola: ========================================
lola: subprocess 3 will run for 363 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F (((1 <= p17) AND (1 <= p24)))) OR (G (((p54 <= 0) OR (p71 <= 0) OR (p17 <= 0) OR (p24 <= 0))) AND X (F (((1 <= p17) AND (1 <= p24))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 363 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p54 <= 0) OR (p71 <= 0) OR (p17 <= 0) OR (p24 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p54 <= 0) OR (p71 <= 0) OR (p17 <= 0) OR (p24 <= 0)))
lola: processed formula length: 61
lola: 74 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: 364486 markings, 2546404 edges
lola: ========================================
lola: subprocess 4 will run for 407 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p17) AND (1 <= p24))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p17) AND (1 <= p24))))
lola: processed formula length: 35
lola: 74 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: 27 markings, 27 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 4 will run for 407 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((F (((1 <= p41) AND (1 <= p43) AND (1 <= p100))) AND ((p41 <= 0) OR (p43 <= 0) OR (p100 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((F (((1 <= p41) AND (1 <= p43) AND (1 <= p100))) AND ((p41 <= 0) OR (p43 <= 0) OR (p100 <= 0)))))
lola: processed formula length: 105
lola: 74 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: 28 markings, 28 edges
lola: ========================================
lola: subprocess 5 will run for 466 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p10 <= 0) OR (p32 <= 0)) OR (X (((p10 <= 0) OR (p32 <= 0))) AND (G (((p0 <= 0))) AND ((p106 <= 0) OR (p108 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p10 <= 0) OR (p32 <= 0)) OR (X (((p10 <= 0) OR (p32 <= 0))) AND (G (((p0 <= 0))) AND ((p106 <= 0) OR (p108 <= 0))))))
lola: processed formula length: 126
lola: 74 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: 27 markings, 27 edges
lola: ========================================
lola: subprocess 6 will run for 543 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p60) AND (1 <= p76))))
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 <= p60) AND (1 <= p76))))
lola: processed formula length: 35
lola: 74 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: 26 markings, 26 edges
lola: ========================================
lola: subprocess 7 will run for 652 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (((p5 <= 0) OR (p7 <= 0) OR (p11 <= 0) OR (p12 <= 0) OR (p14 <= 0) OR (p16 <= 0))) AND (((1 <= p26)) AND (((1 <= p31)) AND ((1 <= p33))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (((p5 <= 0) OR (p7 <= 0) OR (p11 <= 0) OR (p12 <= 0) OR (p14 <= 0) OR (p16 <= 0))) AND (((1 <= p26)) AND (((1 <= p31)) AND ((1 <= p33))))))
lola: processed formula length: 150
lola: 74 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: 66 markings, 110 edges
lola: ========================================
lola: subprocess 8 will run for 815 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p26) AND (1 <= p31) AND (1 <= p33))) OR G (((p26 <= 0) OR (p31 <= 0) OR (p33 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 815 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p26 <= 0) OR (p31 <= 0) OR (p33 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p26 <= 0) OR (p31 <= 0) OR (p33 <= 0)))
lola: processed formula length: 46
lola: 74 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: 235 markings, 424 edges
lola: ========================================
lola: subprocess 9 will run for 1087 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p26) AND (1 <= p31) AND (1 <= p33)))
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: ((p26 <= 0) OR (p31 <= 0) OR (p33 <= 0))
lola: processed formula length: 42
lola: 76 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: 26 markings, 25 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 1087 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((p26 <= 0) OR (p31 <= 0) OR (p33 <= 0))) OR (G (((1 <= p26) AND (1 <= p31) AND (1 <= p33))) AND (((1 <= p96)) AND ((p101 <= 1) AND (1 <= p101)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 1087 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p96)) AND ((p101 <= 1) AND (1 <= p101)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: (((1 <= p96)) AND ((p101 <= 1) AND (1 <= p101)))
lola: processed formula length: 48
lola: 75 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 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 10 will run for 1631 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p26 <= 0) OR (p31 <= 0) OR (p33 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p26 <= 0) OR (p31 <= 0) OR (p33 <= 0)))
lola: processed formula length: 46
lola: 74 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: 235 markings, 424 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 1631 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F (((1 <= p113) AND (1 <= p117)))) AND F (((p26 <= 0) OR (p31 <= 0) OR (p33 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1631 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((p26 <= 0) OR (p31 <= 0) OR (p33 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((1 <= p26) AND (1 <= p31) AND (1 <= p33))
lola: processed formula length: 42
lola: 76 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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 3262 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p113) AND (1 <= p117))))
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 <= p113) AND (1 <= p117))))
lola: processed formula length: 37
lola: 74 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: 603 markings, 897 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 3262 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((((((1 <= p46) AND (1 <= p63)) OR ((1 <= p50) AND (1 <= p67))) R ((p50 <= 0) OR (p67 <= 0))) AND G (((p15 <= 0) OR (p109 <= 0)))))) OR ((1 <= p15) AND (1 <= p109)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3262 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p15) AND (1 <= p109))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p15) AND (1 <= p109))
lola: processed formula length: 28
lola: 74 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: 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 ((X (G ((((p56 <= 0) OR (p73 <= 0)) AND ((p74 <= 0) OR (p90 <= 0))))) OR (((p56 <= 0)) OR (((p73 <= 0)) OR (((p74 <= 0)) OR ((p90 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (G ((((p56 <= 0) OR (p73 <= 0)) AND ((p74 <= 0) OR (p90 <= 0))))) OR (((p56 <= 0)) OR (((p73 <= 0)) OR (((p74 <= 0)) OR ((p90 <= 0))))))))
lola: processed formula length: 149
lola: 74 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: 300256 markings, 3310934 edges, 60051 markings/sec, 0 secs
lola: 559087 markings, 6620318 edges, 51766 markings/sec, 5 secs
lola: 808824 markings, 9909169 edges, 49947 markings/sec, 10 secs
lola: 1081885 markings, 13059069 edges, 54612 markings/sec, 15 secs
lola: 1353579 markings, 16159111 edges, 54339 markings/sec, 20 secs
lola: 1617393 markings, 19213126 edges, 52763 markings/sec, 25 secs
lola: 1869784 markings, 22482558 edges, 50478 markings/sec, 30 secs
lola: 2148931 markings, 25669038 edges, 55829 markings/sec, 35 secs
lola: 2421079 markings, 28760145 edges, 54430 markings/sec, 40 secs
lola: 2654977 markings, 31828786 edges, 46780 markings/sec, 45 secs
lola: 2901422 markings, 34862281 edges, 49289 markings/sec, 50 secs
lola: 3138411 markings, 37755793 edges, 47398 markings/sec, 55 secs
lola: 3377824 markings, 40787692 edges, 47883 markings/sec, 60 secs
lola: 3617466 markings, 43796779 edges, 47928 markings/sec, 65 secs
lola: 3864706 markings, 46935037 edges, 49448 markings/sec, 70 secs
lola: 4106519 markings, 50143491 edges, 48363 markings/sec, 75 secs
lola: 4325937 markings, 53317102 edges, 43884 markings/sec, 80 secs
lola: 4546923 markings, 56452863 edges, 44197 markings/sec, 85 secs
lola: 4764098 markings, 59533468 edges, 43435 markings/sec, 90 secs
lola: 5009186 markings, 62523400 edges, 49018 markings/sec, 95 secs
lola: 5225884 markings, 65473898 edges, 43340 markings/sec, 100 secs
lola: 5455062 markings, 68478168 edges, 45836 markings/sec, 105 secs
lola: 5666351 markings, 71610244 edges, 42258 markings/sec, 110 secs
lola: 5911215 markings, 74703380 edges, 48973 markings/sec, 115 secs
lola: 6145773 markings, 77711023 edges, 46912 markings/sec, 120 secs
lola: 6356805 markings, 80729234 edges, 42206 markings/sec, 125 secs
lola: 6558206 markings, 83671159 edges, 40280 markings/sec, 130 secs
lola: 6776819 markings, 86581341 edges, 43723 markings/sec, 135 secs
lola: 6972163 markings, 89403738 edges, 39069 markings/sec, 140 secs
lola: 7183938 markings, 92381002 edges, 42355 markings/sec, 145 secs
lola: 7390654 markings, 95280622 edges, 41343 markings/sec, 150 secs
lola: 7610201 markings, 98320973 edges, 43909 markings/sec, 155 secs
lola: 7874114 markings, 101522798 edges, 52783 markings/sec, 160 secs
lola: 8104771 markings, 104691561 edges, 46131 markings/sec, 165 secs
lola: 8349056 markings, 107825212 edges, 48857 markings/sec, 170 secs
lola: 8562458 markings, 110948947 edges, 42680 markings/sec, 175 secs
lola: 8803333 markings, 114009115 edges, 48175 markings/sec, 180 secs
lola: 9058793 markings, 117044716 edges, 51092 markings/sec, 185 secs
lola: 9291857 markings, 120000672 edges, 46613 markings/sec, 190 secs
lola: 9522529 markings, 122918961 edges, 46134 markings/sec, 195 secs
lola: 9759601 markings, 125982945 edges, 47414 markings/sec, 200 secs
lola: 9984120 markings, 129063879 edges, 44904 markings/sec, 205 secs
lola: 10238232 markings, 132124594 edges, 50822 markings/sec, 210 secs
lola: 10467493 markings, 135164069 edges, 45852 markings/sec, 215 secs
lola: 10717444 markings, 138177031 edges, 49990 markings/sec, 220 secs
lola: 10933686 markings, 141299990 edges, 43248 markings/sec, 225 secs
lola: 11147830 markings, 144200793 edges, 42829 markings/sec, 230 secs
lola: 11343676 markings, 147225277 edges, 39169 markings/sec, 235 secs
lola: 11557260 markings, 150226165 edges, 42717 markings/sec, 240 secs
lola: 11770541 markings, 153297637 edges, 42656 markings/sec, 245 secs
lola: 11998985 markings, 156139681 edges, 45689 markings/sec, 250 secs
lola: 12198701 markings, 158991412 edges, 39943 markings/sec, 255 secs
lola: 12396137 markings, 161868767 edges, 39487 markings/sec, 260 secs
lola: 12613237 markings, 164863840 edges, 43420 markings/sec, 265 secs
lola: 12821815 markings, 167855850 edges, 41716 markings/sec, 270 secs
lola: 13038651 markings, 170840851 edges, 43367 markings/sec, 275 secs
lola: 13244532 markings, 173840221 edges, 41176 markings/sec, 280 secs
lola: 13454786 markings, 176909758 edges, 42051 markings/sec, 285 secs
lola: 13679200 markings, 179962905 edges, 44883 markings/sec, 290 secs
lola: 13932836 markings, 183063342 edges, 50727 markings/sec, 295 secs
lola: 14156928 markings, 186132383 edges, 44818 markings/sec, 300 secs
lola: 14392901 markings, 189173988 edges, 47195 markings/sec, 305 secs
lola: 14601131 markings, 192205675 edges, 41646 markings/sec, 310 secs
lola: 14834774 markings, 195156127 edges, 46729 markings/sec, 315 secs
lola: 15077135 markings, 198112366 edges, 48472 markings/sec, 320 secs
lola: 15306558 markings, 200947126 edges, 45885 markings/sec, 325 secs
lola: 15524570 markings, 203777386 edges, 43602 markings/sec, 330 secs
lola: 15758908 markings, 206710003 edges, 46868 markings/sec, 335 secs
lola: 15977503 markings, 209728614 edges, 43719 markings/sec, 340 secs
lola: 16220034 markings, 212747372 edges, 48506 markings/sec, 345 secs
lola: 16453052 markings, 215726254 edges, 46604 markings/sec, 350 secs
lola: 16688467 markings, 218670849 edges, 47083 markings/sec, 355 secs
lola: 16919994 markings, 221709626 edges, 46305 markings/sec, 360 secs
lola: 17129150 markings, 224638638 edges, 41831 markings/sec, 365 secs
lola: 17321164 markings, 227680902 edges, 38403 markings/sec, 370 secs
lola: 17531819 markings, 230596872 edges, 42131 markings/sec, 375 secs
lola: 17744235 markings, 233571613 edges, 42483 markings/sec, 380 secs
lola: 17957531 markings, 236350404 edges, 42659 markings/sec, 385 secs
lola: 18160982 markings, 239223320 edges, 40690 markings/sec, 390 secs
lola: 18360900 markings, 242003422 edges, 39984 markings/sec, 395 secs
lola: 18565911 markings, 244892181 edges, 41002 markings/sec, 400 secs
lola: 18771648 markings, 247784770 edges, 41147 markings/sec, 405 secs
lola: 18971558 markings, 250844920 edges, 39982 markings/sec, 410 secs
lola: 19198336 markings, 253770251 edges, 45356 markings/sec, 415 secs
lola: 19389234 markings, 256733318 edges, 38180 markings/sec, 420 secs
lola: 19599444 markings, 259659258 edges, 42042 markings/sec, 425 secs
lola: 19813973 markings, 262682354 edges, 42906 markings/sec, 430 secs
lola: 20030373 markings, 265729074 edges, 43280 markings/sec, 435 secs
lola: 20230803 markings, 268738751 edges, 40086 markings/sec, 440 secs
lola: 20436229 markings, 271700284 edges, 41085 markings/sec, 445 secs
lola: 20617952 markings, 274653276 edges, 36345 markings/sec, 450 secs
lola: 20818028 markings, 277569829 edges, 40015 markings/sec, 455 secs
lola: 21027547 markings, 280454198 edges, 41904 markings/sec, 460 secs
lola: 21234264 markings, 283247013 edges, 41343 markings/sec, 465 secs
lola: 21427967 markings, 286021139 edges, 38741 markings/sec, 470 secs
lola: 21623065 markings, 288782880 edges, 39020 markings/sec, 475 secs
lola: 21825967 markings, 291710667 edges, 40580 markings/sec, 480 secs
lola: 22018225 markings, 294657019 edges, 38452 markings/sec, 485 secs
lola: 22222439 markings, 297618675 edges, 40843 markings/sec, 490 secs
lola: 22435012 markings, 300507435 edges, 42515 markings/sec, 495 secs
lola: 22634470 markings, 303389086 edges, 39892 markings/sec, 500 secs
lola: 22842633 markings, 306269403 edges, 41633 markings/sec, 505 secs
lola: 23033041 markings, 309303356 edges, 38082 markings/sec, 510 secs
lola: 23216359 markings, 312138350 edges, 36664 markings/sec, 515 secs
lola: 23388257 markings, 315048104 edges, 34380 markings/sec, 520 secs
lola: 23569838 markings, 317907779 edges, 36316 markings/sec, 525 secs
lola: 23753660 markings, 320759808 edges, 36764 markings/sec, 530 secs
lola: 23949383 markings, 323584250 edges, 39145 markings/sec, 535 secs
lola: 24126365 markings, 326355624 edges, 35396 markings/sec, 540 secs
lola: 24300282 markings, 329083864 edges, 34783 markings/sec, 545 secs
lola: 24473402 markings, 331849020 edges, 34624 markings/sec, 550 secs
lola: 24654405 markings, 334698045 edges, 36201 markings/sec, 555 secs
lola: 24844394 markings, 337547933 edges, 37998 markings/sec, 560 secs
lola: 25021343 markings, 340506330 edges, 35390 markings/sec, 565 secs
lola: 25219806 markings, 343369038 edges, 39693 markings/sec, 570 secs
lola: 25392521 markings, 346272695 edges, 34543 markings/sec, 575 secs
lola: 25574510 markings, 349117634 edges, 36398 markings/sec, 580 secs
lola: 25774672 markings, 352041709 edges, 40032 markings/sec, 585 secs
lola: 26011114 markings, 355105338 edges, 47288 markings/sec, 590 secs
lola: 26219500 markings, 358137390 edges, 41677 markings/sec, 595 secs
lola: 26437818 markings, 361248989 edges, 43664 markings/sec, 600 secs
lola: 26657451 markings, 364247182 edges, 43927 markings/sec, 605 secs
lola: 26857528 markings, 367218675 edges, 40015 markings/sec, 610 secs
lola: 27051355 markings, 370254856 edges, 38765 markings/sec, 615 secs
lola: 27258687 markings, 373212129 edges, 41466 markings/sec, 620 secs
lola: 27473562 markings, 376173066 edges, 42975 markings/sec, 625 secs
lola: 27693054 markings, 379150716 edges, 43898 markings/sec, 630 secs
lola: 27914162 markings, 381951278 edges, 44222 markings/sec, 635 secs
lola: 28117847 markings, 384817340 edges, 40737 markings/sec, 640 secs
lola: 28322857 markings, 387635932 edges, 41002 markings/sec, 645 secs
lola: 28525249 markings, 390471113 edges, 40478 markings/sec, 650 secs
lola: 28728098 markings, 393375595 edges, 40570 markings/sec, 655 secs
lola: 28947874 markings, 396392779 edges, 43955 markings/sec, 660 secs
lola: 29146027 markings, 399374460 edges, 39631 markings/sec, 665 secs
lola: 29346565 markings, 402412525 edges, 40108 markings/sec, 670 secs
lola: 29575948 markings, 405362379 edges, 45877 markings/sec, 675 secs
lola: 29794553 markings, 408309856 edges, 43721 markings/sec, 680 secs
lola: 29992665 markings, 411286886 edges, 39622 markings/sec, 685 secs
lola: 30197207 markings, 414232553 edges, 40908 markings/sec, 690 secs
lola: 30430376 markings, 417163646 edges, 46634 markings/sec, 695 secs
lola: 30637961 markings, 420204866 edges, 41517 markings/sec, 700 secs
lola: 30824991 markings, 423353476 edges, 37406 markings/sec, 705 secs
lola: 31024047 markings, 426310605 edges, 39811 markings/sec, 710 secs
lola: 31203628 markings, 429258523 edges, 35916 markings/sec, 715 secs
lola: 31384246 markings, 432214096 edges, 36124 markings/sec, 720 secs
lola: 31545534 markings, 435303669 edges, 32258 markings/sec, 725 secs
lola: 31746431 markings, 438181719 edges, 40179 markings/sec, 730 secs
lola: 31930675 markings, 441135616 edges, 36849 markings/sec, 735 secs
lola: 32118479 markings, 444082039 edges, 37561 markings/sec, 740 secs
lola: 32315725 markings, 447066640 edges, 39449 markings/sec, 745 secs
lola: 32495428 markings, 450088531 edges, 35941 markings/sec, 750 secs
lola: 32712538 markings, 452845884 edges, 43422 markings/sec, 755 secs
lola: 32905128 markings, 455668592 edges, 38518 markings/sec, 760 secs
lola: 33082674 markings, 458532416 edges, 35509 markings/sec, 765 secs
lola: 33259566 markings, 461355413 edges, 35378 markings/sec, 770 secs
lola: 33437356 markings, 464163773 edges, 35558 markings/sec, 775 secs
lola: 33622075 markings, 466986049 edges, 36944 markings/sec, 780 secs
lola: 33794897 markings, 469842149 edges, 34564 markings/sec, 785 secs
lola: 33985807 markings, 472718331 edges, 38182 markings/sec, 790 secs
lola: 34162808 markings, 475698115 edges, 35400 markings/sec, 795 secs
lola: 34374570 markings, 478592286 edges, 42352 markings/sec, 800 secs
lola: 34556904 markings, 481575977 edges, 36467 markings/sec, 805 secs
lola: 34725519 markings, 484613013 edges, 33723 markings/sec, 810 secs
lola: 34923770 markings, 487582906 edges, 39650 markings/sec, 815 secs
lola: 35124291 markings, 490488698 edges, 40104 markings/sec, 820 secs
lola: 35318928 markings, 493404471 edges, 38927 markings/sec, 825 secs
lola: 35493168 markings, 496438045 edges, 34848 markings/sec, 830 secs
lola: 35664599 markings, 499388923 edges, 34286 markings/sec, 835 secs
lola: 35857302 markings, 502319646 edges, 38541 markings/sec, 840 secs
lola: 36050452 markings, 505239640 edges, 38630 markings/sec, 845 secs
lola: 36217085 markings, 508154821 edges, 33327 markings/sec, 850 secs
lola: 36483063 markings, 511257674 edges, 53196 markings/sec, 855 secs
lola: 36723396 markings, 514343236 edges, 48067 markings/sec, 860 secs
lola: 36975547 markings, 517341464 edges, 50430 markings/sec, 865 secs
lola: 37199304 markings, 520319229 edges, 44751 markings/sec, 870 secs
lola: 37440911 markings, 523262772 edges, 48321 markings/sec, 875 secs
lola: 37696230 markings, 526172519 edges, 51064 markings/sec, 880 secs
lola: 37938760 markings, 528975035 edges, 48506 markings/sec, 885 secs
lola: 38171234 markings, 531765350 edges, 46495 markings/sec, 890 secs
lola: 38414909 markings, 534678863 edges, 48735 markings/sec, 895 secs
lola: 38640196 markings, 537659757 edges, 45057 markings/sec, 900 secs
lola: 38898796 markings, 540607571 edges, 51720 markings/sec, 905 secs
lola: 39136335 markings, 543523485 edges, 47508 markings/sec, 910 secs
lola: 39390690 markings, 546456904 edges, 50871 markings/sec, 915 secs
lola: 39617742 markings, 549435150 edges, 45410 markings/sec, 920 secs
lola: 39830811 markings, 552325521 edges, 42614 markings/sec, 925 secs
lola: 40032527 markings, 555197248 edges, 40343 markings/sec, 930 secs
lola: 40245729 markings, 558077964 edges, 42640 markings/sec, 935 secs
lola: 40480521 markings, 561016262 edges, 46958 markings/sec, 940 secs
lola: 40697044 markings, 563749327 edges, 43305 markings/sec, 945 secs
lola: 40895728 markings, 566473773 edges, 39737 markings/sec, 950 secs
lola: 41108686 markings, 569251694 edges, 42592 markings/sec, 955 secs
lola: 41328044 markings, 572131416 edges, 43872 markings/sec, 960 secs
lola: 41530080 markings, 575047329 edges, 40407 markings/sec, 965 secs
lola: 41757864 markings, 577901794 edges, 45557 markings/sec, 970 secs
lola: 41967220 markings, 580789651 edges, 41871 markings/sec, 975 secs
lola: 42189262 markings, 583760473 edges, 44408 markings/sec, 980 secs
lola: 42436618 markings, 586653385 edges, 49471 markings/sec, 985 secs
lola: 42708874 markings, 589493810 edges, 54451 markings/sec, 990 secs
lola: 42995058 markings, 592394154 edges, 57237 markings/sec, 995 secs
lola: 43250303 markings, 595321867 edges, 51049 markings/sec, 1000 secs
lola: 43503219 markings, 598244289 edges, 50583 markings/sec, 1005 secs
lola: 43719200 markings, 601081290 edges, 43196 markings/sec, 1010 secs
lola: 43981591 markings, 603967919 edges, 52478 markings/sec, 1015 secs
lola: 44217644 markings, 606883131 edges, 47211 markings/sec, 1020 secs
lola: 44481014 markings, 609807119 edges, 52674 markings/sec, 1025 secs
lola: 44739355 markings, 612739532 edges, 51668 markings/sec, 1030 secs
lola: 44985532 markings, 615663990 edges, 49235 markings/sec, 1035 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 45086785 markings, 616736282 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G (F ((((((1 <= p46) AND (1 <= p63)) OR ((1 <= p50) AND (1 <= p67))) R ((p50 <= 0) OR (p67 <= 0))) AND G (((p15 <= 0) OR (p109 <= 0)))))) OR ((1 <= p15) AND (1 <= p109)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p15) AND (1 <= p109))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p15) AND (1 <= p109))
lola: processed formula length: 28
lola: 74 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: ========================================
lola: ...considering subproblem: G (F ((((((1 <= p46) AND (1 <= p63)) OR ((1 <= p50) AND (1 <= p67))) R ((p50 <= 0) OR (p67 <= 0))) AND G (((p15 <= 0) OR (p109 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((((1 <= p46) AND (1 <= p63)) OR ((1 <= p50) AND (1 <= p67))) R ((p50 <= 0) OR (p67 <= 0))) AND G (((p15 <= 0) OR (p109 <= 0))))))
lola: processed formula length: 140
lola: 74 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 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: 3610 markings, 19025 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 no no no
lola:
preliminary result: no no no no no no no no no no no no
lola: memory consumption: 44304 KB
lola: time consumption: 1350 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="DES-PT-01a"
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 DES-PT-01a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-ebro-158987899800194"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-01a.tgz
mv DES-PT-01a 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 ;