About the Execution of ITS-LoLa for CloudDeployment-PT-4a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15743.120 | 3600000.00 | 322714.00 | 1889.80 | FTFFFTFFFFFFFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2020-input.r168-smll-158987806500298.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 CloudDeployment-PT-4a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-smll-158987806500298
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 3.5K Mar 30 01:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 30 01:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 15:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 27 08:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 08:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 26 07:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 26 07:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 156K 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 CloudDeployment-PT-4a-00
FORMULA_NAME CloudDeployment-PT-4a-01
FORMULA_NAME CloudDeployment-PT-4a-02
FORMULA_NAME CloudDeployment-PT-4a-03
FORMULA_NAME CloudDeployment-PT-4a-04
FORMULA_NAME CloudDeployment-PT-4a-05
FORMULA_NAME CloudDeployment-PT-4a-06
FORMULA_NAME CloudDeployment-PT-4a-07
FORMULA_NAME CloudDeployment-PT-4a-08
FORMULA_NAME CloudDeployment-PT-4a-09
FORMULA_NAME CloudDeployment-PT-4a-10
FORMULA_NAME CloudDeployment-PT-4a-11
FORMULA_NAME CloudDeployment-PT-4a-12
FORMULA_NAME CloudDeployment-PT-4a-13
FORMULA_NAME CloudDeployment-PT-4a-14
FORMULA_NAME CloudDeployment-PT-4a-15
=== Now, execution of the tool begins
BK_START 1591277534488
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 13:32:17] [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 13:32:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 13:32:17] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2020-06-04 13:32:17] [INFO ] Transformed 141 places.
[2020-06-04 13:32:17] [INFO ] Transformed 475 transitions.
[2020-06-04 13:32:17] [INFO ] Found NUPN structural information;
[2020-06-04 13:32:17] [INFO ] Parsed PT model containing 141 places and 475 transitions in 273 ms.
Ensure Unique test removed 52 transitions
Reduce redundant transitions removed 52 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 51 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1627 resets, run finished after 535 ms. (steps per millisecond=186 ) properties seen :[1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1]
[2020-06-04 13:32:18] [INFO ] Flow matrix only has 226 transitions (discarded 197 similar events)
// Phase 1: matrix 226 rows 141 cols
[2020-06-04 13:32:18] [INFO ] Computed 24 place invariants in 15 ms
[2020-06-04 13:32:18] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 31 ms returned unsat
[2020-06-04 13:32:18] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 25 ms returned sat
[2020-06-04 13:32:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 13:32:19] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2020-06-04 13:32:19] [INFO ] State equation strengthened by 90 read => feed constraints.
[2020-06-04 13:32:19] [INFO ] [Real]Added 90 Read/Feed constraints in 31 ms returned sat
[2020-06-04 13:32:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 13:32:19] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 33 ms returned sat
[2020-06-04 13:32:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 13:32:19] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2020-06-04 13:32:19] [INFO ] [Nat]Added 90 Read/Feed constraints in 54 ms returned sat
[2020-06-04 13:32:19] [INFO ] Computed and/alt/rep : 422/2436/225 causal constraints in 62 ms.
[2020-06-04 13:32:20] [INFO ] Added : 141 causal constraints over 29 iterations in 1117 ms. Result :sat
[2020-06-04 13:32:20] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 23 ms returned sat
[2020-06-04 13:32:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 13:32:21] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2020-06-04 13:32:21] [INFO ] [Real]Added 90 Read/Feed constraints in 50 ms returned sat
[2020-06-04 13:32:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 13:32:21] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 23 ms returned sat
[2020-06-04 13:32:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 13:32:21] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2020-06-04 13:32:21] [INFO ] [Nat]Added 90 Read/Feed constraints in 62 ms returned sat
[2020-06-04 13:32:21] [INFO ] Computed and/alt/rep : 422/2436/225 causal constraints in 69 ms.
[2020-06-04 13:32:22] [INFO ] Added : 136 causal constraints over 28 iterations in 967 ms. Result :sat
[2020-06-04 13:32:22] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 13 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-06-04 13:32:23] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-04 13:32:23] [INFO ] Flatten gal took : 159 ms
FORMULA CloudDeployment-PT-4a-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4a-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4a-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 13:32:23] [INFO ] Applying decomposition
[2020-06-04 13:32:23] [INFO ] Flatten gal took : 73 ms
[2020-06-04 13:32:23] [INFO ] Decomposing Gal with order
[2020-06-04 13:32:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-04 13:32:23] [INFO ] Removed a total of 951 redundant transitions.
[2020-06-04 13:32:23] [INFO ] Flatten gal took : 185 ms
[2020-06-04 13:32:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 30 ms.
[2020-06-04 13:32:23] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 7 ms.
[2020-06-04 13:32:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 6 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ CloudDeployment-PT-4a @ 3570 seconds
FORMULA CloudDeployment-PT-4a-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudDeployment-PT-4a-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudDeployment-PT-4a-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudDeployment-PT-4a-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudDeployment-PT-4a-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudDeployment-PT-4a-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudDeployment-PT-4a-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudDeployment-PT-4a-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudDeployment-PT-4a-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudDeployment-PT-4a-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudDeployment-PT-4a-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudDeployment-PT-4a-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudDeployment-PT-4a-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3272
rslt: Output for LTLFireability @ CloudDeployment-PT-4a
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 13:32:25 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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 (((p83 <= 0)))",
"processed_size": 16,
"rewrites": 119
},
"result":
{
"edges": 12,
"markings": 12,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"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": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G (((1 <= p86) AND (1 <= p116))))",
"processed_size": 36,
"rewrites": 119
},
"result":
{
"edges": 6,
"markings": 6,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 7,
"adisj": 0,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 4,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F ((G ((X ((((1 <= p51)) U ((1 <= p86) AND (1 <= p88) AND (1 <= p112) AND (1 <= p129)))) OR ((1 <= p51)))) AND (((1 <= p86)) AND (((1 <= p88)) AND (((1 <= p112)) AND ((1 <= p129)))))))",
"processed_size": 184,
"rewrites": 119
},
"result":
{
"edges": 7,
"markings": 7,
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 2,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 3,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G (F ((X (F (((p58 <= 0) OR (p60 <= 0) OR (p75 <= 0) OR (p130 <= 0) OR (p139 <= 0)))) AND (F (((p75 <= 0))) OR G (F (((p58 <= 0) OR (p60 <= 0) OR (p75 <= 0) OR (p130 <= 0) OR (p139 <= 0))))))))",
"processed_size": 201,
"rewrites": 119
},
"result":
{
"edges": 11373887,
"markings": 393496,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 355
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 0,
"aneg": 3,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "G (F ((X (F (((1 <= p32) AND (1 <= p45)))) AND ((((p50 <= 0)) R ((p2 <= 0) OR (p4 <= 0) OR (p28 <= 0) OR (p121 <= 0))) AND ((p32 <= 0) OR (p45 <= 0))))))",
"processed_size": 157,
"rewrites": 119
},
"result":
{
"edges": 6,
"markings": 6,
"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": 394
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 4,
"U": 1,
"X": 1,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "(X (F ((G (((1 <= p86) AND (1 <= p116))) OR (G (F (((p2 <= 0) OR (p4 <= 0) OR (p25 <= 0) OR (p130 <= 0) OR (p139 <= 0)))) AND F (G (((1 <= p86) AND (1 <= p116)))))))) U G (((1 <= p2) AND (1 <= p4) AND (1 <= p25) AND (1 <= p130) AND (1 <= p139))))",
"processed_size": 250,
"rewrites": 119
},
"result":
{
"edges": 198516885,
"markings": 6345325,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 20
},
"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": 409
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 409
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "(((1 <= p32) AND (1 <= p86)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p16) AND (1 <= p30) AND (1 <= p32) AND (1 <= p44) AND (1 <= p58) AND (1 <= p60) AND (1 <= p72) AND (1 <= p86) AND (1 <= p88) AND (1 <= p100) AND (1 <= p130) AND (1 <= p140)))",
"processed_size": 242,
"rewrites": 119
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 467
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 18,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "X (G ((((1 <= p2) AND (1 <= p4) AND (1 <= p16) AND (1 <= p30) AND (1 <= p32) AND (1 <= p44) AND (1 <= p58) AND (1 <= p60) AND (1 <= p72) AND (1 <= p86) AND (1 <= p88) AND (1 <= p100) AND (1 <= p130) AND (1 <= p140)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p28) AND (1 <= p129)))))",
"processed_size": 279,
"rewrites": 119
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 467
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 0,
"aneg": 3,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(X (G (((1 <= p11)))) R ((((p67 <= 0)) R ((p60 <= 0) OR (p86 <= 0))) R ((p60 <= 0) OR (p86 <= 0))))",
"processed_size": 101,
"rewrites": 119
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"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": 545
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 3,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"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": 6,
"visible_transitions": 0
},
"processed": "X (G ((G (((p32 <= 0) OR (p88 <= 0))) AND X (X (((1 <= p30) AND (1 <= p32) AND (1 <= p53) AND (1 <= p130) AND (1 <= p139)))))))",
"processed_size": 128,
"rewrites": 119
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 654
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 654
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((p30 <= 0) OR (p32 <= 0) OR (p45 <= 0) OR (p130 <= 0) OR (p139 <= 0))",
"processed_size": 74,
"rewrites": 119
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 818
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"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": "F ((X (G (((1 <= p69)))) OR (G (((1 <= p69))) AND F (G (((1 <= p69)))))))",
"processed_size": 73,
"rewrites": 119
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 818
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (X (G ((F (((p96 <= 0))) AND ((p58 <= 0) OR (p60 <= 0) OR (p72 <= 0) OR (p130 <= 0) OR (p139 <= 0))))))",
"processed_size": 109,
"rewrites": 119
},
"result":
{
"edges": 928,
"markings": 57,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 1090
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1090
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((1 <= p15))",
"processed_size": 12,
"rewrites": 121
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1636
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 3,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(X (X (G (((1 <= p15))))) U (X (((1 <= p15))) OR ((1 <= p20))))",
"processed_size": 63,
"rewrites": 119
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1636
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((p2 <= 0) OR (p4 <= 0) OR (p8 <= 0) OR (p130 <= 0) OR (p139 <= 0))",
"processed_size": 71,
"rewrites": 121
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 194
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3272
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3272
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((p96 <= 0))",
"processed_size": 12,
"rewrites": 121
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 71716,
"runtime": 298.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(G(**)) OR G(**)) : F((G((X((** U **)) OR **)) AND (** AND (** AND (** AND **))))) : G(F((X(F(*)) AND (F(*) OR G(F(*)))))) : G(F((X(F(**)) AND ((* R *) AND *)))) : (X(F((G(**) OR (G(F(**)) AND F(G(**)))))) U G(**)) : (X(G(**)) OR (X(F(**)) AND **)) : (X(G(**)) R ((* R *) R *)) : X(G((G(**) AND X(X(**))))) : (F(**) OR (F(**) AND F(G(*)))) : F(**) : (F((X(G(**)) OR (G(**) AND F(G(**))))) AND **) : X(X(G((F(*) AND *)))) : ((X(X(G(**))) U (X(**) OR **)) AND F(**))"
},
"net":
{
"arcs": 2481,
"conflict_clusters": 36,
"places": 141,
"places_significant": 117,
"singleton_clusters": 0,
"transitions": 423
},
"result":
{
"preliminary_value": "no no no no no no no no no no no no no ",
"value": "no no no no no no no no no no no no 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: 564/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 141
lola: finding significant places
lola: 141 places, 423 transitions, 117 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: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p129 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p129 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p140 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p129 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p140 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p140 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: (G (X (((1 <= p86) AND (1 <= p116)))) OR G (((p83 <= 0)))) : F (((((G ((X ((((1 <= p51)) U ((1 <= p86) AND (1 <= p88) AND (1 <= p112) AND (1 <= p129)))) OR ((1 <= p51)))) AND ((1 <= p86))) AND ((1 <= p88))) AND ((1 <= p112))) AND ((1 <= p129)))) : F (NOT(F (NOT(F (NOT(X ((G (((1 <= p75))) U X (G (((1 <= p58) AND (1 <= p60) AND (1 <= p75) AND (1 <= p130) AND (1 <= p139)))))))))))) : X (G (X (NOT(G (((NOT(F (X (((1 <= p32) AND (1 <= p45))))) OR (((1 <= p50)) U ((1 <= p2) AND (1 <= p4) AND (1 <= p28) AND (1 <= p121)))) OR ((1 <= p32) AND (1 <= p45)))))))) : (X (F ((X (G (F (((p2 <= 0) OR (p4 <= 0) OR (p25 <= 0) OR (p130 <= 0) OR (p139 <= 0))))) U G (((1 <= p86) AND (1 <= p116)))))) U G (((1 <= p2) AND (1 <= p4) AND (1 <= p25) AND (1 <= p130) AND (1 <= p139)))) : (G (X ((((1 <= p2) AND (1 <= p4) AND (1 <= p16) AND (1 <= p30) AND (1 <= p32) AND (1 <= p44) AND (1 <= p58) AND (1 <= p60) AND (1 <= p72) AND (1 <= p86) AND (1 <= p88) AND (1 <= p100) AND (1 <= p130) AND (1 <= p140)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p28) AND (1 <= p129))))) OR (F (X (((1 <= p2) AND (1 <= p4) AND (1 <= p16) AND (1 <= p30) AND (1 <= p32) AND (1 <= p44) AND (1 <= p58) AND (1 <= p60) AND (1 <= p72) AND (1 <= p86) AND (1 <= p88) AND (1 <= p100) AND (1 <= p130) AND (1 <= p140)))) AND (((1 <= p32) AND (1 <= p86)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p16) AND (1 <= p30) AND (1 <= p32) AND (1 <= p44) AND (1 <= p58) AND (1 <= p60) AND (1 <= p72) AND (1 <= p86) AND (1 <= p88) AND (1 <= p100) AND (1 <= p130) AND (1 <= p140))))) : NOT((X (NOT(G (((1 <= p11))))) U ((((1 <= p67)) U ((1 <= p60) AND (1 <= p86))) U ((1 <= p60) AND (1 <= p86))))) : G (X ((G (((p32 <= 0) OR (p88 <= 0))) AND X (X (((1 <= p30) AND (1 <= p32) AND (1 <= p53) AND (1 <= p130) AND (1 <= p139))))))) : (G (NOT(G (NOT(G (NOT(F (X (((1 <= p96)))))))))) U F (((1 <= p96)))) : F (((1 <= p2) AND (1 <= p4) AND (1 <= p8) AND (1 <= p130) AND (1 <= p139))) : (F ((G (((1 <= p69))) U NOT(X (NOT(G (((1 <= p69)))))))) AND ((p30 <= 0) OR (p32 <= 0) OR (p45 <= 0) OR (p130 <= 0) OR (p139 <= 0))) : NOT(X (F (X ((G (((1 <= p96))) OR ((1 <= p58) AND (1 <= p60) AND (1 <= p72) AND (1 <= p130) AND (1 <= p139))))))) : ((G (X (X (G (((1 <= p15)))))) U (X (((1 <= p15))) OR ((1 <= p20)))) AND F (((p15 <= 0))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:332
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:329
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:338
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((1 <= p86) AND (1 <= p116)))) OR G (((p83 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p83 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p83 <= 0)))
lola: processed formula length: 16
lola: 119 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: 12 markings, 12 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p86) AND (1 <= p116))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p86) AND (1 <= p116))))
lola: processed formula length: 36
lola: 119 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: 6 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((X ((((1 <= p51)) U ((1 <= p86) AND (1 <= p88) AND (1 <= p112) AND (1 <= p129)))) OR ((1 <= p51)))) AND (((1 <= p86)) AND (((1 <= p88)) AND (((1 <= p112)) AND ((1 <= p129)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((X ((((1 <= p51)) U ((1 <= p86) AND (1 <= p88) AND (1 <= p112) AND (1 <= p129)))) OR ((1 <= p51)))) AND (((1 <= p86)) AND (((1 <= p88)) AND (((1 <= p112)) AND ((1 <= p129)))))))
lola: processed formula length: 184
lola: 119 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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X (F (((p58 <= 0) OR (p60 <= 0) OR (p75 <= 0) OR (p130 <= 0) OR (p139 <= 0)))) AND (F (((p75 <= 0))) OR G (F (((p58 <= 0) OR (p60 <= 0) OR (p75 <= 0) OR (p130 <= 0) OR (p139 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (F (((p58 <= 0) OR (p60 <= 0) OR (p75 <= 0) OR (p130 <= 0) OR (p139 <= 0)))) AND (F (((p75 <= 0))) OR G (F (((p58 <= 0) OR (p60 <= 0) OR (p75 <= 0) OR (p130 <= 0) OR (p139 <= 0))))))))
lola: processed formula length: 201
lola: 119 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: 127260 markings, 3527913 edges, 25452 markings/sec, 0 secs
lola: 248666 markings, 7116836 edges, 24281 markings/sec, 5 secs
lola: 369018 markings, 10661983 edges, 24070 markings/sec, 10 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: 393496 markings, 11373887 edges
lola: ========================================
lola: subprocess 3 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X (F (((1 <= p32) AND (1 <= p45)))) AND ((((p50 <= 0)) R ((p2 <= 0) OR (p4 <= 0) OR (p28 <= 0) OR (p121 <= 0))) AND ((p32 <= 0) OR (p45 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (F (((1 <= p32) AND (1 <= p45)))) AND ((((p50 <= 0)) R ((p2 <= 0) OR (p4 <= 0) OR (p28 <= 0) OR (p121 <= 0))) AND ((p32 <= 0) OR (p45 <= 0))))))
lola: processed formula length: 157
lola: 119 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 4 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((G (((1 <= p86) AND (1 <= p116))) OR (G (F (((p2 <= 0) OR (p4 <= 0) OR (p25 <= 0) OR (p130 <= 0) OR (p139 <= 0)))) AND F (G (((1 <= p86) AND (1 <= p116)))))))) U G (((1 <= p2) AND (1 <= p4) AND (1 <= p25) AND (1 <= p130) AND (1 <= p139))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (F ((G (((1 <= p86) AND (1 <= p116))) OR (G (F (((p2 <= 0) OR (p4 <= 0) OR (p25 <= 0) OR (p130 <= 0) OR (p139 <= 0)))) AND F (G (((1 <= p86) AND (1 <= p116)))))))) U G (((1 <= p2) AND (1 <= p4) AND (1 <= p25) AND (1 <= p130) AND (1 <= p139))))
lola: processed formula length: 250
lola: 119 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 20 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: 126220 markings, 3615250 edges, 25244 markings/sec, 0 secs
lola: 254745 markings, 7392310 edges, 25705 markings/sec, 5 secs
lola: 385495 markings, 11201420 edges, 26150 markings/sec, 10 secs
lola: 509314 markings, 14962503 edges, 24764 markings/sec, 15 secs
lola: 639060 markings, 18799330 edges, 25949 markings/sec, 20 secs
lola: 763905 markings, 22556299 edges, 24969 markings/sec, 25 secs
lola: 881583 markings, 26197593 edges, 23536 markings/sec, 30 secs
lola: 1001010 markings, 29837263 edges, 23885 markings/sec, 35 secs
lola: 1111636 markings, 33507240 edges, 22125 markings/sec, 40 secs
lola: 1228182 markings, 37198726 edges, 23309 markings/sec, 45 secs
lola: 1342762 markings, 40828657 edges, 22916 markings/sec, 50 secs
lola: 1460644 markings, 44521855 edges, 23576 markings/sec, 55 secs
lola: 1575774 markings, 48182584 edges, 23026 markings/sec, 60 secs
lola: 1685870 markings, 51609242 edges, 22019 markings/sec, 65 secs
lola: 1800341 markings, 55237686 edges, 22894 markings/sec, 70 secs
lola: 1916009 markings, 58870968 edges, 23134 markings/sec, 75 secs
lola: 2034839 markings, 62604437 edges, 23766 markings/sec, 80 secs
lola: 2151730 markings, 66255768 edges, 23378 markings/sec, 85 secs
lola: 2270662 markings, 70017472 edges, 23786 markings/sec, 90 secs
lola: 2392616 markings, 73867596 edges, 24391 markings/sec, 95 secs
lola: 2514853 markings, 77619076 edges, 24447 markings/sec, 100 secs
lola: 2630524 markings, 81196113 edges, 23134 markings/sec, 105 secs
lola: 2744113 markings, 84802944 edges, 22718 markings/sec, 110 secs
lola: 2859240 markings, 88440008 edges, 23025 markings/sec, 115 secs
lola: 2969342 markings, 91929400 edges, 22020 markings/sec, 120 secs
lola: 3085215 markings, 95558810 edges, 23175 markings/sec, 125 secs
lola: 3201408 markings, 99189089 edges, 23239 markings/sec, 130 secs
lola: 3313046 markings, 102688827 edges, 22328 markings/sec, 135 secs
lola: 3424867 markings, 106156298 edges, 22364 markings/sec, 140 secs
lola: 3535433 markings, 109600871 edges, 22113 markings/sec, 145 secs
lola: 3647660 markings, 113097508 edges, 22445 markings/sec, 150 secs
lola: 3759151 markings, 116547665 edges, 22298 markings/sec, 155 secs
lola: 3868882 markings, 119988374 edges, 21946 markings/sec, 160 secs
lola: 3976185 markings, 123410597 edges, 21461 markings/sec, 165 secs
lola: 4077265 markings, 126618293 edges, 20216 markings/sec, 170 secs
lola: 4184906 markings, 129992555 edges, 21528 markings/sec, 175 secs
lola: 4291361 markings, 133289151 edges, 21291 markings/sec, 180 secs
lola: 4395898 markings, 136562121 edges, 20907 markings/sec, 185 secs
lola: 4515538 markings, 140188461 edges, 23928 markings/sec, 190 secs
lola: 4637962 markings, 143906950 edges, 24485 markings/sec, 195 secs
lola: 4755774 markings, 147497735 edges, 23562 markings/sec, 200 secs
lola: 4864684 markings, 151169058 edges, 21782 markings/sec, 205 secs
lola: 4976009 markings, 154754038 edges, 22265 markings/sec, 210 secs
lola: 5093423 markings, 158509337 edges, 23483 markings/sec, 215 secs
lola: 5202978 markings, 162026839 edges, 21911 markings/sec, 220 secs
lola: 5310018 markings, 165449109 edges, 21408 markings/sec, 225 secs
lola: 5418026 markings, 168895868 edges, 21602 markings/sec, 230 secs
lola: 5519447 markings, 172201277 edges, 20284 markings/sec, 235 secs
lola: 5630749 markings, 175618696 edges, 22260 markings/sec, 240 secs
lola: 5740661 markings, 179213124 edges, 21982 markings/sec, 245 secs
lola: 5851102 markings, 182772082 edges, 22088 markings/sec, 250 secs
lola: 5956964 markings, 186186340 edges, 21172 markings/sec, 255 secs
lola: 6065033 markings, 189576406 edges, 21614 markings/sec, 260 secs
lola: 6175729 markings, 193099703 edges, 22139 markings/sec, 265 secs
lola: 6285920 markings, 196596916 edges, 22038 markings/sec, 270 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: 6345325 markings, 198516885 edges
lola: ========================================
lola: subprocess 5 will run for 409 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((((1 <= p2) AND (1 <= p4) AND (1 <= p16) AND (1 <= p30) AND (1 <= p32) AND (1 <= p44) AND (1 <= p58) AND (1 <= p60) AND (1 <= p72) AND (1 <= p86) AND (1 <= p88) AND (1 <= p100) AND (1 <= p130) AND (1 <= p140)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p28) AND (1 <= p129))))) OR (X (F (((1 <= p2) AND (1 <= p4) AND (1 <= p16) AND (1 <= p30) AND (1 <= p32) AND (1 <= p44) AND (1 <= p58) AND (1 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 409 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p32) AND (1 <= p86)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p16) AND (1 <= p30) AND (1 <= p32) AND (1 <= p44) AND (1 <= p58) AND (1 <= p60) AND (1 <= p72) AND (1 <= p86) AND (1 <= p88) AND (1 <= p100) AND (1 <= p130) AND (1 <= p140)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p32) AND (1 <= p86)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p16) AND (1 <= p30) AND (1 <= p32) AND (1 <= p44) AND (1 <= p58) AND (1 <= p60) AND (1 <= p72) AND (1 <= p86) AND (1 <= p88) AND (1 <= p100) AND (1 <= p130) AND (1 <= p140)))
lola: processed formula length: 242
lola: 119 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 16 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 6 will run for 467 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((1 <= p2) AND (1 <= p4) AND (1 <= p16) AND (1 <= p30) AND (1 <= p32) AND (1 <= p44) AND (1 <= p58) AND (1 <= p60) AND (1 <= p72) AND (1 <= p86) AND (1 <= p88) AND (1 <= p100) AND (1 <= p130) AND (1 <= p140)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p28) AND (1 <= p129)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((1 <= p2) AND (1 <= p4) AND (1 <= p16) AND (1 <= p30) AND (1 <= p32) AND (1 <= p44) AND (1 <= p58) AND (1 <= p60) AND (1 <= p72) AND (1 <= p86) AND (1 <= p88) AND (1 <= p100) AND (1 <= p130) AND (1 <= p140)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p28) AND (1 <= p129)))))
lola: processed formula length: 279
lola: 119 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: 6 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 467 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((1 <= p11)))) R ((((p67 <= 0)) R ((p60 <= 0) OR (p86 <= 0))) R ((p60 <= 0) OR (p86 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (G (((1 <= p11)))) R ((((p67 <= 0)) R ((p60 <= 0) OR (p86 <= 0))) R ((p60 <= 0) OR (p86 <= 0))))
lola: processed formula length: 101
lola: 119 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 7 will run for 545 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G (((p32 <= 0) OR (p88 <= 0))) AND X (X (((1 <= p30) AND (1 <= p32) AND (1 <= p53) AND (1 <= p130) AND (1 <= p139)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G (((p32 <= 0) OR (p88 <= 0))) AND X (X (((1 <= p30) AND (1 <= p32) AND (1 <= p53) AND (1 <= p130) AND (1 <= p139)))))))
lola: processed formula length: 128
lola: 119 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 8 will run for 654 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((X (G (((1 <= p69)))) OR (G (((1 <= p69))) AND F (G (((1 <= p69))))))) AND ((p30 <= 0) OR (p32 <= 0) OR (p45 <= 0) OR (p130 <= 0) OR (p139 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 654 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p30 <= 0) OR (p32 <= 0) OR (p45 <= 0) OR (p130 <= 0) OR (p139 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p30 <= 0) OR (p32 <= 0) OR (p45 <= 0) OR (p130 <= 0) OR (p139 <= 0))
lola: processed formula length: 74
lola: 119 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 5 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 9 will run for 818 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (G (((1 <= p69)))) OR (G (((1 <= p69))) AND F (G (((1 <= p69)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (G (((1 <= p69)))) OR (G (((1 <= p69))) AND F (G (((1 <= p69)))))))
lola: processed formula length: 73
lola: 119 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: 7 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 818 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((F (((p96 <= 0))) AND ((p58 <= 0) OR (p60 <= 0) OR (p72 <= 0) OR (p130 <= 0) OR (p139 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((F (((p96 <= 0))) AND ((p58 <= 0) OR (p60 <= 0) OR (p72 <= 0) OR (p130 <= 0) OR (p139 <= 0))))))
lola: processed formula length: 109
lola: 119 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: 57 markings, 928 edges
lola: ========================================
lola: subprocess 10 will run for 1090 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (X (G (((1 <= p15))))) U (X (((1 <= p15))) OR ((1 <= p20)))) AND F (((p15 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1090 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((p15 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((1 <= p15))
lola: processed formula length: 12
lola: 121 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 1636 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (G (((1 <= p15))))) U (X (((1 <= p15))) OR ((1 <= p20))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (X (G (((1 <= p15))))) U (X (((1 <= p15))) OR ((1 <= p20))))
lola: processed formula length: 63
lola: 119 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: 6 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 1636 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p2) AND (1 <= p4) AND (1 <= p8) AND (1 <= p130) AND (1 <= p139)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p2 <= 0) OR (p4 <= 0) OR (p8 <= 0) OR (p130 <= 0) OR (p139 <= 0))
lola: processed formula length: 71
lola: 121 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 10 markings, 10 edges
lola: ========================================
lola: subprocess 12 will run for 3272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p96))) OR (F (((1 <= p96))) AND F (G (((p96 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 3272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p96)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p96 <= 0))
lola: processed formula length: 12
lola: 121 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 8 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: RESULT
lola:
SUMMARY: no no no no no no no no no no no no no
lola:
preliminary result: no no no no no no no no no no no no no
lola: ========================================
lola: memory consumption: 71716 KB
lola: time consumption: 298 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="CloudDeployment-PT-4a"
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 CloudDeployment-PT-4a, 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 r168-smll-158987806500298"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-4a.tgz
mv CloudDeployment-PT-4a 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 ;