About the Execution of ITS-LoLa for ShieldIIPt-PT-020A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15742.710 | 3600000.00 | 64285.00 | 137.60 | FFFFFTTFFFFFFFFT | 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.r211-tajo-159033477300314.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 ShieldIIPt-PT-020A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477300314
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 276K
-rw-r--r-- 1 mcc users 3.2K May 14 01:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 14 01:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 13 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 13 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 14 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.5K May 13 13:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 13:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 08:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 13 08:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 105K May 12 20:42 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 ShieldIIPt-PT-020A-00
FORMULA_NAME ShieldIIPt-PT-020A-01
FORMULA_NAME ShieldIIPt-PT-020A-02
FORMULA_NAME ShieldIIPt-PT-020A-03
FORMULA_NAME ShieldIIPt-PT-020A-04
FORMULA_NAME ShieldIIPt-PT-020A-05
FORMULA_NAME ShieldIIPt-PT-020A-06
FORMULA_NAME ShieldIIPt-PT-020A-07
FORMULA_NAME ShieldIIPt-PT-020A-08
FORMULA_NAME ShieldIIPt-PT-020A-09
FORMULA_NAME ShieldIIPt-PT-020A-10
FORMULA_NAME ShieldIIPt-PT-020A-11
FORMULA_NAME ShieldIIPt-PT-020A-12
FORMULA_NAME ShieldIIPt-PT-020A-13
FORMULA_NAME ShieldIIPt-PT-020A-14
FORMULA_NAME ShieldIIPt-PT-020A-15
=== Now, execution of the tool begins
BK_START 1591298887793
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 19:28:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 19:28:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 19:28:10] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2020-06-04 19:28:10] [INFO ] Transformed 383 places.
[2020-06-04 19:28:10] [INFO ] Transformed 283 transitions.
[2020-06-04 19:28:10] [INFO ] Found NUPN structural information;
[2020-06-04 19:28:10] [INFO ] Parsed PT model containing 383 places and 283 transitions in 115 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 458 ms. (steps per millisecond=218 ) properties seen :[0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1]
// Phase 1: matrix 282 rows 383 cols
[2020-06-04 19:28:10] [INFO ] Computed 181 place invariants in 12 ms
[2020-06-04 19:28:10] [INFO ] [Real]Absence check using 181 positive place invariants in 96 ms returned sat
[2020-06-04 19:28:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:28:11] [INFO ] [Real]Absence check using state equation in 382 ms returned sat
[2020-06-04 19:28:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:28:11] [INFO ] [Nat]Absence check using 181 positive place invariants in 59 ms returned sat
[2020-06-04 19:28:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:28:11] [INFO ] [Nat]Absence check using state equation in 399 ms returned sat
[2020-06-04 19:28:11] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 25 ms.
[2020-06-04 19:28:14] [INFO ] Added : 281 causal constraints over 59 iterations in 2239 ms. Result :sat
[2020-06-04 19:28:14] [INFO ] [Real]Absence check using 181 positive place invariants in 267 ms returned sat
[2020-06-04 19:28:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:28:14] [INFO ] [Real]Absence check using state equation in 350 ms returned sat
[2020-06-04 19:28:14] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 30 ms.
[2020-06-04 19:28:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:28:15] [INFO ] [Nat]Absence check using 181 positive place invariants in 55 ms returned sat
[2020-06-04 19:28:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:28:15] [INFO ] [Nat]Absence check using state equation in 291 ms returned sat
[2020-06-04 19:28:15] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 20 ms.
[2020-06-04 19:28:16] [INFO ] Added : 279 causal constraints over 57 iterations in 1376 ms. Result :sat
[2020-06-04 19:28:16] [INFO ] [Real]Absence check using 181 positive place invariants in 77 ms returned sat
[2020-06-04 19:28:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:28:17] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2020-06-04 19:28:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:28:17] [INFO ] [Nat]Absence check using 181 positive place invariants in 69 ms returned sat
[2020-06-04 19:28:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:28:17] [INFO ] [Nat]Absence check using state equation in 315 ms returned sat
[2020-06-04 19:28:17] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 18 ms.
[2020-06-04 19:28:19] [INFO ] Added : 276 causal constraints over 57 iterations in 1668 ms. Result :sat
[2020-06-04 19:28:19] [INFO ] [Real]Absence check using 181 positive place invariants in 113 ms returned sat
[2020-06-04 19:28:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:28:20] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2020-06-04 19:28:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:28:20] [INFO ] [Nat]Absence check using 181 positive place invariants in 73 ms returned sat
[2020-06-04 19:28:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:28:20] [INFO ] [Nat]Absence check using state equation in 367 ms returned sat
[2020-06-04 19:28:20] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 19 ms.
[2020-06-04 19:28:21] [INFO ] Added : 276 causal constraints over 57 iterations in 1334 ms. Result :sat
[2020-06-04 19:28:22] [INFO ] [Real]Absence check using 181 positive place invariants in 77 ms returned sat
[2020-06-04 19:28:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:28:22] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2020-06-04 19:28:22] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 36 ms.
[2020-06-04 19:28:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:28:22] [INFO ] [Nat]Absence check using 181 positive place invariants in 90 ms returned sat
[2020-06-04 19:28:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:28:23] [INFO ] [Nat]Absence check using state equation in 366 ms returned sat
[2020-06-04 19:28:23] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 31 ms.
[2020-06-04 19:28:24] [INFO ] Added : 278 causal constraints over 57 iterations in 1567 ms. Result :sat
[2020-06-04 19:28:24] [INFO ] [Real]Absence check using 181 positive place invariants in 55 ms returned sat
[2020-06-04 19:28:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:28:25] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2020-06-04 19:28:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:28:25] [INFO ] [Nat]Absence check using 181 positive place invariants in 78 ms returned sat
[2020-06-04 19:28:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:28:25] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2020-06-04 19:28:25] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 27 ms.
[2020-06-04 19:28:26] [INFO ] Added : 276 causal constraints over 56 iterations in 1224 ms. Result :sat
[2020-06-04 19:28:26] [INFO ] [Real]Absence check using 181 positive place invariants in 57 ms returned sat
[2020-06-04 19:28:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:28:27] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2020-06-04 19:28:27] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 24 ms.
[2020-06-04 19:28:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:28:27] [INFO ] [Nat]Absence check using 181 positive place invariants in 80 ms returned sat
[2020-06-04 19:28:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:28:27] [INFO ] [Nat]Absence check using state equation in 366 ms returned sat
[2020-06-04 19:28:27] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 23 ms.
[2020-06-04 19:28:29] [INFO ] Added : 279 causal constraints over 57 iterations in 1560 ms. Result :sat
[2020-06-04 19:28:29] [INFO ] [Real]Absence check using 181 positive place invariants in 71 ms returned sat
[2020-06-04 19:28:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:28:29] [INFO ] [Real]Absence check using state equation in 316 ms returned sat
[2020-06-04 19:28:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:28:30] [INFO ] [Nat]Absence check using 181 positive place invariants in 67 ms returned sat
[2020-06-04 19:28:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:28:30] [INFO ] [Nat]Absence check using state equation in 340 ms returned sat
[2020-06-04 19:28:30] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 26 ms.
[2020-06-04 19:28:31] [INFO ] Added : 278 causal constraints over 58 iterations in 1437 ms. Result :sat
[2020-06-04 19:28:31] [INFO ] [Real]Absence check using 181 positive place invariants in 58 ms returned sat
[2020-06-04 19:28:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:28:32] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2020-06-04 19:28:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:28:32] [INFO ] [Nat]Absence check using 181 positive place invariants in 71 ms returned sat
[2020-06-04 19:28:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:28:32] [INFO ] [Nat]Absence check using state equation in 331 ms returned sat
[2020-06-04 19:28:32] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 19 ms.
[2020-06-04 19:28:34] [INFO ] Added : 275 causal constraints over 56 iterations in 1494 ms. Result :sat
[2020-06-04 19:28:34] [INFO ] [Real]Absence check using 181 positive place invariants in 74 ms returned sat
[2020-06-04 19:28:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:28:34] [INFO ] [Real]Absence check using state equation in 333 ms returned sat
[2020-06-04 19:28:34] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 20 ms.
[2020-06-04 19:28:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:28:34] [INFO ] [Nat]Absence check using 181 positive place invariants in 74 ms returned sat
[2020-06-04 19:28:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:28:35] [INFO ] [Nat]Absence check using state equation in 350 ms returned sat
[2020-06-04 19:28:35] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 20 ms.
[2020-06-04 19:28:36] [INFO ] Added : 275 causal constraints over 57 iterations in 1249 ms. Result :sat
[2020-06-04 19:28:36] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-04 19:28:36] [INFO ] Flatten gal took : 93 ms
FORMULA ShieldIIPt-PT-020A-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020A-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 19:28:36] [INFO ] Applying decomposition
[2020-06-04 19:28:36] [INFO ] Flatten gal took : 40 ms
[2020-06-04 19:28:37] [INFO ] Decomposing Gal with order
[2020-06-04 19:28:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-04 19:28:37] [INFO ] Removed a total of 80 redundant transitions.
[2020-06-04 19:28:37] [INFO ] Flatten gal took : 86 ms
[2020-06-04 19:28:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2020-06-04 19:28:37] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2020-06-04 19:28:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ShieldIIPt-PT-020A @ 3570 seconds
FORMULA ShieldIIPt-PT-020A-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-020A-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-020A-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-020A-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-020A-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-020A-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-020A-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-020A-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-020A-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-020A-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-020A-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-020A-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-020A-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-020A-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3548
rslt: Output for LTLFireability @ ShieldIIPt-PT-020A
{
"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": "Thu Jun 4 19:28:37 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 2,
"X": 2,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "((((1 <= p317) AND (1 <= p323) AND (1 <= p325) AND (1 <= p44) AND (1 <= p53)) U X ((G (((p252 <= 0) OR (p263 <= 0))) OR X (((1 <= p166) AND (1 <= p181)))))) U ((1 <= p317) AND (1 <= p323) AND (1 <= p325)))",
"processed_size": 206,
"rewrites": 123
},
"result":
{
"edges": 2332,
"markings": 2332,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"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 ((X (G (((1 <= p214) AND (1 <= p225)))) OR F (((1 <= p204) AND (1 <= p219)))))",
"processed_size": 80,
"rewrites": 123
},
"result":
{
"edges": 3653,
"markings": 3653,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 296
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 4,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 4,
"aneg": 7,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 5,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G (F ((G ((G (((p202 <= 0) OR (p227 <= 0))) AND (((1 <= p261)) AND ((1 <= p276))))) OR (X (((p52 <= 0))) AND (G (((p202 <= 0) OR (p227 <= 0))) AND (((1 <= p261)) AND ((1 <= p276))))))))",
"processed_size": 187,
"rewrites": 123
},
"result":
{
"edges": 2333,
"markings": 2333,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 15
},
"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": 323
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((G (F (((1 <= p79) AND (1 <= p96)))) AND X (((1 <= p289) AND (1 <= p302)))))",
"processed_size": 79,
"rewrites": 123
},
"result":
{
"edges": 2332,
"markings": 2332,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 3,
"U": 0,
"X": 1,
"aconj": 7,
"adisj": 0,
"aneg": 6,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 3,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (G ((F ((G (((p369 <= 0) OR (p380 <= 0))) OR (((p153 <= 0)) AND ((p369 <= 0) OR (p380 <= 0))))) AND (((1 <= p234) AND (1 <= p243)) OR X (F ((G (((p369 <= 0) OR (p380 <= 0))) OR (((p153 <= 0)) AND ((p369 <= 0) OR (p380 <= 0))))))))))",
"processed_size": 238,
"rewrites": 123
},
"result":
{
"edges": 4079458,
"markings": 2585762,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"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": 394
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 2,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((F (((p252 <= 0) OR (p263 <= 0))) AND F ((G (((1 <= p284))) OR (((p194 <= 0)) OR ((p207 <= 0)))))))",
"processed_size": 103,
"rewrites": 123
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"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": 443
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 3,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "F ((X (X (((p198 <= 0) OR (p209 <= 0)))) AND (((p128 <= 0) OR (p143 <= 0)) R ((p296 <= 0) OR (p300 <= 0) OR (p306 <= 0)))))",
"processed_size": 127,
"rewrites": 123
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 506
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((X (G (((1 <= p316) AND (1 <= p341)))) OR (G (((p68 <= 0) OR (p72 <= 0) OR (p78 <= 0))) AND F (G (((1 <= p68) AND (1 <= p72) AND (1 <= p78)))))))",
"processed_size": 150,
"rewrites": 123
},
"result":
{
"edges": 2334,
"markings": 2333,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 591
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 3,
"aneg": 1,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G ((X ((X (G (((1 <= p52) AND (1 <= p67)))) R ((p25 <= 0) OR (p34 <= 0) OR ((1 <= p194) AND (1 <= p207))))) OR (((p52 <= 0)) OR ((p67 <= 0)))))",
"processed_size": 145,
"rewrites": 123
},
"result":
{
"edges": 2332,
"markings": 2332,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 709
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 2,
"aconj": 4,
"adisj": 0,
"aneg": 1,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((G (((p251 <= 0) OR (p264 <= 0))) AND (((1 <= p255)) AND ((1 <= p266)))) U X (X (F (((1 <= p251) AND (1 <= p264) AND (1 <= p255) AND (1 <= p266))))))",
"processed_size": 151,
"rewrites": 123
},
"result":
{
"edges": 2332,
"markings": 2332,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 9,
"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": 887
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"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": "X (F (((1 <= p147) AND (1 <= p1) AND (1 <= p18))))",
"processed_size": 50,
"rewrites": 123
},
"result":
{
"edges": 2393,
"markings": 2393,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"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": 1182
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 4,
"aconj": 2,
"adisj": 1,
"aneg": 2,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X (F ((X ((X (((p30 <= 0) OR (p34 <= 0) OR (p40 <= 0))) R ((p30 <= 0) OR (p34 <= 0) OR (p40 <= 0)))) OR ((p318 <= 0))))))",
"processed_size": 128,
"rewrites": 123
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 11,
"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": 1774
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p71))))",
"processed_size": 20,
"rewrites": 123
},
"result":
{
"edges": 10,
"markings": 9,
"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"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3548
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3548
},
"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 <= p175) AND (1 <= p188))",
"processed_size": 29,
"rewrites": 123
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},
{
"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 <= p175) AND (1 <= p188))",
"processed_size": 29,
"rewrites": 123
},
"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": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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 (((p175 <= 0) OR (p188 <= 0)))",
"processed_size": 33,
"rewrites": 123
},
"result":
{
"edges": 9681,
"markings": 9662,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 47732,
"runtime": 22.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "((** U X((G(**) OR X(**)))) U **) : X((X(G(**)) OR F(**))) : G(F((G((G(*) AND (* AND *))) OR (X(*) AND (G(*) AND (* AND *)))))) : G((G(F(**)) AND X(**))) : F(G((F((G(*) OR (* AND *))) AND (** OR X(F((G(*) OR (* AND *)))))))) : X((F(*) AND F((G(**) OR (** OR **))))) : F((X(X(*)) AND (* R *))) : X((X(G(**)) OR (G(**) AND F(G(**))))) : G((X((X(G(**)) R *)) OR (** OR **))) : ((G(*) AND (** AND **)) U X(X(F(**)))) : X(F(*)) : (G(**) OR **) : F(G(**)) : X(X(F((X((X(*) R *)) OR **))))"
},
"net":
{
"arcs": 1204,
"conflict_clusters": 143,
"places": 383,
"places_significant": 202,
"singleton_clusters": 0,
"transitions": 282
},
"result":
{
"preliminary_value": "no no no no no yes yes no no no no no no yes ",
"value": "no no no no no yes yes no no no no no no yes "
},
"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: 665/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 12256
lola: finding significant places
lola: 383 places, 282 transitions, 202 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: (p317 <= 1)
lola: LP says that atomic proposition is always true: (p323 <= 1)
lola: LP says that atomic proposition is always true: (p325 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p252 <= 1)
lola: LP says that atomic proposition is always true: (p263 <= 1)
lola: LP says that atomic proposition is always true: (p166 <= 1)
lola: LP says that atomic proposition is always true: (p181 <= 1)
lola: LP says that atomic proposition is always true: (p317 <= 1)
lola: LP says that atomic proposition is always true: (p323 <= 1)
lola: LP says that atomic proposition is always true: (p325 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p225 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p219 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p202 <= 1)
lola: LP says that atomic proposition is always true: (p227 <= 1)
lola: LP says that atomic proposition is always true: (p202 <= 1)
lola: LP says that atomic proposition is always true: (p227 <= 1)
lola: LP says that atomic proposition is always true: (p261 <= 1)
lola: LP says that atomic proposition is always true: (p276 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p289 <= 1)
lola: LP says that atomic proposition is always true: (p302 <= 1)
lola: LP says that atomic proposition is always true: (p234 <= 1)
lola: LP says that atomic proposition is always true: (p243 <= 1)
lola: LP says that atomic proposition is always true: (p153 <= 1)
lola: LP says that atomic proposition is always true: (p369 <= 1)
lola: LP says that atomic proposition is always true: (p380 <= 1)
lola: LP says that atomic proposition is always true: (p252 <= 1)
lola: LP says that atomic proposition is always true: (p263 <= 1)
lola: LP says that atomic proposition is always true: (p284 <= 1)
lola: LP says that atomic proposition is always true: (p194 <= 1)
lola: LP says that atomic proposition is always true: (p207 <= 1)
lola: LP says that atomic proposition is always true: (p198 <= 1)
lola: LP says that atomic proposition is always true: (p209 <= 1)
lola: LP says that atomic proposition is always true: (p128 <= 1)
lola: LP says that atomic proposition is always true: (p143 <= 1)
lola: LP says that atomic proposition is always true: (p296 <= 1)
lola: LP says that atomic proposition is always true: (p300 <= 1)
lola: LP says that atomic proposition is always true: (p306 <= 1)
lola: LP says that atomic proposition is always true: (p316 <= 1)
lola: LP says that atomic proposition is always true: (p341 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p194 <= 1)
lola: LP says that atomic proposition is always true: (p207 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p251 <= 1)
lola: LP says that atomic proposition is always true: (p264 <= 1)
lola: LP says that atomic proposition is always true: (p255 <= 1)
lola: LP says that atomic proposition is always true: (p266 <= 1)
lola: LP says that atomic proposition is always true: (p251 <= 1)
lola: LP says that atomic proposition is always true: (p264 <= 1)
lola: LP says that atomic proposition is always true: (p255 <= 1)
lola: LP says that atomic proposition is always true: (p266 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p147 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p175 <= 1)
lola: LP says that atomic proposition is always true: (p188 <= 1)
lola: LP says that atomic proposition is always true: (p175 <= 1)
lola: LP says that atomic proposition is always true: (p188 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p318 <= 1)
lola: ((((1 <= p317) AND (1 <= p323) AND (1 <= p325) AND (1 <= p44) AND (1 <= p53)) U X ((G (((p252 <= 0) OR (p263 <= 0))) OR X (((1 <= p166) AND (1 <= p181)))))) U ((1 <= p317) AND (1 <= p323) AND (1 <= p325))) : X ((G (X (((1 <= p214) AND (1 <= p225)))) OR F (((1 <= p204) AND (1 <= p219))))) : NOT(F (G (X ((X (((1 <= p52))) U ((F ((F (((1 <= p202) AND (1 <= p227))) U ((1 <= p202) AND (1 <= p227)))) OR ((p261 <= 0))) OR ((p276 <= 0)))))))) : G ((F (G (F (((1 <= p79) AND (1 <= p96))))) AND X (((1 <= p289) AND (1 <= p302))))) : F (NOT(F (NOT(G ((((1 <= p234) AND (1 <= p243)) U F (X (NOT((((1 <= p153)) U ((1 <= p369) AND (1 <= p380)))))))))))) : (NOT(G (X (((1 <= p252) AND (1 <= p263))))) AND X (F (((G (((1 <= p284))) OR ((p194 <= 0))) OR ((p207 <= 0)))))) : NOT(G ((X (X (((1 <= p198) AND (1 <= p209)))) OR (((1 <= p128) AND (1 <= p143)) U ((1 <= p296) AND (1 <= p300) AND (1 <= p306)))))) : X ((X (G (((1 <= p316) AND (1 <= p341)))) OR (G (((p68 <= 0) OR (p72 <= 0) OR (p78 <= 0))) AND F (G (((1 <= p68) AND (1 <= p72) AND (1 <= p78))))))) : G (((NOT(X ((NOT(X (G (((1 <= p52) AND (1 <= p67))))) U ((1 <= p25) AND (1 <= p34) AND ((p194 <= 0) OR (p207 <= 0)))))) OR ((p52 <= 0))) OR ((p67 <= 0)))) : (((NOT(F (((1 <= p251) AND (1 <= p264)))) AND ((1 <= p255))) AND ((1 <= p266))) U F (X (X (F (((1 <= p251) AND (1 <= p264) AND (1 <= p255) AND (1 <= p266))))))) : F ((F ((NOT(X (((1 <= p1) AND (1 <= p18)))) OR NOT(X (((1 <= p88) AND (1 <= p113)))))) U NOT(X (((p147 <= 0) OR (p1 <= 0) OR (p18 <= 0)))))) : (G (((p175 <= 0) OR (p188 <= 0))) OR ((1 <= p175) AND (1 <= p188))) : X (F (G (((1 <= p71))))) : X (X (F ((NOT((X (X (((1 <= p30) AND (1 <= p34) AND (1 <= p40)))) U X (((1 <= p30) AND (1 <= p34) AND (1 <= p40))))) OR ((p318 <= 0))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:338
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:356
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p317) AND (1 <= p323) AND (1 <= p325) AND (1 <= p44) AND (1 <= p53)) U X ((G (((p252 <= 0) OR (p263 <= 0))) OR X (((1 <= p166) AND (1 <= p181)))))) U ((1 <= p317) AND (1 <= p323) AND (1 <= p325)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((1 <= p317) AND (1 <= p323) AND (1 <= p325) AND (1 <= p44) AND (1 <= p53)) U X ((G (((p252 <= 0) OR (p263 <= 0))) OR X (((1 <= p166) AND (1 <= p181)))))) U ((1 <= p317) AND (1 <= p323) AND (1 <= p325)))
lola: processed formula length: 206
lola: 123 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 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: 2332 markings, 2332 edges
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G (((1 <= p214) AND (1 <= p225)))) OR F (((1 <= p204) AND (1 <= p219)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G (((1 <= p214) AND (1 <= p225)))) OR F (((1 <= p204) AND (1 <= p219)))))
lola: processed formula length: 80
lola: 123 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: 3653 markings, 3653 edges
lola: ========================================
lola: subprocess 2 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((G (((p202 <= 0) OR (p227 <= 0))) AND (((1 <= p261)) AND ((1 <= p276))))) OR (X (((p52 <= 0))) AND (G (((p202 <= 0) OR (p227 <= 0))) AND (((1 <= p261)) AND ((1 <= p276))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((G (((p202 <= 0) OR (p227 <= 0))) AND (((1 <= p261)) AND ((1 <= p276))))) OR (X (((p52 <= 0))) AND (G (((p202 <= 0) OR (p227 <= 0))) AND (((1 <= p261)) AND ((1 <= p276))))))))
lola: processed formula length: 187
lola: 123 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 15 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: 2333 markings, 2333 edges
lola: ========================================
lola: subprocess 3 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G (F (((1 <= p79) AND (1 <= p96)))) AND X (((1 <= p289) AND (1 <= p302)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G (F (((1 <= p79) AND (1 <= p96)))) AND X (((1 <= p289) AND (1 <= p302)))))
lola: processed formula length: 79
lola: 123 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: 2332 markings, 2332 edges
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((G (((p369 <= 0) OR (p380 <= 0))) OR (((p153 <= 0)) AND ((p369 <= 0) OR (p380 <= 0))))) AND (((1 <= p234) AND (1 <= p243)) OR X (F ((G (((p369 <= 0) OR (p380 <= 0))) OR (((p153 <= 0)) AND ((p369 <= 0) OR (p380 <= 0))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((G (((p369 <= 0) OR (p380 <= 0))) OR (((p153 <= 0)) AND ((p369 <= 0) OR (p380 <= 0))))) AND (((1 <= p234) AND (1 <= p243)) OR X (F ((G (((p369 <= 0) OR (p380 <= 0))) OR (((p153 <= 0)) AND ((p369 <= 0) OR (p380 <= 0))))))))))
lola: processed formula length: 238
lola: 123 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 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: 1044806 markings, 1585539 edges, 208961 markings/sec, 0 secs
lola: 1992155 markings, 3105717 edges, 189470 markings/sec, 5 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: 2585762 markings, 4079458 edges
lola: ========================================
lola: subprocess 5 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((p252 <= 0) OR (p263 <= 0))) AND F ((G (((1 <= p284))) OR (((p194 <= 0)) OR ((p207 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((p252 <= 0) OR (p263 <= 0))) AND F ((G (((1 <= p284))) OR (((p194 <= 0)) OR ((p207 <= 0)))))))
lola: processed formula length: 103
lola: 123 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 6 will run for 443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (X (((p198 <= 0) OR (p209 <= 0)))) AND (((p128 <= 0) OR (p143 <= 0)) R ((p296 <= 0) OR (p300 <= 0) OR (p306 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (X (((p198 <= 0) OR (p209 <= 0)))) AND (((p128 <= 0) OR (p143 <= 0)) R ((p296 <= 0) OR (p300 <= 0) OR (p306 <= 0)))))
lola: processed formula length: 127
lola: 123 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 7 will run for 506 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G (((1 <= p316) AND (1 <= p341)))) OR (G (((p68 <= 0) OR (p72 <= 0) OR (p78 <= 0))) AND F (G (((1 <= p68) AND (1 <= p72) AND (1 <= p78)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G (((1 <= p316) AND (1 <= p341)))) OR (G (((p68 <= 0) OR (p72 <= 0) OR (p78 <= 0))) AND F (G (((1 <= p68) AND (1 <= p72) AND (1 <= p78)))))))
lola: processed formula length: 150
lola: 123 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 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: 2333 markings, 2334 edges
lola: ========================================
lola: subprocess 8 will run for 591 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X ((X (G (((1 <= p52) AND (1 <= p67)))) R ((p25 <= 0) OR (p34 <= 0) OR ((1 <= p194) AND (1 <= p207))))) OR (((p52 <= 0)) OR ((p67 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X ((X (G (((1 <= p52) AND (1 <= p67)))) R ((p25 <= 0) OR (p34 <= 0) OR ((1 <= p194) AND (1 <= p207))))) OR (((p52 <= 0)) OR ((p67 <= 0)))))
lola: processed formula length: 145
lola: 123 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: 2332 markings, 2332 edges
lola: ========================================
lola: subprocess 9 will run for 709 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G (((p251 <= 0) OR (p264 <= 0))) AND (((1 <= p255)) AND ((1 <= p266)))) U X (X (F (((1 <= p251) AND (1 <= p264) AND (1 <= p255) AND (1 <= p266))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((G (((p251 <= 0) OR (p264 <= 0))) AND (((1 <= p255)) AND ((1 <= p266)))) U X (X (F (((1 <= p251) AND (1 <= p264) AND (1 <= p255) AND (1 <= p266))))))
lola: processed formula length: 151
lola: 123 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: 2332 markings, 2332 edges
lola: ========================================
lola: subprocess 10 will run for 887 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p147) AND (1 <= p1) AND (1 <= p18))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p147) AND (1 <= p1) AND (1 <= p18))))
lola: processed formula length: 50
lola: 123 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: 2393 markings, 2393 edges
lola: ========================================
lola: subprocess 11 will run for 1182 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((X ((X (((p30 <= 0) OR (p34 <= 0) OR (p40 <= 0))) R ((p30 <= 0) OR (p34 <= 0) OR (p40 <= 0)))) OR ((p318 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((X ((X (((p30 <= 0) OR (p34 <= 0) OR (p40 <= 0))) R ((p30 <= 0) OR (p34 <= 0) OR (p40 <= 0)))) OR ((p318 <= 0))))))
lola: processed formula length: 128
lola: 123 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 12 will run for 1774 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p71))))
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 <= p71))))
lola: processed formula length: 20
lola: 123 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: 9 markings, 10 edges
lola: ========================================
lola: subprocess 13 will run for 3548 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((p175 <= 0) OR (p188 <= 0))) OR ((1 <= p175) AND (1 <= p188)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 3548 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p175) AND (1 <= p188))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p175) AND (1 <= p188))
lola: processed formula length: 29
lola: 123 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: (G (((p175 <= 0) OR (p188 <= 0))) OR ((1 <= p175) AND (1 <= p188)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p175) AND (1 <= p188))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p175) AND (1 <= p188))
lola: processed formula length: 29
lola: 123 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 (((p175 <= 0) OR (p188 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p175 <= 0) OR (p188 <= 0)))
lola: processed formula length: 33
lola: 123 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: 9662 markings, 9681 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no yes yes no no no no no no yes
lola:
preliminary result: no no no no no yes yes no no no no no no yes
lola: memory consumption: 47732 KB
lola: time consumption: 22 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="ShieldIIPt-PT-020A"
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 ShieldIIPt-PT-020A, 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 r211-tajo-159033477300314"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-020A.tgz
mv ShieldIIPt-PT-020A 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 ;