About the Execution of ITS-LoLa for Kanban-PT-05000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15793.290 | 3600000.00 | 676863.00 | 4653.20 | ?FFFFFFFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2020-input.r184-oct2-158987928700554.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is Kanban-PT-05000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-oct2-158987928700554
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.4K Apr 8 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 8 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 7 16:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 7 16:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Apr 14 12:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 14 12:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Apr 6 19:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Apr 6 19:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 6 02:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 6 02:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 14K 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 Kanban-PT-05000-00
FORMULA_NAME Kanban-PT-05000-01
FORMULA_NAME Kanban-PT-05000-02
FORMULA_NAME Kanban-PT-05000-03
FORMULA_NAME Kanban-PT-05000-04
FORMULA_NAME Kanban-PT-05000-05
FORMULA_NAME Kanban-PT-05000-06
FORMULA_NAME Kanban-PT-05000-07
FORMULA_NAME Kanban-PT-05000-08
FORMULA_NAME Kanban-PT-05000-09
FORMULA_NAME Kanban-PT-05000-10
FORMULA_NAME Kanban-PT-05000-11
FORMULA_NAME Kanban-PT-05000-12
FORMULA_NAME Kanban-PT-05000-13
FORMULA_NAME Kanban-PT-05000-14
FORMULA_NAME Kanban-PT-05000-15
=== Now, execution of the tool begins
BK_START 1591213667858
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 19:47:49] [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 19:47:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 19:47:49] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2020-06-03 19:47:49] [INFO ] Transformed 16 places.
[2020-06-03 19:47:49] [INFO ] Transformed 16 transitions.
[2020-06-03 19:47:49] [INFO ] Parsed PT model containing 16 places and 16 transitions in 49 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100020 steps, including 0 resets, run finished after 36 ms. (steps per millisecond=2778 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 16 rows 16 cols
[2020-06-03 19:47:49] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-03 19:47:49] [INFO ] [Real]Absence check using 4 positive place invariants in 14 ms returned sat
[2020-06-03 19:47:49] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 19:47:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:47:49] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2020-06-03 19:47:49] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 6 ms.
[2020-06-03 19:47:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 19:47:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2020-06-03 19:47:49] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2020-06-03 19:47:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 19:47:49] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2020-06-03 19:47:49] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 19:47:49] [INFO ] Added : 14 causal constraints over 4 iterations in 18 ms. Result :sat
[2020-06-03 19:47:49] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-06-03 19:47:49] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 19:47:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:47:49] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2020-06-03 19:47:49] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 3 ms.
[2020-06-03 19:47:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 19:47:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2020-06-03 19:47:49] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 19:47:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 19:47:49] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2020-06-03 19:47:49] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 19:47:49] [INFO ] Added : 14 causal constraints over 4 iterations in 25 ms. Result :sat
[2020-06-03 19:47:49] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 19:47:49] [INFO ] Flatten gal took : 18 ms
FORMULA Kanban-PT-05000-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-05000-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-05000-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 19:47:49] [INFO ] Flatten gal took : 3 ms
[2020-06-03 19:47:49] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2020-06-03 19:47:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ Kanban-PT-05000 @ 3570 seconds
FORMULA Kanban-PT-05000-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-05000-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-05000-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-05000-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-05000-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-05000-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-05000-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-05000-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-05000-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-05000-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-05000-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-05000-00 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-05000-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2961
rslt: Output for LTLFireability @ Kanban-PT-05000
{
"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",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 19:47:50 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 2,
"adisj": 2,
"aneg": 2,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((F (((((1 <= p2) OR (p6 <= 0)) AND (p5 <= 0)) AND X ((1 <= p6)))) AND ((1 <= p5) OR X (((((1 <= p2) OR (p6 <= 0)) AND (p5 <= 0)) AND X ((1 <= p6)))))))",
"processed_size": 156,
"rewrites": 94
},
"result":
{
"edges": 30004,
"markings": 30004,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((X (G ((p4 <= 0))) OR (p1 <= 0)))",
"processed_size": 36,
"rewrites": 94
},
"result":
{
"edges": 30004,
"markings": 30004,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 3,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((((F ((1 <= p8)) U ((1 <= p3) AND (1 <= p9) AND (1 <= p14))) U ((1 <= p10) U G (((1 <= p3) AND (1 <= p9) AND (1 <= p14))))) OR (1 <= p10)))",
"processed_size": 142,
"rewrites": 94
},
"result":
{
"edges": 40003,
"markings": 40003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F ((X (X ((p5 <= 0))) AND ((p1 <= 0) AND (p1 <= 0))))",
"processed_size": 53,
"rewrites": 94
},
"result":
{
"edges": 50004,
"markings": 50004,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 3,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((((p5 <= 0) R (p10 <= 0)) AND (F ((p15 <= 0)) AND (G ((p10 <= 0)) AND (1 <= p15)))))",
"processed_size": 87,
"rewrites": 94
},
"result":
{
"edges": 30004,
"markings": 30004,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (X ((X (F ((1 <= p6))) OR (1 <= p6))))",
"processed_size": 40,
"rewrites": 94
},
"result":
{
"edges": 30004,
"markings": 30004,
"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": 509
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p10)",
"processed_size": 10,
"rewrites": 94
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 2,
"X": 2,
"aconj": 0,
"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": 2,
"visible_transitions": 0
},
"processed": "(((1 <= p8) U X (G ((1 <= p10)))) U X ((1 <= p10)))",
"processed_size": 51,
"rewrites": 94
},
"result":
{
"edges": 30004,
"markings": 30004,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((1 <= p1)))",
"processed_size": 17,
"rewrites": 94
},
"result":
{
"edges": 5002,
"markings": 5002,
"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": "fairness",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 2,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((((1 <= p8) OR (1 <= p1)) OR (G ((p8 <= 0)) AND F (((1 <= p8) OR (1 <= p1)))))))",
"processed_size": 88,
"rewrites": 94
},
"result":
{
"edges": 5008,
"markings": 5006,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 1085
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"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 ((F ((1 <= p8)) AND (F ((G (F ((1 <= p8))) AND ((p3 <= 0) OR (p9 <= 0) OR (p14 <= 0)))) OR ((1 <= p12) U (1 <= p8)))))",
"processed_size": 122,
"rewrites": 94
},
"result":
{
"edges": 5002,
"markings": 5002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1628
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1628
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p12 <= 0)",
"processed_size": 10,
"rewrites": 94
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3257
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((1 <= p2)))",
"processed_size": 17,
"rewrites": 94
},
"result":
{
"edges": 5004,
"markings": 5003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3257
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3257
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p12)",
"processed_size": 10,
"rewrites": 94
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p12)",
"processed_size": 10,
"rewrites": 94
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (((p12 <= 0) AND (F ((p12 <= 0)) OR G ((p12 <= 0)))))",
"processed_size": 55,
"rewrites": 94
},
"result":
{
"edges": 20005,
"markings": 15005,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 15,
"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": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3676,
"runtime": 608.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G((F(**) OR *))) : G((F((* AND X(**))) AND (** OR X((* AND X(**)))))) : G((X(G(*)) OR *)) : X((((F(**) U **) U (** U G(**))) OR **)) : F((X(X(*)) AND (** AND *))) : G(F(**)) : F(G((** OR (G(*) AND F(**))))) : X(((* R *) AND (F(*) AND (G(*) AND **)))) : G((F(**) AND (F((G(F(**)) AND **)) OR (** U **)))) : (G((* AND (F(*) OR G(*)))) OR **) : X(X((X(F(**)) OR **))) : (((** U X(G(**))) U X(**)) OR (G(**) AND **)) : (F(G(*)) AND **)"
},
"net":
{
"arcs": 40,
"conflict_clusters": 12,
"places": 16,
"places_significant": 11,
"singleton_clusters": 0,
"transitions": 16
},
"result":
{
"preliminary_value": "unknown no no no no no no no no no no no no ",
"value": "unknown 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: 32/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 512
lola: finding significant places
lola: 16 places, 16 transitions, 11 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: NOT(G (F ((NOT(F ((1 <= p1))) AND (p5 <= 0))))) : G (((1 <= p5) U (NOT(X ((((p2 <= 0) AND (1 <= p6)) OR (1 <= p5)))) AND X (X ((1 <= p6)))))) : NOT(F ((X ((F ((1 <= p10)) U F ((1 <= p4)))) AND (1 <= p1)))) : X ((((F ((1 <= p8)) U ((1 <= p3) AND (1 <= p9) AND (1 <= p14))) U ((1 <= p10) U G (((1 <= p3) AND (1 <= p9) AND (1 <= p14))))) OR (1 <= p10))) : F (((NOT(X (X ((1 <= p5)))) AND (p1 <= 0)) AND NOT(((1 <= p1) U (1 <= p1))))) : X (NOT(F (X ((F ((p8 <= 0)) U G (X (F (NOT(F ((1 <= p1))))))))))) : X (G (F (X (NOT(F (NOT((G (NOT(F ((1 <= p8)))) U ((1 <= p8) OR (1 <= p1)))))))))) : X ((((NOT(((1 <= p5) U (1 <= p10))) AND NOT(G ((1 <= p15)))) AND NOT(F ((1 <= p10)))) AND (1 <= p15))) : G ((F ((G (F ((1 <= p8))) AND ((p3 <= 0) OR (p9 <= 0) OR (p14 <= 0)))) U ((1 <= p12) U (1 <= p8)))) : (NOT(F ((G ((1 <= p12)) U (1 <= p12)))) OR (1 <= p12)) : X (X ((F (((p1 <= 0) U X (F ((1 <= p6))))) OR (1 <= p6)))) : ((((1 <= p8) U X (G ((1 <= p10)))) U X ((1 <= p10))) OR (G ((1 <= p4)) AND (1 <= p10))) : (NOT(F (G ((G (X ((1 <= p5))) U F ((p2 <= 0)))))) AND (p12 <= 0))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:416
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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:377
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (((((1 <= p2) OR (p6 <= 0)) AND (p5 <= 0)) AND X ((1 <= p6)))) AND ((1 <= p5) OR X (((((1 <= p2) OR (p6 <= 0)) AND (p5 <= 0)) AND X ((1 <= p6)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (((((1 <= p2) OR (p6 <= 0)) AND (p5 <= 0)) AND X ((1 <= p6)))) AND ((1 <= p5) OR X (((((1 <= p2) OR (p6 <= 0)) AND (p5 <= 0)) AND X ((1 <= p6)))))))
lola: processed formula length: 156
lola: 94 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 30004 markings, 30004 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (G ((p4 <= 0))) OR (p1 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (G ((p4 <= 0))) OR (p1 <= 0)))
lola: processed formula length: 36
lola: 94 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: 30004 markings, 30004 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((F ((1 <= p8)) U ((1 <= p3) AND (1 <= p9) AND (1 <= p14))) U ((1 <= p10) U G (((1 <= p3) AND (1 <= p9) AND (1 <= p14))))) OR (1 <= p10)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((F ((1 <= p8)) U ((1 <= p3) AND (1 <= p9) AND (1 <= p14))) U ((1 <= p10) U G (((1 <= p3) AND (1 <= p9) AND (1 <= p14))))) OR (1 <= p10)))
lola: processed formula length: 142
lola: 94 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 12 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 40003 markings, 40003 edges
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (X ((p5 <= 0))) AND ((p1 <= 0) AND (p1 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (X ((p5 <= 0))) AND ((p1 <= 0) AND (p1 <= 0))))
lola: processed formula length: 53
lola: 94 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: 50004 markings, 50004 edges
lola: ========================================
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p5 <= 0) R (p10 <= 0)) AND (F ((p15 <= 0)) AND (G ((p10 <= 0)) AND (1 <= p15)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p5 <= 0) R (p10 <= 0)) AND (F ((p15 <= 0)) AND (G ((p10 <= 0)) AND (1 <= p15)))))
lola: processed formula length: 87
lola: 94 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: 30004 markings, 30004 edges
lola: ========================================
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((X (F ((1 <= p6))) OR (1 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((X (F ((1 <= p6))) OR (1 <= p6))))
lola: processed formula length: 40
lola: 94 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: 30004 markings, 30004 edges
lola: ========================================
lola: subprocess 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p8) U X (G ((1 <= p10)))) U X ((1 <= p10))) OR (G ((1 <= p4)) AND (1 <= p10)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p10)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p10)
lola: processed formula length: 10
lola: 94 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p8) U X (G ((1 <= p10)))) U X ((1 <= p10)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p8) U X (G ((1 <= p10)))) U X ((1 <= p10)))
lola: processed formula length: 51
lola: 94 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 30004 markings, 30004 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((1 <= p1)))
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 <= p1)))
lola: processed formula length: 17
lola: 94 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: 5002 markings, 5002 edges
lola: ========================================
lola: subprocess 8 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((1 <= p8) OR (1 <= p1)) OR (G ((p8 <= 0)) AND F (((1 <= p8) OR (1 <= p1)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((1 <= p8) OR (1 <= p1)) OR (G ((p8 <= 0)) AND F (((1 <= p8) OR (1 <= p1)))))))
lola: processed formula length: 88
lola: 94 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 4
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: 5006 markings, 5008 edges
lola: ========================================
lola: subprocess 9 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((1 <= p1)) OR (1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((1 <= p1)) OR (1 <= p5))))
lola: processed formula length: 36
lola: 94 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 3333978 markings, 6624545 edges, 666796 markings/sec, 0 secs
lola: 6200427 markings, 12351282 edges, 573290 markings/sec, 5 secs
lola: 8722620 markings, 17393701 edges, 504439 markings/sec, 10 secs
lola: 11020557 markings, 21986055 edges, 459587 markings/sec, 15 secs
lola: 13195179 markings, 26334257 edges, 434924 markings/sec, 20 secs
lola: 15358802 markings, 30657990 edges, 432725 markings/sec, 25 secs
lola: 17556412 markings, 35053280 edges, 439522 markings/sec, 30 secs
lola: 19803595 markings, 39543815 edges, 449437 markings/sec, 35 secs
lola: 21960183 markings, 43853195 edges, 431318 markings/sec, 40 secs
lola: 24054696 markings, 48045071 edges, 418903 markings/sec, 45 secs
lola: 26341180 markings, 53193790 edges, 457297 markings/sec, 50 secs
lola: 28699561 markings, 59073041 edges, 471676 markings/sec, 55 secs
lola: 30588333 markings, 63785106 edges, 377754 markings/sec, 60 secs
lola: 32326865 markings, 68124830 edges, 347706 markings/sec, 65 secs
lola: 33909555 markings, 72077970 edges, 316538 markings/sec, 70 secs
lola: 35423193 markings, 75857130 edges, 302728 markings/sec, 75 secs
lola: 36902426 markings, 79550336 edges, 295847 markings/sec, 80 secs
lola: 38296435 markings, 83030122 edges, 278802 markings/sec, 85 secs
lola: 39652912 markings, 86415790 edges, 271295 markings/sec, 90 secs
lola: 40983802 markings, 89740630 edges, 266178 markings/sec, 95 secs
lola: 42319067 markings, 93074480 edges, 267053 markings/sec, 100 secs
lola: 43640057 markings, 96378097 edges, 264198 markings/sec, 105 secs
lola: 44955830 markings, 99662801 edges, 263155 markings/sec, 110 secs
lola: 46268173 markings, 102940908 edges, 262469 markings/sec, 115 secs
lola: 47569391 markings, 106187699 edges, 260244 markings/sec, 120 secs
lola: 48859268 markings, 109412983 edges, 257975 markings/sec, 125 secs
lola: 50152358 markings, 112642351 edges, 258618 markings/sec, 130 secs
lola: 53483404 markings, 119261148 edges, 666209 markings/sec, 135 secs
lola: 56417411 markings, 125123552 edges, 586801 markings/sec, 140 secs
lola: 58997599 markings, 130280787 edges, 516038 markings/sec, 145 secs
lola: 61348616 markings, 134978219 edges, 470203 markings/sec, 150 secs
lola: 63557172 markings, 139393966 edges, 441711 markings/sec, 155 secs
lola: 65649363 markings, 143576645 edges, 418438 markings/sec, 160 secs
lola: 67643808 markings, 147563849 edges, 398889 markings/sec, 165 secs
lola: 69727734 markings, 151731197 edges, 416785 markings/sec, 170 secs
lola: 71832605 markings, 155938872 edges, 420974 markings/sec, 175 secs
lola: 73851444 markings, 159972662 edges, 403768 markings/sec, 180 secs
lola: 75803658 markings, 163952516 edges, 390443 markings/sec, 185 secs
lola: 78241880 markings, 170031892 edges, 487644 markings/sec, 190 secs
lola: 80263443 markings, 175079288 edges, 404313 markings/sec, 195 secs
lola: 81972376 markings, 179344786 edges, 341787 markings/sec, 200 secs
lola: 83491364 markings, 183141025 edges, 303798 markings/sec, 205 secs
lola: 85001035 markings, 186908858 edges, 301934 markings/sec, 210 secs
lola: 86418268 markings, 190448454 edges, 283447 markings/sec, 215 secs
lola: 87763100 markings, 193808423 edges, 268966 markings/sec, 220 secs
lola: 88942369 markings, 196758263 edges, 235854 markings/sec, 225 secs
lola: 90147274 markings, 199766867 edges, 240981 markings/sec, 230 secs
lola: 90815375 markings, 201434934 edges, 133620 markings/sec, 235 secs
lola: 91515015 markings, 203179820 edges, 139928 markings/sec, 240 secs
lola: 92177627 markings, 204838437 edges, 132522 markings/sec, 245 secs
lola: 93117445 markings, 207185306 edges, 187964 markings/sec, 250 secs
lola: 94027185 markings, 209459587 edges, 181948 markings/sec, 255 secs
lola: 95175518 markings, 212329956 edges, 229667 markings/sec, 260 secs
lola: 96207677 markings, 214906900 edges, 206432 markings/sec, 265 secs
lola: 97287640 markings, 217603353 edges, 215993 markings/sec, 270 secs
lola: 98113834 markings, 219666581 edges, 165239 markings/sec, 275 secs
lola: 99169952 markings, 222306449 edges, 211224 markings/sec, 280 secs
lola: 100212866 markings, 224916777 edges, 208583 markings/sec, 285 secs
lola: 102052377 markings, 228810855 edges, 367902 markings/sec, 290 secs
lola: 104536221 markings, 233772603 edges, 496769 markings/sec, 295 secs
lola: 106854204 markings, 238405635 edges, 463597 markings/sec, 300 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 1085 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((1 <= p8)) AND (F ((G (F ((1 <= p8))) AND ((p3 <= 0) OR (p9 <= 0) OR (p14 <= 0)))) OR ((1 <= p12) U (1 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((1 <= p8)) AND (F ((G (F ((1 <= p8))) AND ((p3 <= 0) OR (p9 <= 0) OR (p14 <= 0)))) OR ((1 <= p12) U (1 <= p8)))))
lola: processed formula length: 122
lola: 94 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 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: 5002 markings, 5002 edges
lola: ========================================
lola: subprocess 11 will run for 1628 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((1 <= p2))) AND (p12 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 1628 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p12 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p12 <= 0)
lola: processed formula length: 10
lola: 94 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 3257 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((1 <= p2)))
lola: processed formula length: 17
lola: 94 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 7
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: 5003 markings, 5004 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 3257 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((p12 <= 0) AND (F ((p12 <= 0)) OR G ((p12 <= 0))))) OR (1 <= p12))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 3257 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p12)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p12)
lola: processed formula length: 10
lola: 94 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((F ((1 <= p1)) OR (1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((1 <= p1)) OR (1 <= p5))))
lola: processed formula length: 36
lola: 94 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 3485894 markings, 6927058 edges, 697179 markings/sec, 0 secs
lola: 6566895 markings, 13084674 edges, 616200 markings/sec, 5 secs
lola: 9293621 markings, 18535192 edges, 545345 markings/sec, 10 secs
lola: 11852485 markings, 23650235 edges, 511773 markings/sec, 15 secs
lola: 14268810 markings, 28480844 edges, 483265 markings/sec, 20 secs
lola: 16779684 markings, 33499576 edges, 502175 markings/sec, 25 secs
lola: 19004914 markings, 37945284 edges, 445046 markings/sec, 30 secs
lola: 21098987 markings, 42132269 edges, 418815 markings/sec, 35 secs
lola: 23146864 markings, 46225391 edges, 409575 markings/sec, 40 secs
lola: 25103044 markings, 50139155 edges, 391236 markings/sec, 45 secs
lola: 27761999 markings, 56735757 edges, 531791 markings/sec, 50 secs
lola: 29898738 markings, 62066499 edges, 427348 markings/sec, 55 secs
lola: 31667587 markings, 66480913 edges, 353770 markings/sec, 60 secs
lola: 33223551 markings, 70364624 edges, 311193 markings/sec, 65 secs
lola: 34702114 markings, 74055056 edges, 295713 markings/sec, 70 secs
lola: 36097869 markings, 77538410 edges, 279151 markings/sec, 75 secs
lola: 37483644 markings, 80998122 edges, 277155 markings/sec, 80 secs
lola: 38864739 markings, 84449389 edges, 276219 markings/sec, 85 secs
lola: 40264330 markings, 87947115 edges, 279918 markings/sec, 90 secs
lola: 41617836 markings, 91326219 edges, 270701 markings/sec, 95 secs
lola: 42941707 markings, 94634650 edges, 264774 markings/sec, 100 secs
lola: 44253463 markings, 97906236 edges, 262351 markings/sec, 105 secs
lola: 45545738 markings, 101138305 edges, 258455 markings/sec, 110 secs
lola: 46829300 markings, 104342419 edges, 256712 markings/sec, 115 secs
lola: 48132048 markings, 107593327 edges, 260550 markings/sec, 120 secs
lola: 49443008 markings, 110868986 edges, 262192 markings/sec, 125 secs
lola: 51773228 markings, 115845901 edges, 466044 markings/sec, 130 secs
lola: 54888427 markings, 122069220 edges, 623040 markings/sec, 135 secs
lola: 57805680 markings, 127897858 edges, 583451 markings/sec, 140 secs
lola: 60540352 markings, 133364303 edges, 546934 markings/sec, 145 secs
lola: 63003386 markings, 138288522 edges, 492607 markings/sec, 150 secs
lola: 65332235 markings, 142942723 edges, 465770 markings/sec, 155 secs
lola: 67482502 markings, 147241084 edges, 430053 markings/sec, 160 secs
lola: 69416227 markings, 151107543 edges, 386745 markings/sec, 165 secs
lola: 71318130 markings, 154909638 edges, 380381 markings/sec, 170 secs
lola: 73123993 markings, 158519149 edges, 361173 markings/sec, 175 secs
lola: 74879465 markings, 162030771 edges, 351094 markings/sec, 180 secs
lola: 77071751 markings, 167112219 edges, 438457 markings/sec, 185 secs
lola: 79180101 markings, 172373085 edges, 421670 markings/sec, 190 secs
lola: 80994783 markings, 176902651 edges, 362936 markings/sec, 195 secs
lola: 82677211 markings, 181106658 edges, 336486 markings/sec, 200 secs
lola: 84222304 markings, 184963183 edges, 309019 markings/sec, 205 secs
lola: 85611951 markings, 188433432 edges, 277929 markings/sec, 210 secs
lola: 87032209 markings, 191983528 edges, 284052 markings/sec, 215 secs
lola: 88352475 markings, 195282796 edges, 264053 markings/sec, 220 secs
lola: 89660464 markings, 198579005 edges, 261598 markings/sec, 225 secs
lola: 90925682 markings, 201711989 edges, 253044 markings/sec, 230 secs
lola: 92134811 markings, 204728227 edges, 241826 markings/sec, 235 secs
lola: 93242428 markings, 207496492 edges, 221523 markings/sec, 240 secs
lola: 94395908 markings, 210381332 edges, 230696 markings/sec, 245 secs
lola: 95567969 markings, 213309403 edges, 234412 markings/sec, 250 secs
lola: 96696244 markings, 216126121 edges, 225655 markings/sec, 255 secs
lola: 97867745 markings, 219051465 edges, 234300 markings/sec, 260 secs
lola: 99022116 markings, 221935290 edges, 230874 markings/sec, 265 secs
lola: 100171362 markings, 224810291 edges, 229849 markings/sec, 270 secs
lola: 102334384 markings, 229373532 edges, 432604 markings/sec, 275 secs
lola: 104841217 markings, 234382249 edges, 501367 markings/sec, 280 secs
lola: 107245365 markings, 239185529 edges, 480830 markings/sec, 285 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (G (((p12 <= 0) AND (F ((p12 <= 0)) OR G ((p12 <= 0))))) OR (1 <= p12))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (1 <= p12)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p12)
lola: processed formula length: 10
lola: 94 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (((p12 <= 0) AND (F ((p12 <= 0)) OR G ((p12 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p12 <= 0) AND (F ((p12 <= 0)) OR G ((p12 <= 0)))))
lola: processed formula length: 55
lola: 94 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 15005 markings, 20005 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: unknown no no no no no no no no no no no no
lola:
preliminary result: unknown no no no no no no no no no no no no
lola: memory consumption: 3676 KB
lola: time consumption: 608 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="Kanban-PT-05000"
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 Kanban-PT-05000, 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 r184-oct2-158987928700554"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Kanban-PT-05000.tgz
mv Kanban-PT-05000 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 ;